./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.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_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/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 9722a10940ebd7a5d75170225a40cd37454d0528 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 01:43:52,051 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:43:52,052 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:43:52,058 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:43:52,058 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:43:52,059 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:43:52,060 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:43:52,060 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:43:52,061 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:43:52,062 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:43:52,062 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:43:52,062 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:43:52,063 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:43:52,064 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:43:52,064 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:43:52,065 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:43:52,065 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:43:52,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:43:52,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:43:52,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:43:52,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:43:52,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:43:52,070 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:43:52,070 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:43:52,070 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:43:52,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:43:52,071 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:43:52,072 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:43:52,072 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:43:52,073 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:43:52,073 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:43:52,073 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:43:52,073 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:43:52,073 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:43:52,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:43:52,074 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:43:52,074 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 01:43:52,081 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:43:52,081 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:43:52,082 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:43:52,082 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:43:52,083 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:43:52,083 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:43:52,083 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 01:43:52,083 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:43:52,083 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:43:52,083 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:43:52,083 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:43:52,083 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:43:52,083 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 01:43:52,084 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:43:52,084 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 01:43:52,084 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:43:52,084 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:43:52,084 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:43:52,084 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 01:43:52,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:43:52,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:43:52,085 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:43:52,085 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:43:52,085 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:43:52,085 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:43:52,085 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:43:52,085 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 01:43:52,085 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 01:43:52,085 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:43:52,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 01:43:52,086 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_b3923773-46d8-473b-8687-651d323fbcd0/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 -> 9722a10940ebd7a5d75170225a40cd37454d0528 [2018-12-09 01:43:52,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:43:52,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:43:52,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:43:52,112 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:43:52,112 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:43:52,113 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-12-09 01:43:52,149 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/data/6ca17ee3a/16b370e6524a4d01aa47f10b317c6b76/FLAG4f85d808c [2018-12-09 01:43:52,599 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:43:52,599 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-12-09 01:43:52,603 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/data/6ca17ee3a/16b370e6524a4d01aa47f10b317c6b76/FLAG4f85d808c [2018-12-09 01:43:52,611 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/data/6ca17ee3a/16b370e6524a4d01aa47f10b317c6b76 [2018-12-09 01:43:52,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:43:52,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:43:52,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:43:52,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:43:52,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:43:52,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:43:52" (1/1) ... [2018-12-09 01:43:52,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d10e54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:52, skipping insertion in model container [2018-12-09 01:43:52,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:43:52" (1/1) ... [2018-12-09 01:43:52,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:43:52,630 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:43:52,718 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:43:52,720 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:43:52,732 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:43:52,743 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:43:52,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:52 WrapperNode [2018-12-09 01:43:52,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:43:52,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:43:52,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:43:52,744 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:43:52,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:52" (1/1) ... [2018-12-09 01:43:52,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:52" (1/1) ... [2018-12-09 01:43:52,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:43:52,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:43:52,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:43:52,757 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:43:52,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:52" (1/1) ... [2018-12-09 01:43:52,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:52" (1/1) ... [2018-12-09 01:43:52,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:52" (1/1) ... [2018-12-09 01:43:52,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:52" (1/1) ... [2018-12-09 01:43:52,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:52" (1/1) ... [2018-12-09 01:43:52,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:52" (1/1) ... [2018-12-09 01:43:52,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:52" (1/1) ... [2018-12-09 01:43:52,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:43:52,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:43:52,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:43:52,801 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:43:52,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/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 01:43:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:43:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:43:52,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:43:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:43:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:43:52,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:43:52,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 01:43:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:43:52,834 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:43:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 01:43:52,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 01:43:52,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:43:52,948 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:43:52,948 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-09 01:43:52,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:43:52 BoogieIcfgContainer [2018-12-09 01:43:52,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:43:52,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:43:52,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:43:52,951 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:43:52,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:43:52" (1/3) ... [2018-12-09 01:43:52,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2605b3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:43:52, skipping insertion in model container [2018-12-09 01:43:52,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:43:52" (2/3) ... [2018-12-09 01:43:52,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2605b3c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:43:52, skipping insertion in model container [2018-12-09 01:43:52,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:43:52" (3/3) ... [2018-12-09 01:43:52,954 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-12-09 01:43:52,960 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:43:52,964 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 01:43:52,974 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 01:43:52,991 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:43:52,991 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:43:52,991 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 01:43:52,991 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:43:52,991 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:43:52,991 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:43:52,992 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:43:52,992 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:43:52,992 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:43:53,002 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-12-09 01:43:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 01:43:53,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:53,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:43:53,008 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:53,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:53,013 INFO L82 PathProgramCache]: Analyzing trace with hash 342854797, now seen corresponding path program 1 times [2018-12-09 01:43:53,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:43:53,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:43:53,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:53,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:53,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:53,166 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 01:43:53,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:43:53,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:43:53,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:43:53,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:43:53,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:43:53,179 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2018-12-09 01:43:53,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:53,236 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2018-12-09 01:43:53,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:43:53,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-09 01:43:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:53,242 INFO L225 Difference]: With dead ends: 67 [2018-12-09 01:43:53,242 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 01:43:53,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:43:53,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 01:43:53,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2018-12-09 01:43:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-09 01:43:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-12-09 01:43:53,266 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-12-09 01:43:53,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:53,266 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-09 01:43:53,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:43:53,266 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-09 01:43:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 01:43:53,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:53,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:43:53,267 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:53,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:53,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1336061280, now seen corresponding path program 1 times [2018-12-09 01:43:53,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:43:53,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:43:53,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:53,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:53,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:53,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:53,512 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/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 01:43:53,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:53,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:53,642 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 28 treesize of output 23 [2018-12-09 01:43:53,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:53,646 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 23 treesize of output 37 [2018-12-09 01:43:53,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:53,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:53,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:43:53,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-09 01:43:53,683 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 26 treesize of output 18 [2018-12-09 01:43:53,686 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 01:43:53,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:53,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:53,689 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 01:43:53,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-09 01:43:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:53,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:43:53,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-12-09 01:43:53,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 01:43:53,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 01:43:53,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-12-09 01:43:53,719 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 17 states. [2018-12-09 01:43:54,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:54,092 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2018-12-09 01:43:54,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 01:43:54,092 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-12-09 01:43:54,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:54,094 INFO L225 Difference]: With dead ends: 86 [2018-12-09 01:43:54,094 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 01:43:54,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-12-09 01:43:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 01:43:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2018-12-09 01:43:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 01:43:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-12-09 01:43:54,102 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 19 [2018-12-09 01:43:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:54,103 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-12-09 01:43:54,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 01:43:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-12-09 01:43:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 01:43:54,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:54,103 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] [2018-12-09 01:43:54,104 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:54,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:54,104 INFO L82 PathProgramCache]: Analyzing trace with hash -455852680, now seen corresponding path program 1 times [2018-12-09 01:43:54,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:43:54,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:43:54,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:54,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:54,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:54,423 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 01:43:54,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:54,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/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 01:43:54,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:54,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:54,531 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 38 treesize of output 31 [2018-12-09 01:43:54,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:54,534 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 31 treesize of output 47 [2018-12-09 01:43:54,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:54,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:54,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:54,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-12-09 01:43:54,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:54,673 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 50 treesize of output 52 [2018-12-09 01:43:54,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:54,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:54,678 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:43:54,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 52 treesize of output 72 [2018-12-09 01:43:54,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:54,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:54,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:43:54,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-12-09 01:43:54,748 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 39 treesize of output 31 [2018-12-09 01:43:54,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:54,751 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:43:54,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:54,752 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:43:54,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:54,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-12-09 01:43:54,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:54,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:54,761 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 01:43:54,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-12-09 01:43:54,772 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 01:43:54,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:43:54,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2018-12-09 01:43:54,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-09 01:43:54,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 01:43:54,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2018-12-09 01:43:54,786 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 28 states. [2018-12-09 01:43:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:55,343 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2018-12-09 01:43:55,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 01:43:55,343 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 24 [2018-12-09 01:43:55,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:55,345 INFO L225 Difference]: With dead ends: 130 [2018-12-09 01:43:55,346 INFO L226 Difference]: Without dead ends: 95 [2018-12-09 01:43:55,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=260, Invalid=1546, Unknown=0, NotChecked=0, Total=1806 [2018-12-09 01:43:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-09 01:43:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 58. [2018-12-09 01:43:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-09 01:43:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2018-12-09 01:43:55,352 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 24 [2018-12-09 01:43:55,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:55,353 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2018-12-09 01:43:55,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-09 01:43:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-12-09 01:43:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 01:43:55,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:55,353 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:43:55,354 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:55,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:55,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2042668019, now seen corresponding path program 2 times [2018-12-09 01:43:55,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:43:55,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:43:55,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:55,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:55,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:55,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:55,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/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 01:43:55,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:43:55,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:43:55,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:43:55,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:55,619 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 28 treesize of output 23 [2018-12-09 01:43:55,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:55,622 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 23 treesize of output 37 [2018-12-09 01:43:55,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:55,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:55,632 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 01:43:55,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-09 01:43:55,683 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 32 treesize of output 25 [2018-12-09 01:43:55,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:55,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:55,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:55,689 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 25 treesize of output 58 [2018-12-09 01:43:55,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:55,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:55,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:43:55,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2018-12-09 01:43:55,723 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 26 treesize of output 18 [2018-12-09 01:43:55,726 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 01:43:55,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:55,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:55,728 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 01:43:55,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-09 01:43:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:55,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:43:55,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 18 [2018-12-09 01:43:55,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 01:43:55,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 01:43:55,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-12-09 01:43:55,752 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 18 states. [2018-12-09 01:43:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:56,212 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions. [2018-12-09 01:43:56,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 01:43:56,212 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-12-09 01:43:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:56,213 INFO L225 Difference]: With dead ends: 147 [2018-12-09 01:43:56,213 INFO L226 Difference]: Without dead ends: 128 [2018-12-09 01:43:56,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 01:43:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-09 01:43:56,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 68. [2018-12-09 01:43:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 01:43:56,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2018-12-09 01:43:56,224 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 25 [2018-12-09 01:43:56,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:56,224 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2018-12-09 01:43:56,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 01:43:56,225 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-12-09 01:43:56,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 01:43:56,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:56,225 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:43:56,226 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:56,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:56,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2145817879, now seen corresponding path program 1 times [2018-12-09 01:43:56,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:43:56,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:43:56,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:56,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:43:56,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:56,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:56,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/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 01:43:56,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:56,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:56,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:43:56,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-12-09 01:43:56,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:43:56,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:43:56,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:43:56,388 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand 9 states. [2018-12-09 01:43:56,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:56,459 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2018-12-09 01:43:56,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:43:56,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-12-09 01:43:56,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:56,460 INFO L225 Difference]: With dead ends: 119 [2018-12-09 01:43:56,460 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 01:43:56,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:43:56,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 01:43:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2018-12-09 01:43:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 01:43:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2018-12-09 01:43:56,467 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 27 [2018-12-09 01:43:56,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:56,467 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2018-12-09 01:43:56,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:43:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2018-12-09 01:43:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 01:43:56,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:56,468 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:43:56,468 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:56,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:56,469 INFO L82 PathProgramCache]: Analyzing trace with hash 504300867, now seen corresponding path program 1 times [2018-12-09 01:43:56,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:43:56,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:43:56,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:56,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:56,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:56,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:56,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/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 01:43:56,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:56,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:56,699 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 21 treesize of output 16 [2018-12-09 01:43:56,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:56,702 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 01:43:56,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:56,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:56,710 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 01:43:56,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-12-09 01:43:56,725 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 26 treesize of output 18 [2018-12-09 01:43:56,727 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 01:43:56,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:56,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:56,730 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 01:43:56,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-09 01:43:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:56,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:43:56,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-12-09 01:43:56,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 01:43:56,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 01:43:56,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-12-09 01:43:56,762 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 17 states. [2018-12-09 01:43:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:57,209 INFO L93 Difference]: Finished difference Result 211 states and 273 transitions. [2018-12-09 01:43:57,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-09 01:43:57,209 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-12-09 01:43:57,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:57,210 INFO L225 Difference]: With dead ends: 211 [2018-12-09 01:43:57,210 INFO L226 Difference]: Without dead ends: 166 [2018-12-09 01:43:57,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=392, Invalid=1330, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 01:43:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-09 01:43:57,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 86. [2018-12-09 01:43:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 01:43:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2018-12-09 01:43:57,217 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 30 [2018-12-09 01:43:57,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:57,217 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2018-12-09 01:43:57,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 01:43:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2018-12-09 01:43:57,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 01:43:57,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:57,218 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:43:57,218 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:57,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:57,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1205365445, now seen corresponding path program 2 times [2018-12-09 01:43:57,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:43:57,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:43:57,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:57,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:43:57,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:57,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:57,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/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 01:43:57,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:43:57,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:43:57,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:43:57,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:57,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:43:57,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-09 01:43:57,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:43:57,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:43:57,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:43:57,292 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand 7 states. [2018-12-09 01:43:57,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:57,368 INFO L93 Difference]: Finished difference Result 165 states and 212 transitions. [2018-12-09 01:43:57,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 01:43:57,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-12-09 01:43:57,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:57,369 INFO L225 Difference]: With dead ends: 165 [2018-12-09 01:43:57,369 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 01:43:57,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:43:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 01:43:57,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 76. [2018-12-09 01:43:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 01:43:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2018-12-09 01:43:57,375 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 30 [2018-12-09 01:43:57,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:57,375 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2018-12-09 01:43:57,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:43:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2018-12-09 01:43:57,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 01:43:57,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:57,376 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:43:57,376 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:57,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:57,377 INFO L82 PathProgramCache]: Analyzing trace with hash 488358411, now seen corresponding path program 3 times [2018-12-09 01:43:57,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:43:57,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:43:57,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:57,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:43:57,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:57,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:57,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:43:57,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 01:43:57,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 01:43:57,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:43:57,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:57,703 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 38 treesize of output 31 [2018-12-09 01:43:57,705 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:43:57,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:57,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 71 [2018-12-09 01:43:57,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:57,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:57,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:57,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-12-09 01:43:57,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:57,761 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 51 treesize of output 53 [2018-12-09 01:43:57,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:57,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:57,764 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:43:57,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 53 treesize of output 72 [2018-12-09 01:43:57,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:57,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:57,782 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 01:43:57,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-12-09 01:43:57,876 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 34 treesize of output 27 [2018-12-09 01:43:57,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:57,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:57,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:57,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:57,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-12-09 01:43:57,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:57,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:57,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:43:57,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:36 [2018-12-09 01:43:57,922 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 28 treesize of output 20 [2018-12-09 01:43:57,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:57,925 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 01:43:57,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:57,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:57,927 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 01:43:57,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-12-09 01:43:57,953 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:57,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:43:57,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 24 [2018-12-09 01:43:57,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 01:43:57,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 01:43:57,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2018-12-09 01:43:57,968 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand 24 states. [2018-12-09 01:43:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:43:59,248 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2018-12-09 01:43:59,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 01:43:59,249 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-12-09 01:43:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:43:59,249 INFO L225 Difference]: With dead ends: 135 [2018-12-09 01:43:59,249 INFO L226 Difference]: Without dead ends: 133 [2018-12-09 01:43:59,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=248, Invalid=1392, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 01:43:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-09 01:43:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 70. [2018-12-09 01:43:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 01:43:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2018-12-09 01:43:59,255 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 30 [2018-12-09 01:43:59,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:43:59,256 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2018-12-09 01:43:59,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 01:43:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2018-12-09 01:43:59,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 01:43:59,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:43:59,256 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:43:59,256 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:43:59,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:43:59,256 INFO L82 PathProgramCache]: Analyzing trace with hash 586827946, now seen corresponding path program 2 times [2018-12-09 01:43:59,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:43:59,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:43:59,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:59,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:43:59,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:43:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:43:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:59,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:43:59,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:43:59,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:43:59,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:43:59,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:43:59,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:43:59,529 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 23 treesize of output 18 [2018-12-09 01:43:59,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:43:59,531 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 27 [2018-12-09 01:43:59,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:59,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:59,537 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 01:43:59,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-12-09 01:43:59,654 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 26 treesize of output 18 [2018-12-09 01:43:59,656 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 01:43:59,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:43:59,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:43:59,658 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 01:43:59,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-09 01:43:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:43:59,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:43:59,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-12-09 01:43:59,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-09 01:43:59,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-09 01:43:59,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2018-12-09 01:43:59,705 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 29 states. [2018-12-09 01:44:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:20,273 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2018-12-09 01:44:20,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 01:44:20,273 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2018-12-09 01:44:20,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:20,274 INFO L225 Difference]: With dead ends: 131 [2018-12-09 01:44:20,274 INFO L226 Difference]: Without dead ends: 129 [2018-12-09 01:44:20,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=1898, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 01:44:20,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-09 01:44:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 82. [2018-12-09 01:44:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 01:44:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2018-12-09 01:44:20,284 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 33 [2018-12-09 01:44:20,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:20,284 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-12-09 01:44:20,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-09 01:44:20,285 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2018-12-09 01:44:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 01:44:20,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:20,285 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:20,286 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:20,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:20,286 INFO L82 PathProgramCache]: Analyzing trace with hash 853695349, now seen corresponding path program 4 times [2018-12-09 01:44:20,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:20,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:20,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:20,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:44:20,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:20,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:20,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:44:20,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 01:44:20,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 01:44:20,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:44:20,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:20,601 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 38 treesize of output 31 [2018-12-09 01:44:20,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:20,603 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 31 treesize of output 47 [2018-12-09 01:44:20,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:20,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:20,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:20,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-12-09 01:44:21,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:21,103 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 50 treesize of output 52 [2018-12-09 01:44:21,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:21,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:21,108 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:44:21,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 52 treesize of output 73 [2018-12-09 01:44:21,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:21,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:21,124 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 01:44:21,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:35 [2018-12-09 01:44:21,176 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 40 treesize of output 32 [2018-12-09 01:44:21,178 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:44:21,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:21,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:21,180 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:44:21,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:21,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 63 [2018-12-09 01:44:21,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:21,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:21,192 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 01:44:21,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2018-12-09 01:44:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 01:44:21,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:44:21,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 28 [2018-12-09 01:44:21,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-09 01:44:21,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 01:44:21,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=654, Unknown=1, NotChecked=0, Total=756 [2018-12-09 01:44:21,228 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand 28 states. [2018-12-09 01:44:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:22,516 INFO L93 Difference]: Finished difference Result 168 states and 202 transitions. [2018-12-09 01:44:22,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 01:44:22,516 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-12-09 01:44:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:22,517 INFO L225 Difference]: With dead ends: 168 [2018-12-09 01:44:22,517 INFO L226 Difference]: Without dead ends: 126 [2018-12-09 01:44:22,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=424, Invalid=2545, Unknown=1, NotChecked=0, Total=2970 [2018-12-09 01:44:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-09 01:44:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 85. [2018-12-09 01:44:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-09 01:44:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2018-12-09 01:44:22,525 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 35 [2018-12-09 01:44:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:22,525 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2018-12-09 01:44:22,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-09 01:44:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2018-12-09 01:44:22,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 01:44:22,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:22,526 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:22,526 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:22,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:22,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1400428558, now seen corresponding path program 1 times [2018-12-09 01:44:22,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:22,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:22,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:22,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:44:22,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:22,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:22,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:44:22,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:22,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:22,918 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 28 treesize of output 23 [2018-12-09 01:44:22,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:22,921 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 23 treesize of output 37 [2018-12-09 01:44:22,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:22,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:22,929 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 01:44:22,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-09 01:44:22,974 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 32 treesize of output 25 [2018-12-09 01:44:22,983 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-09 01:44:22,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:22,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:22,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:22,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:22,988 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 26 treesize of output 43 [2018-12-09 01:44:22,988 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:22,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:22,996 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 01:44:22,996 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2018-12-09 01:44:23,035 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 32 treesize of output 25 [2018-12-09 01:44:23,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:23,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:23,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:23,043 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 25 treesize of output 58 [2018-12-09 01:44:23,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:23,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:23,053 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 01:44:23,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-12-09 01:44:23,063 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 26 treesize of output 18 [2018-12-09 01:44:23,065 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 01:44:23,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:23,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:23,067 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 01:44:23,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-09 01:44:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 01:44:23,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:44:23,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2018-12-09 01:44:23,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 01:44:23,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 01:44:23,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-12-09 01:44:23,093 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 21 states. [2018-12-09 01:44:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:23,678 INFO L93 Difference]: Finished difference Result 242 states and 289 transitions. [2018-12-09 01:44:23,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-09 01:44:23,678 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-12-09 01:44:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:23,679 INFO L225 Difference]: With dead ends: 242 [2018-12-09 01:44:23,679 INFO L226 Difference]: Without dead ends: 197 [2018-12-09 01:44:23,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 14 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=1135, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 01:44:23,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-09 01:44:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 121. [2018-12-09 01:44:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-09 01:44:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2018-12-09 01:44:23,690 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 36 [2018-12-09 01:44:23,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:23,691 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2018-12-09 01:44:23,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 01:44:23,691 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2018-12-09 01:44:23,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 01:44:23,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:23,691 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:23,692 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:23,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:23,692 INFO L82 PathProgramCache]: Analyzing trace with hash -311016042, now seen corresponding path program 2 times [2018-12-09 01:44:23,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:23,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:23,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:23,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:23,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:23,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:23,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:44:23,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:44:23,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:44:23,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:44:23,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:24,036 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 28 treesize of output 23 [2018-12-09 01:44:24,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:24,039 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 23 treesize of output 37 [2018-12-09 01:44:24,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:24,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:24,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:44:24,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-12-09 01:44:24,107 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 32 treesize of output 25 [2018-12-09 01:44:24,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:24,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:24,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:24,113 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 25 treesize of output 58 [2018-12-09 01:44:24,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:24,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:24,123 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 01:44:24,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:19 [2018-12-09 01:44:24,132 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 26 treesize of output 18 [2018-12-09 01:44:24,134 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 01:44:24,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:24,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:24,136 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 01:44:24,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-09 01:44:24,146 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:24,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:44:24,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-12-09 01:44:24,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-09 01:44:24,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 01:44:24,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2018-12-09 01:44:24,161 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand 25 states. [2018-12-09 01:44:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:24,863 INFO L93 Difference]: Finished difference Result 246 states and 295 transitions. [2018-12-09 01:44:24,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-09 01:44:24,863 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 36 [2018-12-09 01:44:24,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:24,864 INFO L225 Difference]: With dead ends: 246 [2018-12-09 01:44:24,864 INFO L226 Difference]: Without dead ends: 201 [2018-12-09 01:44:24,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 01:44:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-09 01:44:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 133. [2018-12-09 01:44:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-09 01:44:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 161 transitions. [2018-12-09 01:44:24,877 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 161 transitions. Word has length 36 [2018-12-09 01:44:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:24,877 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 161 transitions. [2018-12-09 01:44:24,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-09 01:44:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 161 transitions. [2018-12-09 01:44:24,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 01:44:24,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:24,877 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:24,877 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:24,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:24,878 INFO L82 PathProgramCache]: Analyzing trace with hash -591767046, now seen corresponding path program 1 times [2018-12-09 01:44:24,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:24,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:24,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:24,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:44:24,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:25,103 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:25,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:25,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:44:25,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:25,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:25,206 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 38 treesize of output 31 [2018-12-09 01:44:25,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:25,208 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 31 treesize of output 47 [2018-12-09 01:44:25,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:25,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:25,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:25,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-12-09 01:44:25,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:25,310 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 43 treesize of output 45 [2018-12-09 01:44:25,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:25,312 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:44:25,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 49 [2018-12-09 01:44:25,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:25,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:25,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:44:25,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2018-12-09 01:44:25,570 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 32 treesize of output 24 [2018-12-09 01:44:25,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:25,575 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:44:25,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:25,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-12-09 01:44:25,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:25,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:25,593 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 01:44:25,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-12-09 01:44:25,637 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:25,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:44:25,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-12-09 01:44:25,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-09 01:44:25,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-09 01:44:25,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 01:44:25,652 INFO L87 Difference]: Start difference. First operand 133 states and 161 transitions. Second operand 36 states. [2018-12-09 01:44:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:26,323 INFO L93 Difference]: Finished difference Result 192 states and 227 transitions. [2018-12-09 01:44:26,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 01:44:26,323 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 38 [2018-12-09 01:44:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:26,324 INFO L225 Difference]: With dead ends: 192 [2018-12-09 01:44:26,324 INFO L226 Difference]: Without dead ends: 190 [2018-12-09 01:44:26,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=258, Invalid=2394, Unknown=0, NotChecked=0, Total=2652 [2018-12-09 01:44:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-09 01:44:26,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 140. [2018-12-09 01:44:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-09 01:44:26,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 170 transitions. [2018-12-09 01:44:26,338 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 170 transitions. Word has length 38 [2018-12-09 01:44:26,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:26,338 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 170 transitions. [2018-12-09 01:44:26,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-09 01:44:26,338 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 170 transitions. [2018-12-09 01:44:26,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 01:44:26,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:26,339 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:26,339 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:26,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:26,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1198506493, now seen corresponding path program 3 times [2018-12-09 01:44:26,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:26,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:26,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:26,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:26,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:26,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:26,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:44:26,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 01:44:26,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 01:44:26,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:44:26,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:26,690 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 28 treesize of output 23 [2018-12-09 01:44:26,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:26,693 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 23 treesize of output 37 [2018-12-09 01:44:26,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:26,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:26,703 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 01:44:26,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-12-09 01:44:26,752 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 32 treesize of output 25 [2018-12-09 01:44:26,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:26,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:26,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:26,757 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 25 treesize of output 58 [2018-12-09 01:44:26,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:26,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:26,767 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 01:44:26,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-12-09 01:44:26,892 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 26 treesize of output 18 [2018-12-09 01:44:26,894 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 01:44:26,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:26,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:26,896 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 01:44:26,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-09 01:44:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:26,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:44:26,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2018-12-09 01:44:26,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-09 01:44:26,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-09 01:44:26,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 01:44:26,944 INFO L87 Difference]: Start difference. First operand 140 states and 170 transitions. Second operand 33 states. [2018-12-09 01:44:39,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:39,718 INFO L93 Difference]: Finished difference Result 266 states and 316 transitions. [2018-12-09 01:44:39,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 01:44:39,718 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2018-12-09 01:44:39,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:39,719 INFO L225 Difference]: With dead ends: 266 [2018-12-09 01:44:39,719 INFO L226 Difference]: Without dead ends: 209 [2018-12-09 01:44:39,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=2406, Unknown=0, NotChecked=0, Total=2756 [2018-12-09 01:44:39,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-09 01:44:39,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 139. [2018-12-09 01:44:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-09 01:44:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2018-12-09 01:44:39,740 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 39 [2018-12-09 01:44:39,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:39,740 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2018-12-09 01:44:39,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-09 01:44:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2018-12-09 01:44:39,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 01:44:39,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:39,741 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:39,741 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:39,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:39,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1463502433, now seen corresponding path program 4 times [2018-12-09 01:44:39,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:39,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:39,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:39,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:44:39,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:44:39,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:39,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:44:39,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 01:44:39,824 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 01:44:39,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:44:39,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:44:39,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:44:39,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-12-09 01:44:39,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 01:44:39,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 01:44:39,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:44:39,885 INFO L87 Difference]: Start difference. First operand 139 states and 168 transitions. Second operand 12 states. [2018-12-09 01:44:39,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:39,988 INFO L93 Difference]: Finished difference Result 221 states and 266 transitions. [2018-12-09 01:44:39,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:44:39,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-12-09 01:44:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:39,988 INFO L225 Difference]: With dead ends: 221 [2018-12-09 01:44:39,988 INFO L226 Difference]: Without dead ends: 201 [2018-12-09 01:44:39,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-12-09 01:44:39,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-09 01:44:40,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 157. [2018-12-09 01:44:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-09 01:44:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 186 transitions. [2018-12-09 01:44:40,006 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 186 transitions. Word has length 41 [2018-12-09 01:44:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:40,007 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 186 transitions. [2018-12-09 01:44:40,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 01:44:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2018-12-09 01:44:40,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 01:44:40,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:40,008 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:40,008 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:40,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:40,009 INFO L82 PathProgramCache]: Analyzing trace with hash -2065125816, now seen corresponding path program 5 times [2018-12-09 01:44:40,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:40,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:40,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:40,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:44:40,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:40,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:40,372 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:44:40,379 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 01:44:40,406 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-09 01:44:40,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:44:40,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:40,532 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 38 treesize of output 31 [2018-12-09 01:44:40,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:40,535 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 31 treesize of output 47 [2018-12-09 01:44:40,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:40,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:40,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:40,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-12-09 01:44:40,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:40,606 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 52 treesize of output 54 [2018-12-09 01:44:40,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:40,608 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-09 01:44:40,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:40,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:40,617 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 01:44:40,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:33 [2018-12-09 01:44:40,674 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 34 treesize of output 27 [2018-12-09 01:44:40,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:40,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:40,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:40,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:40,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-12-09 01:44:40,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:40,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:40,688 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 01:44:40,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-12-09 01:44:40,699 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 28 treesize of output 20 [2018-12-09 01:44:40,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:40,700 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 01:44:40,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:40,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:40,702 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 01:44:40,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-12-09 01:44:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:44:40,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:44:40,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2018-12-09 01:44:40,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-09 01:44:40,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-09 01:44:40,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2018-12-09 01:44:40,732 INFO L87 Difference]: Start difference. First operand 157 states and 186 transitions. Second operand 30 states. [2018-12-09 01:44:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:42,917 INFO L93 Difference]: Finished difference Result 305 states and 364 transitions. [2018-12-09 01:44:42,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-09 01:44:42,917 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2018-12-09 01:44:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:42,918 INFO L225 Difference]: With dead ends: 305 [2018-12-09 01:44:42,918 INFO L226 Difference]: Without dead ends: 248 [2018-12-09 01:44:42,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=477, Invalid=2715, Unknown=0, NotChecked=0, Total=3192 [2018-12-09 01:44:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-12-09 01:44:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 168. [2018-12-09 01:44:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-09 01:44:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 198 transitions. [2018-12-09 01:44:42,941 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 198 transitions. Word has length 41 [2018-12-09 01:44:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:42,941 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 198 transitions. [2018-12-09 01:44:42,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-09 01:44:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 198 transitions. [2018-12-09 01:44:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-09 01:44:42,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:42,941 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:42,942 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:42,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash 591821558, now seen corresponding path program 1 times [2018-12-09 01:44:42,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:42,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:42,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:42,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:44:42,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:43,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:43,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:44:43,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:43,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-12-09 01:44:43,480 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:44:43,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:43,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 71 [2018-12-09 01:44:43,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:43,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:43,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:43,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-12-09 01:44:43,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:43,600 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 51 treesize of output 53 [2018-12-09 01:44:43,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:43,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:43,603 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:44:43,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 53 treesize of output 72 [2018-12-09 01:44:43,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:43,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:43,618 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 01:44:43,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-12-09 01:44:43,668 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 34 treesize of output 27 [2018-12-09 01:44:43,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:43,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:43,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:43,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:43,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-12-09 01:44:43,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:43,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:43,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:44:43,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:36 [2018-12-09 01:44:43,730 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 34 treesize of output 27 [2018-12-09 01:44:43,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:43,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:43,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:43,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:43,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-12-09 01:44:43,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:43,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:43,745 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 01:44:43,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-12-09 01:44:43,756 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 28 treesize of output 20 [2018-12-09 01:44:43,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:43,758 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 01:44:43,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:43,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:43,760 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 01:44:43,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-12-09 01:44:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 01:44:43,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:44:43,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 31 [2018-12-09 01:44:43,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-09 01:44:43,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-09 01:44:43,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2018-12-09 01:44:43,804 INFO L87 Difference]: Start difference. First operand 168 states and 198 transitions. Second operand 31 states. [2018-12-09 01:44:45,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:45,084 INFO L93 Difference]: Finished difference Result 306 states and 365 transitions. [2018-12-09 01:44:45,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 01:44:45,085 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 41 [2018-12-09 01:44:45,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:45,086 INFO L225 Difference]: With dead ends: 306 [2018-12-09 01:44:45,086 INFO L226 Difference]: Without dead ends: 238 [2018-12-09 01:44:45,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=280, Invalid=1882, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 01:44:45,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-12-09 01:44:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 174. [2018-12-09 01:44:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-09 01:44:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 206 transitions. [2018-12-09 01:44:45,128 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 206 transitions. Word has length 41 [2018-12-09 01:44:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:45,128 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 206 transitions. [2018-12-09 01:44:45,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-09 01:44:45,128 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 206 transitions. [2018-12-09 01:44:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 01:44:45,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:45,128 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:45,128 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:45,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:45,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2135659553, now seen corresponding path program 2 times [2018-12-09 01:44:45,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:45,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:45,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:45,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:45,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:45,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:45,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:44:45,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:44:45,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:44:45,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:44:45,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:45,596 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 28 treesize of output 23 [2018-12-09 01:44:45,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:45,599 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 23 treesize of output 37 [2018-12-09 01:44:45,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:45,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:45,607 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 01:44:45,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-09 01:44:45,644 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 39 treesize of output 32 [2018-12-09 01:44:45,654 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-09 01:44:45,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:45,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:45,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:45,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:45,659 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 33 treesize of output 66 [2018-12-09 01:44:45,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:45,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:45,669 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 01:44:45,669 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:25 [2018-12-09 01:44:45,719 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 32 treesize of output 25 [2018-12-09 01:44:45,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:45,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:45,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:45,724 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 25 treesize of output 58 [2018-12-09 01:44:45,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:45,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:45,735 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 01:44:45,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:29 [2018-12-09 01:44:45,763 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 32 treesize of output 25 [2018-12-09 01:44:45,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:45,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:45,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:45,769 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 25 treesize of output 58 [2018-12-09 01:44:45,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:45,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:45,778 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 01:44:45,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:19 [2018-12-09 01:44:45,789 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 26 treesize of output 18 [2018-12-09 01:44:45,790 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 01:44:45,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:45,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:45,792 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 01:44:45,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-09 01:44:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:45,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:44:45,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 25 [2018-12-09 01:44:45,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-09 01:44:45,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 01:44:45,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2018-12-09 01:44:45,822 INFO L87 Difference]: Start difference. First operand 174 states and 206 transitions. Second operand 25 states. [2018-12-09 01:44:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:44:46,738 INFO L93 Difference]: Finished difference Result 371 states and 447 transitions. [2018-12-09 01:44:46,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-09 01:44:46,738 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2018-12-09 01:44:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:44:46,739 INFO L225 Difference]: With dead ends: 371 [2018-12-09 01:44:46,739 INFO L226 Difference]: Without dead ends: 303 [2018-12-09 01:44:46,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 15 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=347, Invalid=2005, Unknown=0, NotChecked=0, Total=2352 [2018-12-09 01:44:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-09 01:44:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 171. [2018-12-09 01:44:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-09 01:44:46,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2018-12-09 01:44:46,765 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 42 [2018-12-09 01:44:46,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:44:46,765 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2018-12-09 01:44:46,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-09 01:44:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2018-12-09 01:44:46,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 01:44:46,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:44:46,765 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:44:46,765 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:44:46,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:44:46,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1630887468, now seen corresponding path program 1 times [2018-12-09 01:44:46,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:44:46,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:44:46,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:46,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:44:46,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:44:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:47,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:44:47,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:44:47,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:44:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:44:47,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:44:47,460 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 28 treesize of output 23 [2018-12-09 01:44:47,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:47,463 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 23 treesize of output 37 [2018-12-09 01:44:47,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:47,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:47,471 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 01:44:47,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-09 01:44:47,503 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 40 treesize of output 31 [2018-12-09 01:44:47,505 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:44:47,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:47,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:47,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:47,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 77 [2018-12-09 01:44:47,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:47,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:47,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:47,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-12-09 01:44:47,668 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 60 treesize of output 47 [2018-12-09 01:44:47,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:47,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:47,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:47,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:47,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:47,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:47,673 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:44:47,674 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:44:47,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 47 treesize of output 131 [2018-12-09 01:44:47,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:47,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:47,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:44:47,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:54 [2018-12-09 01:44:47,887 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 56 treesize of output 45 [2018-12-09 01:44:47,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:47,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:47,890 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:44:47,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:44:47,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 85 [2018-12-09 01:44:47,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:47,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:47,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:44:47,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:78, output treesize:30 [2018-12-09 01:44:48,133 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 26 treesize of output 18 [2018-12-09 01:44:48,139 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 01:44:48,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:44:48,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:44:48,145 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 01:44:48,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-09 01:44:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:44:48,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:44:48,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 43 [2018-12-09 01:44:48,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-09 01:44:48,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-09 01:44:48,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1633, Unknown=0, NotChecked=0, Total=1806 [2018-12-09 01:44:48,343 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand 43 states. [2018-12-09 01:45:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:06,499 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2018-12-09 01:45:06,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-09 01:45:06,500 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-09 01:45:06,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:06,501 INFO L225 Difference]: With dead ends: 217 [2018-12-09 01:45:06,501 INFO L226 Difference]: Without dead ends: 200 [2018-12-09 01:45:06,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=549, Invalid=4707, Unknown=0, NotChecked=0, Total=5256 [2018-12-09 01:45:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-09 01:45:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 181. [2018-12-09 01:45:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-09 01:45:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 212 transitions. [2018-12-09 01:45:06,537 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 212 transitions. Word has length 43 [2018-12-09 01:45:06,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:06,537 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 212 transitions. [2018-12-09 01:45:06,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-09 01:45:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 212 transitions. [2018-12-09 01:45:06,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 01:45:06,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:06,538 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:06,538 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:06,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:06,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1316368837, now seen corresponding path program 1 times [2018-12-09 01:45:06,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:06,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:06,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:06,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:45:06,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:06,679 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:06,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:45:06,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:45:06,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:45:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:06,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:45:06,817 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 28 treesize of output 23 [2018-12-09 01:45:06,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:06,819 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 23 treesize of output 37 [2018-12-09 01:45:06,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:06,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:06,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:45:06,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-09 01:45:07,022 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 32 treesize of output 24 [2018-12-09 01:45:07,024 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:45:07,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:07,025 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:45:07,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 40 [2018-12-09 01:45:07,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:07,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:07,034 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 01:45:07,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-12-09 01:45:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:07,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:45:07,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2018-12-09 01:45:07,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-09 01:45:07,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-09 01:45:07,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2018-12-09 01:45:07,083 INFO L87 Difference]: Start difference. First operand 181 states and 212 transitions. Second operand 32 states. [2018-12-09 01:45:33,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:33,179 INFO L93 Difference]: Finished difference Result 417 states and 495 transitions. [2018-12-09 01:45:33,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-09 01:45:33,179 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2018-12-09 01:45:33,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:33,180 INFO L225 Difference]: With dead ends: 417 [2018-12-09 01:45:33,180 INFO L226 Difference]: Without dead ends: 349 [2018-12-09 01:45:33,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=4409, Unknown=0, NotChecked=0, Total=4970 [2018-12-09 01:45:33,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-09 01:45:33,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 198. [2018-12-09 01:45:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-09 01:45:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 234 transitions. [2018-12-09 01:45:33,208 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 234 transitions. Word has length 44 [2018-12-09 01:45:33,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:33,208 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 234 transitions. [2018-12-09 01:45:33,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-09 01:45:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 234 transitions. [2018-12-09 01:45:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 01:45:33,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:33,208 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:33,209 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:33,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:33,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2095999155, now seen corresponding path program 2 times [2018-12-09 01:45:33,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:33,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:33,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:33,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:45:33,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:33,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:45:33,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:45:33,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:45:33,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:45:33,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:45:33,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:45:33,668 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 38 treesize of output 31 [2018-12-09 01:45:33,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:33,670 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 31 treesize of output 47 [2018-12-09 01:45:33,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:33,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:33,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:33,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-12-09 01:45:33,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:33,795 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 51 treesize of output 53 [2018-12-09 01:45:33,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:33,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:33,798 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:45:33,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 53 treesize of output 72 [2018-12-09 01:45:33,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:33,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:33,812 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 01:45:33,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-12-09 01:45:33,882 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 31 treesize of output 24 [2018-12-09 01:45:33,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:33,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:33,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:33,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:33,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 67 [2018-12-09 01:45:33,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:33,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:33,902 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 01:45:33,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-12-09 01:45:34,056 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 28 treesize of output 20 [2018-12-09 01:45:34,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:34,058 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 01:45:34,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:34,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:34,060 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 01:45:34,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-12-09 01:45:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:34,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:45:34,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2018-12-09 01:45:34,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-09 01:45:34,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-09 01:45:34,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1530, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 01:45:34,113 INFO L87 Difference]: Start difference. First operand 198 states and 234 transitions. Second operand 42 states. [2018-12-09 01:45:35,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:35,885 INFO L93 Difference]: Finished difference Result 337 states and 398 transitions. [2018-12-09 01:45:35,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-09 01:45:35,885 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 44 [2018-12-09 01:45:35,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:35,886 INFO L225 Difference]: With dead ends: 337 [2018-12-09 01:45:35,886 INFO L226 Difference]: Without dead ends: 335 [2018-12-09 01:45:35,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2040 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=737, Invalid=5743, Unknown=0, NotChecked=0, Total=6480 [2018-12-09 01:45:35,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-12-09 01:45:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 235. [2018-12-09 01:45:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-12-09 01:45:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 278 transitions. [2018-12-09 01:45:35,927 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 278 transitions. Word has length 44 [2018-12-09 01:45:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:35,927 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 278 transitions. [2018-12-09 01:45:35,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-09 01:45:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 278 transitions. [2018-12-09 01:45:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 01:45:35,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:35,927 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:35,928 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:35,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:35,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1588085580, now seen corresponding path program 5 times [2018-12-09 01:45:35,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:35,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:35,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:35,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:45:35,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:45:36,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:45:36,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:45:36,133 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 01:45:36,156 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-12-09 01:45:36,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:45:36,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:45:36,237 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 15 treesize of output 12 [2018-12-09 01:45:36,238 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 01:45:36,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:36,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:36,242 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 01:45:36,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-12-09 01:45:36,324 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 46 treesize of output 37 [2018-12-09 01:45:36,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:36,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 37 treesize of output 37 [2018-12-09 01:45:36,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:36,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:36,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:45:36,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:30 [2018-12-09 01:45:36,619 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 32 treesize of output 24 [2018-12-09 01:45:36,621 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:45:36,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:36,622 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:45:36,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-12-09 01:45:36,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:36,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:36,630 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 01:45:36,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-12-09 01:45:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:45:36,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:45:36,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 37 [2018-12-09 01:45:36,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-09 01:45:36,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-09 01:45:36,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1216, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 01:45:36,681 INFO L87 Difference]: Start difference. First operand 235 states and 278 transitions. Second operand 37 states. [2018-12-09 01:45:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:51,424 INFO L93 Difference]: Finished difference Result 356 states and 416 transitions. [2018-12-09 01:45:51,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 01:45:51,425 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 47 [2018-12-09 01:45:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:51,426 INFO L225 Difference]: With dead ends: 356 [2018-12-09 01:45:51,426 INFO L226 Difference]: Without dead ends: 354 [2018-12-09 01:45:51,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=277, Invalid=2585, Unknown=0, NotChecked=0, Total=2862 [2018-12-09 01:45:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-09 01:45:51,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 300. [2018-12-09 01:45:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-09 01:45:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 350 transitions. [2018-12-09 01:45:51,492 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 350 transitions. Word has length 47 [2018-12-09 01:45:51,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:51,492 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 350 transitions. [2018-12-09 01:45:51,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-09 01:45:51,492 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 350 transitions. [2018-12-09 01:45:51,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 01:45:51,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:51,493 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:51,493 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:51,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:51,494 INFO L82 PathProgramCache]: Analyzing trace with hash -681197923, now seen corresponding path program 2 times [2018-12-09 01:45:51,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:51,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:51,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:51,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:45:51,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 01:45:51,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:45:51,519 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:45:51,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:45:51,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:45:51,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:45:51,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:45:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 01:45:51,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:45:51,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-09 01:45:51,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:45:51,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:45:51,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:45:51,560 INFO L87 Difference]: Start difference. First operand 300 states and 350 transitions. Second operand 6 states. [2018-12-09 01:45:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:51,649 INFO L93 Difference]: Finished difference Result 384 states and 449 transitions. [2018-12-09 01:45:51,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:45:51,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-12-09 01:45:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:51,650 INFO L225 Difference]: With dead ends: 384 [2018-12-09 01:45:51,650 INFO L226 Difference]: Without dead ends: 298 [2018-12-09 01:45:51,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:45:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-12-09 01:45:51,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 249. [2018-12-09 01:45:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-09 01:45:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 286 transitions. [2018-12-09 01:45:51,700 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 286 transitions. Word has length 47 [2018-12-09 01:45:51,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:51,700 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 286 transitions. [2018-12-09 01:45:51,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:45:51,701 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 286 transitions. [2018-12-09 01:45:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 01:45:51,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:51,701 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:51,701 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:51,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:51,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1128146500, now seen corresponding path program 2 times [2018-12-09 01:45:51,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:51,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:51,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:51,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:45:51,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:52,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:45:52,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:45:52,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:45:52,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:45:52,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:45:52,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:45:52,543 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 38 treesize of output 31 [2018-12-09 01:45:52,545 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:45:52,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:52,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 31 treesize of output 71 [2018-12-09 01:45:52,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:52,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:52,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:52,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-12-09 01:45:52,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:52,667 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 51 treesize of output 53 [2018-12-09 01:45:52,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:52,670 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2018-12-09 01:45:52,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:52,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:52,686 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 01:45:52,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-12-09 01:45:52,724 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 42 treesize of output 33 [2018-12-09 01:45:52,726 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:45:52,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:52,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:52,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:52,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:52,729 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 33 treesize of output 95 [2018-12-09 01:45:52,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:52,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:52,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:52,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-12-09 01:45:52,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:52,884 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 62 treesize of output 66 [2018-12-09 01:45:52,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:52,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:52,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:52,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:52,889 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:45:52,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:52,890 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:45:52,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 148 [2018-12-09 01:45:52,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:52,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:52,908 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 01:45:52,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:57 [2018-12-09 01:45:53,052 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 59 treesize of output 48 [2018-12-09 01:45:53,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:53,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:53,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:53,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:53,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:53,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:53,068 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 144 [2018-12-09 01:45:53,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:45:53,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:45:53,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 01:45:53,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:102 [2018-12-09 01:45:53,301 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 28 treesize of output 20 [2018-12-09 01:45:53,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:53,304 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 01:45:53,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:53,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:53,307 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 01:45:53,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-12-09 01:45:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:53,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:45:53,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 49 [2018-12-09 01:45:53,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-09 01:45:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-09 01:45:53,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2123, Unknown=0, NotChecked=0, Total=2352 [2018-12-09 01:45:53,391 INFO L87 Difference]: Start difference. First operand 249 states and 286 transitions. Second operand 49 states. [2018-12-09 01:45:54,128 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2018-12-09 01:45:54,634 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 36 [2018-12-09 01:45:55,090 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-12-09 01:45:55,590 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-12-09 01:45:56,329 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2018-12-09 01:45:56,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:45:56,770 INFO L93 Difference]: Finished difference Result 273 states and 310 transitions. [2018-12-09 01:45:56,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-09 01:45:56,772 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-12-09 01:45:56,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:45:56,773 INFO L225 Difference]: With dead ends: 273 [2018-12-09 01:45:56,774 INFO L226 Difference]: Without dead ends: 256 [2018-12-09 01:45:56,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1854 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=470, Invalid=4500, Unknown=0, NotChecked=0, Total=4970 [2018-12-09 01:45:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-12-09 01:45:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 219. [2018-12-09 01:45:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-12-09 01:45:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 252 transitions. [2018-12-09 01:45:56,832 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 252 transitions. Word has length 48 [2018-12-09 01:45:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:45:56,832 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 252 transitions. [2018-12-09 01:45:56,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-09 01:45:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2018-12-09 01:45:56,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 01:45:56,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:45:56,833 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:45:56,833 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:45:56,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:45:56,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1834674623, now seen corresponding path program 1 times [2018-12-09 01:45:56,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:45:56,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:45:56,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:56,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:45:56,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:45:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:57,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:45:57,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:45:57,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:45:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:45:57,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:45:57,143 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 38 treesize of output 31 [2018-12-09 01:45:57,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:57,145 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 31 treesize of output 47 [2018-12-09 01:45:57,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:57,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:57,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:57,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-12-09 01:45:57,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:57,257 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 52 treesize of output 54 [2018-12-09 01:45:57,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:57,259 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-09 01:45:57,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:57,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:57,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:45:57,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:33 [2018-12-09 01:45:57,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-12-09 01:45:57,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:57,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:57,454 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:45:57,454 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:45:57,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:45:57,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-12-09 01:45:57,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:45:57,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:45:57,462 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 01:45:57,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:5 [2018-12-09 01:45:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:45:57,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:45:57,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 38 [2018-12-09 01:45:57,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-09 01:45:57,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-09 01:45:57,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 01:45:57,532 INFO L87 Difference]: Start difference. First operand 219 states and 252 transitions. Second operand 38 states. [2018-12-09 01:46:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:46:01,275 INFO L93 Difference]: Finished difference Result 330 states and 378 transitions. [2018-12-09 01:46:01,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-09 01:46:01,275 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 49 [2018-12-09 01:46:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:46:01,276 INFO L225 Difference]: With dead ends: 330 [2018-12-09 01:46:01,276 INFO L226 Difference]: Without dead ends: 328 [2018-12-09 01:46:01,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3063 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=824, Invalid=9076, Unknown=0, NotChecked=0, Total=9900 [2018-12-09 01:46:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-12-09 01:46:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 217. [2018-12-09 01:46:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-09 01:46:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 251 transitions. [2018-12-09 01:46:01,324 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 251 transitions. Word has length 49 [2018-12-09 01:46:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:46:01,324 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 251 transitions. [2018-12-09 01:46:01,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-09 01:46:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 251 transitions. [2018-12-09 01:46:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 01:46:01,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:46:01,325 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:46:01,325 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:46:01,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:46:01,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1831939583, now seen corresponding path program 3 times [2018-12-09 01:46:01,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:46:01,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:46:01,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:46:01,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:46:01,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:46:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:46:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:46:02,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:46:02,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:46:02,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 01:46:02,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 01:46:02,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:46:02,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:46:02,993 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 28 treesize of output 23 [2018-12-09 01:46:02,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:02,995 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 23 treesize of output 37 [2018-12-09 01:46:02,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:02,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:03,004 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 01:46:03,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-09 01:46:03,039 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 40 treesize of output 31 [2018-12-09 01:46:03,040 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:46:03,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:03,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:03,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:03,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 77 [2018-12-09 01:46:03,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:03,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:03,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:03,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:46 [2018-12-09 01:46:03,341 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 61 treesize of output 48 [2018-12-09 01:46:03,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:03,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:03,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:03,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:03,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:03,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 120 [2018-12-09 01:46:03,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:46:03,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:46:03,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:46:03,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:130 [2018-12-09 01:46:03,902 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-12-09 01:46:04,413 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-12-09 01:46:04,686 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2018-12-09 01:46:04,698 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 53 treesize of output 42 [2018-12-09 01:46:04,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:04,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:04,710 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:46:04,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:04,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 42 treesize of output 84 [2018-12-09 01:46:04,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:04,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:04,784 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 01:46:04,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:30 [2018-12-09 01:46:05,087 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 36 treesize of output 29 [2018-12-09 01:46:05,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:05,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:05,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:05,115 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 70 [2018-12-09 01:46:05,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:05,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:05,169 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 01:46:05,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:23 [2018-12-09 01:46:05,621 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 26 treesize of output 18 [2018-12-09 01:46:05,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 01:46:05,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:05,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:05,628 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 01:46:05,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-09 01:46:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:46:05,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:46:05,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 46 [2018-12-09 01:46:05,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-09 01:46:05,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-09 01:46:05,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1868, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 01:46:05,777 INFO L87 Difference]: Start difference. First operand 217 states and 251 transitions. Second operand 46 states. [2018-12-09 01:46:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:46:23,711 INFO L93 Difference]: Finished difference Result 375 states and 424 transitions. [2018-12-09 01:46:23,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-09 01:46:23,712 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 49 [2018-12-09 01:46:23,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:46:23,712 INFO L225 Difference]: With dead ends: 375 [2018-12-09 01:46:23,713 INFO L226 Difference]: Without dead ends: 373 [2018-12-09 01:46:23,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2083 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=598, Invalid=5564, Unknown=0, NotChecked=0, Total=6162 [2018-12-09 01:46:23,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-12-09 01:46:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 227. [2018-12-09 01:46:23,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-09 01:46:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 262 transitions. [2018-12-09 01:46:23,761 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 262 transitions. Word has length 49 [2018-12-09 01:46:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:46:23,761 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 262 transitions. [2018-12-09 01:46:23,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-09 01:46:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 262 transitions. [2018-12-09 01:46:23,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 01:46:23,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:46:23,761 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:46:23,762 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:46:23,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:46:23,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1264339310, now seen corresponding path program 2 times [2018-12-09 01:46:23,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:46:23,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:46:23,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:46:23,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:46:23,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:46:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:46:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:46:24,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:46:24,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:46:24,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:46:24,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:46:24,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:46:24,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:46:24,287 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 28 treesize of output 23 [2018-12-09 01:46:24,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:24,290 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 23 treesize of output 37 [2018-12-09 01:46:24,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:24,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:24,297 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 01:46:24,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-12-09 01:46:24,359 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 31 treesize of output 24 [2018-12-09 01:46:24,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:24,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:24,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:24,364 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 24 treesize of output 55 [2018-12-09 01:46:24,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:24,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:24,373 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 01:46:24,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2018-12-09 01:46:24,435 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 29 treesize of output 22 [2018-12-09 01:46:24,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:24,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:24,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:24,440 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 22 treesize of output 49 [2018-12-09 01:46:24,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:24,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:24,447 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 01:46:24,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-12-09 01:46:24,605 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 26 treesize of output 18 [2018-12-09 01:46:24,606 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 01:46:24,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:24,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:24,608 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 01:46:24,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-09 01:46:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:46:24,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:46:24,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2018-12-09 01:46:24,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-09 01:46:24,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-09 01:46:24,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1409, Unknown=0, NotChecked=0, Total=1560 [2018-12-09 01:46:24,665 INFO L87 Difference]: Start difference. First operand 227 states and 262 transitions. Second operand 40 states. [2018-12-09 01:46:48,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:46:48,474 INFO L93 Difference]: Finished difference Result 490 states and 571 transitions. [2018-12-09 01:46:48,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-09 01:46:48,474 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 50 [2018-12-09 01:46:48,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:46:48,475 INFO L225 Difference]: With dead ends: 490 [2018-12-09 01:46:48,475 INFO L226 Difference]: Without dead ends: 452 [2018-12-09 01:46:48,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2334 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=876, Invalid=6606, Unknown=0, NotChecked=0, Total=7482 [2018-12-09 01:46:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-12-09 01:46:48,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 278. [2018-12-09 01:46:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-09 01:46:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 323 transitions. [2018-12-09 01:46:48,569 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 323 transitions. Word has length 50 [2018-12-09 01:46:48,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:46:48,570 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 323 transitions. [2018-12-09 01:46:48,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-09 01:46:48,570 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 323 transitions. [2018-12-09 01:46:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 01:46:48,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:46:48,570 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:46:48,570 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:46:48,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:46:48,571 INFO L82 PathProgramCache]: Analyzing trace with hash -891213096, now seen corresponding path program 3 times [2018-12-09 01:46:48,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:46:48,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:46:48,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:46:48,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:46:48,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:46:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:46:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:46:48,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:46:48,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:46:48,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 01:46:48,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 01:46:48,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:46:48,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:46:48,952 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 28 treesize of output 23 [2018-12-09 01:46:48,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:48,954 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 23 treesize of output 37 [2018-12-09 01:46:48,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:48,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:48,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:46:48,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-12-09 01:46:49,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-12-09 01:46:49,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:49,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:49,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:49,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2018-12-09 01:46:49,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:49,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:49,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:46:49,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:30 [2018-12-09 01:46:49,229 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 32 treesize of output 24 [2018-12-09 01:46:49,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:49,231 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:46:49,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:46:49,232 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:46:49,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 38 [2018-12-09 01:46:49,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:46:49,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:46:49,242 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 01:46:49,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-12-09 01:46:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:46:49,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:46:49,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-12-09 01:46:49,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-09 01:46:49,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-09 01:46:49,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 01:46:49,301 INFO L87 Difference]: Start difference. First operand 278 states and 323 transitions. Second operand 36 states. [2018-12-09 01:47:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:47:14,557 INFO L93 Difference]: Finished difference Result 404 states and 470 transitions. [2018-12-09 01:47:14,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-09 01:47:14,557 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 50 [2018-12-09 01:47:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:47:14,558 INFO L225 Difference]: With dead ends: 404 [2018-12-09 01:47:14,558 INFO L226 Difference]: Without dead ends: 402 [2018-12-09 01:47:14,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=518, Invalid=3904, Unknown=0, NotChecked=0, Total=4422 [2018-12-09 01:47:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-09 01:47:14,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 297. [2018-12-09 01:47:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 01:47:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 347 transitions. [2018-12-09 01:47:14,628 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 347 transitions. Word has length 50 [2018-12-09 01:47:14,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:47:14,628 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 347 transitions. [2018-12-09 01:47:14,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-09 01:47:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 347 transitions. [2018-12-09 01:47:14,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 01:47:14,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:47:14,629 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:47:14,629 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:47:14,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:47:14,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1007295364, now seen corresponding path program 4 times [2018-12-09 01:47:14,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:47:14,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:47:14,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:47:14,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:47:14,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:47:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:47:14,780 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:47:14,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:47:14,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:47:14,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 01:47:14,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 01:47:14,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:47:14,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:47:14,879 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 23 treesize of output 18 [2018-12-09 01:47:14,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:14,882 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 27 [2018-12-09 01:47:14,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:47:14,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:47:14,889 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 01:47:14,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-12-09 01:47:15,066 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 26 treesize of output 18 [2018-12-09 01:47:15,067 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 01:47:15,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:47:15,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:47:15,069 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 01:47:15,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-09 01:47:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:47:15,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:47:15,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-12-09 01:47:15,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-09 01:47:15,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-09 01:47:15,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2018-12-09 01:47:15,116 INFO L87 Difference]: Start difference. First operand 297 states and 347 transitions. Second operand 30 states. [2018-12-09 01:47:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:47:35,840 INFO L93 Difference]: Finished difference Result 388 states and 451 transitions. [2018-12-09 01:47:35,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 01:47:35,840 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 52 [2018-12-09 01:47:35,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:47:35,841 INFO L225 Difference]: With dead ends: 388 [2018-12-09 01:47:35,841 INFO L226 Difference]: Without dead ends: 386 [2018-12-09 01:47:35,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=1847, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 01:47:35,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-12-09 01:47:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 303. [2018-12-09 01:47:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-12-09 01:47:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 355 transitions. [2018-12-09 01:47:35,929 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 355 transitions. Word has length 52 [2018-12-09 01:47:35,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:47:35,929 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 355 transitions. [2018-12-09 01:47:35,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-09 01:47:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 355 transitions. [2018-12-09 01:47:35,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 01:47:35,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:47:35,930 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:47:35,930 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:47:35,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:47:35,930 INFO L82 PathProgramCache]: Analyzing trace with hash 745072839, now seen corresponding path program 6 times [2018-12-09 01:47:35,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:47:35,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:47:35,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:47:35,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:47:35,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:47:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:47:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:47:36,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:47:36,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:47:36,211 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-09 01:47:36,235 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-12-09 01:47:36,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:47:36,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:47:36,293 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 15 treesize of output 12 [2018-12-09 01:47:36,298 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 01:47:36,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:47:36,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:47:36,304 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 01:47:36,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-12-09 01:47:36,401 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 28 treesize of output 23 [2018-12-09 01:47:36,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:36,404 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 23 treesize of output 37 [2018-12-09 01:47:36,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:47:36,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:47:36,413 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 01:47:36,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-12-09 01:47:36,472 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 32 treesize of output 25 [2018-12-09 01:47:36,473 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:36,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:36,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:36,477 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 25 treesize of output 58 [2018-12-09 01:47:36,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:47:36,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:47:36,488 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 01:47:36,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-12-09 01:47:36,701 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 26 treesize of output 18 [2018-12-09 01:47:36,703 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 01:47:36,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:47:36,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:47:36,704 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 01:47:36,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-09 01:47:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:47:36,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:47:36,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2018-12-09 01:47:36,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-09 01:47:36,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-09 01:47:36,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 01:47:36,757 INFO L87 Difference]: Start difference. First operand 303 states and 355 transitions. Second operand 39 states. [2018-12-09 01:47:57,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:47:57,727 INFO L93 Difference]: Finished difference Result 419 states and 482 transitions. [2018-12-09 01:47:57,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-09 01:47:57,727 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 53 [2018-12-09 01:47:57,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:47:57,728 INFO L225 Difference]: With dead ends: 419 [2018-12-09 01:47:57,728 INFO L226 Difference]: Without dead ends: 417 [2018-12-09 01:47:57,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=424, Invalid=3358, Unknown=0, NotChecked=0, Total=3782 [2018-12-09 01:47:57,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-12-09 01:47:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 305. [2018-12-09 01:47:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-12-09 01:47:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 354 transitions. [2018-12-09 01:47:57,825 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 354 transitions. Word has length 53 [2018-12-09 01:47:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:47:57,825 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 354 transitions. [2018-12-09 01:47:57,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-09 01:47:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 354 transitions. [2018-12-09 01:47:57,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 01:47:57,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:47:57,826 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:47:57,826 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:47:57,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:47:57,826 INFO L82 PathProgramCache]: Analyzing trace with hash -175042453, now seen corresponding path program 7 times [2018-12-09 01:47:57,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:47:57,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:47:57,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:47:57,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:47:57,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:47:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:47:57,922 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 01:47:57,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:47:57,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:47:57,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:47:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:47:57,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:47:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 01:47:58,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:47:58,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-12-09 01:47:58,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 01:47:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 01:47:58,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-12-09 01:47:58,007 INFO L87 Difference]: Start difference. First operand 305 states and 354 transitions. Second operand 15 states. [2018-12-09 01:47:58,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:47:58,253 INFO L93 Difference]: Finished difference Result 434 states and 507 transitions. [2018-12-09 01:47:58,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 01:47:58,253 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-12-09 01:47:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:47:58,254 INFO L225 Difference]: With dead ends: 434 [2018-12-09 01:47:58,254 INFO L226 Difference]: Without dead ends: 365 [2018-12-09 01:47:58,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-12-09 01:47:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-12-09 01:47:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 300. [2018-12-09 01:47:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-09 01:47:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 348 transitions. [2018-12-09 01:47:58,347 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 348 transitions. Word has length 55 [2018-12-09 01:47:58,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:47:58,347 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 348 transitions. [2018-12-09 01:47:58,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 01:47:58,347 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 348 transitions. [2018-12-09 01:47:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 01:47:58,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:47:58,348 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:47:58,348 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:47:58,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:47:58,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1983848057, now seen corresponding path program 1 times [2018-12-09 01:47:58,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:47:58,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:47:58,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:47:58,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:47:58,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:47:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:47:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:47:59,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:47:59,005 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:47:59,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:47:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:47:59,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:47:59,076 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 28 treesize of output 23 [2018-12-09 01:47:59,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,079 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 23 treesize of output 37 [2018-12-09 01:47:59,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:47:59,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:47:59,089 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 01:47:59,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-09 01:47:59,128 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 33 treesize of output 26 [2018-12-09 01:47:59,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,134 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 26 treesize of output 61 [2018-12-09 01:47:59,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:47:59,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:47:59,146 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 01:47:59,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2018-12-09 01:47:59,244 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 56 treesize of output 45 [2018-12-09 01:47:59,257 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-09 01:47:59,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:47:59,258 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:47:59,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 98 [2018-12-09 01:47:59,262 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:47:59,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:47:59,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:47:59,274 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:64, output treesize:44 [2018-12-09 01:47:59,390 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 53 treesize of output 40 [2018-12-09 01:47:59,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,393 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:47:59,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,395 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:47:59,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 40 treesize of output 98 [2018-12-09 01:47:59,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:47:59,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:47:59,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:47:59,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:47 [2018-12-09 01:47:59,546 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 54 treesize of output 43 [2018-12-09 01:47:59,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:47:59,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 117 [2018-12-09 01:47:59,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:47:59,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:47:59,597 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 2 xjuncts. [2018-12-09 01:47:59,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:79 [2018-12-09 01:47:59,786 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 26 treesize of output 18 [2018-12-09 01:47:59,789 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 01:47:59,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:47:59,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:47:59,792 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 01:47:59,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-12-09 01:47:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 9 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:47:59,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:47:59,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 45 [2018-12-09 01:47:59,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-09 01:47:59,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-09 01:47:59,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1775, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 01:47:59,933 INFO L87 Difference]: Start difference. First operand 300 states and 348 transitions. Second operand 45 states. [2018-12-09 01:48:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:48:19,123 INFO L93 Difference]: Finished difference Result 533 states and 619 transitions. [2018-12-09 01:48:19,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-09 01:48:19,124 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 54 [2018-12-09 01:48:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:48:19,124 INFO L225 Difference]: With dead ends: 533 [2018-12-09 01:48:19,125 INFO L226 Difference]: Without dead ends: 531 [2018-12-09 01:48:19,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 30 SyntacticMatches, 11 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3250 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1035, Invalid=9267, Unknown=0, NotChecked=0, Total=10302 [2018-12-09 01:48:19,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-12-09 01:48:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 398. [2018-12-09 01:48:19,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-12-09 01:48:19,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 458 transitions. [2018-12-09 01:48:19,275 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 458 transitions. Word has length 54 [2018-12-09 01:48:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:48:19,275 INFO L480 AbstractCegarLoop]: Abstraction has 398 states and 458 transitions. [2018-12-09 01:48:19,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-09 01:48:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 458 transitions. [2018-12-09 01:48:19,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 01:48:19,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:48:19,275 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:48:19,276 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:48:19,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:48:19,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2098824215, now seen corresponding path program 4 times [2018-12-09 01:48:19,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:48:19,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:48:19,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:48:19,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:48:19,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:48:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:48:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:48:20,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:48:20,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:48:20,280 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 01:48:20,314 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 01:48:20,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:48:20,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:48:20,416 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 38 treesize of output 31 [2018-12-09 01:48:20,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:20,418 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 31 treesize of output 47 [2018-12-09 01:48:20,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:20,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:20,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:20,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-12-09 01:48:20,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:20,571 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 52 treesize of output 54 [2018-12-09 01:48:20,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:20,574 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-12-09 01:48:20,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:20,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:20,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:48:20,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:41 [2018-12-09 01:48:20,607 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 42 treesize of output 33 [2018-12-09 01:48:20,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:20,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:20,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:20,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 case distinctions, treesize of input 33 treesize of output 91 [2018-12-09 01:48:20,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-12-09 01:48:20,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:48:20,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:48:20,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:137 [2018-12-09 01:48:20,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:20,934 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 63 treesize of output 67 [2018-12-09 01:48:20,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:20,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:20,938 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:48:20,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:20,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:20,940 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:48:20,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 132 [2018-12-09 01:48:20,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:20,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:20,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:20,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:58 [2018-12-09 01:48:21,111 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 59 treesize of output 48 [2018-12-09 01:48:21,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:21,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:21,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:21,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:21,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:21,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:21,147 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 144 [2018-12-09 01:48:21,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:48:21,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:48:21,233 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 2 xjuncts. [2018-12-09 01:48:21,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:99 [2018-12-09 01:48:21,517 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 38 treesize of output 31 [2018-12-09 01:48:21,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:21,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:21,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:21,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:21,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 75 [2018-12-09 01:48:21,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:21,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:21,551 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 01:48:21,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:23 [2018-12-09 01:48:21,960 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 28 treesize of output 20 [2018-12-09 01:48:21,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:21,966 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 01:48:21,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:21,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:21,972 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 01:48:21,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-12-09 01:48:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 5 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:48:22,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:48:22,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 51 [2018-12-09 01:48:22,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-09 01:48:22,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-09 01:48:22,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2333, Unknown=0, NotChecked=0, Total=2550 [2018-12-09 01:48:22,269 INFO L87 Difference]: Start difference. First operand 398 states and 458 transitions. Second operand 51 states. [2018-12-09 01:48:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:48:23,924 INFO L93 Difference]: Finished difference Result 427 states and 490 transitions. [2018-12-09 01:48:23,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-09 01:48:23,925 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 54 [2018-12-09 01:48:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:48:23,926 INFO L225 Difference]: With dead ends: 427 [2018-12-09 01:48:23,926 INFO L226 Difference]: Without dead ends: 410 [2018-12-09 01:48:23,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 25 SyntacticMatches, 15 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2195 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=441, Invalid=4961, Unknown=0, NotChecked=0, Total=5402 [2018-12-09 01:48:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-12-09 01:48:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 387. [2018-12-09 01:48:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-12-09 01:48:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 446 transitions. [2018-12-09 01:48:24,061 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 446 transitions. Word has length 54 [2018-12-09 01:48:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:48:24,061 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 446 transitions. [2018-12-09 01:48:24,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-09 01:48:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 446 transitions. [2018-12-09 01:48:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 01:48:24,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:48:24,062 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:48:24,062 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:48:24,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:48:24,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2049125808, now seen corresponding path program 5 times [2018-12-09 01:48:24,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:48:24,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:48:24,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:48:24,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:48:24,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:48:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:48:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 1 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:48:24,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:48:24,235 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:48:24,241 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 01:48:24,271 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-12-09 01:48:24,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:48:24,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:48:24,333 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 15 treesize of output 12 [2018-12-09 01:48:24,335 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 01:48:24,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:24,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:24,339 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 01:48:24,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-12-09 01:48:24,384 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 16 treesize of output 13 [2018-12-09 01:48:24,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 01:48:24,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:24,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:24,391 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 01:48:24,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:10 [2018-12-09 01:48:24,427 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:48:24,427 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 23 treesize of output 34 [2018-12-09 01:48:24,429 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:48:24,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-12-09 01:48:24,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:24,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:24,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:24,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:10 [2018-12-09 01:48:24,546 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 28 treesize of output 23 [2018-12-09 01:48:24,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:24,548 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 23 treesize of output 37 [2018-12-09 01:48:24,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:24,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:24,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:48:24,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-12-09 01:48:24,770 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 32 treesize of output 24 [2018-12-09 01:48:24,771 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:48:24,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:24,772 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:48:24,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 40 [2018-12-09 01:48:24,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:24,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:24,782 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 01:48:24,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-12-09 01:48:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:48:24,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:48:24,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 41 [2018-12-09 01:48:24,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-09 01:48:24,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-09 01:48:24,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1513, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 01:48:24,837 INFO L87 Difference]: Start difference. First operand 387 states and 446 transitions. Second operand 41 states. [2018-12-09 01:48:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:48:53,343 INFO L93 Difference]: Finished difference Result 815 states and 956 transitions. [2018-12-09 01:48:53,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-09 01:48:53,343 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 55 [2018-12-09 01:48:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:48:53,345 INFO L225 Difference]: With dead ends: 815 [2018-12-09 01:48:53,345 INFO L226 Difference]: Without dead ends: 760 [2018-12-09 01:48:53,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2966 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=746, Invalid=8760, Unknown=0, NotChecked=0, Total=9506 [2018-12-09 01:48:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-12-09 01:48:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 447. [2018-12-09 01:48:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-12-09 01:48:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 523 transitions. [2018-12-09 01:48:53,487 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 523 transitions. Word has length 55 [2018-12-09 01:48:53,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:48:53,488 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 523 transitions. [2018-12-09 01:48:53,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-09 01:48:53,488 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 523 transitions. [2018-12-09 01:48:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 01:48:53,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:48:53,489 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:48:53,489 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:48:53,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:48:53,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1811316562, now seen corresponding path program 2 times [2018-12-09 01:48:53,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:48:53,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:48:53,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:48:53,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:48:53,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:48:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:48:53,756 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 1 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:48:53,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:48:53,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:48:53,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:48:53,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:48:53,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:48:53,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:48:53,925 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 38 treesize of output 31 [2018-12-09 01:48:53,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:53,927 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 31 treesize of output 47 [2018-12-09 01:48:53,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:53,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:53,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:53,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-12-09 01:48:54,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:54,082 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 50 treesize of output 52 [2018-12-09 01:48:54,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:54,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:54,085 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:48:54,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 52 treesize of output 73 [2018-12-09 01:48:54,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:54,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:54,098 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 01:48:54,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:43 [2018-12-09 01:48:54,198 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 40 treesize of output 33 [2018-12-09 01:48:54,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:54,201 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:54,202 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:54,203 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:54,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 100 [2018-12-09 01:48:54,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:54,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:54,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:48:54,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:38 [2018-12-09 01:48:54,481 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 36 treesize of output 28 [2018-12-09 01:48:54,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:54,483 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:48:54,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:54,484 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:48:54,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:54,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-12-09 01:48:54,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:54,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:54,494 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 01:48:54,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:5 [2018-12-09 01:48:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:48:54,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:48:54,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26] total 44 [2018-12-09 01:48:54,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-09 01:48:54,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-09 01:48:54,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1717, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 01:48:54,561 INFO L87 Difference]: Start difference. First operand 447 states and 523 transitions. Second operand 44 states. [2018-12-09 01:48:56,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:48:56,942 INFO L93 Difference]: Finished difference Result 538 states and 625 transitions. [2018-12-09 01:48:56,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-09 01:48:56,943 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 55 [2018-12-09 01:48:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:48:56,946 INFO L225 Difference]: With dead ends: 538 [2018-12-09 01:48:56,946 INFO L226 Difference]: Without dead ends: 536 [2018-12-09 01:48:56,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=405, Invalid=3501, Unknown=0, NotChecked=0, Total=3906 [2018-12-09 01:48:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-12-09 01:48:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 474. [2018-12-09 01:48:57,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-12-09 01:48:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 553 transitions. [2018-12-09 01:48:57,110 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 553 transitions. Word has length 55 [2018-12-09 01:48:57,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:48:57,110 INFO L480 AbstractCegarLoop]: Abstraction has 474 states and 553 transitions. [2018-12-09 01:48:57,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-09 01:48:57,111 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 553 transitions. [2018-12-09 01:48:57,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 01:48:57,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:48:57,111 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:48:57,112 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:48:57,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:48:57,112 INFO L82 PathProgramCache]: Analyzing trace with hash -797020350, now seen corresponding path program 3 times [2018-12-09 01:48:57,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:48:57,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:48:57,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:48:57,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:48:57,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:48:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:48:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:48:57,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:48:57,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:48:57,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 01:48:57,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-09 01:48:57,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:48:57,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:48:57,664 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 38 treesize of output 31 [2018-12-09 01:48:57,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:57,666 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 31 treesize of output 47 [2018-12-09 01:48:57,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:57,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:57,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:57,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-12-09 01:48:57,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:57,813 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 51 treesize of output 53 [2018-12-09 01:48:57,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:57,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:57,816 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:48:57,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 53 treesize of output 72 [2018-12-09 01:48:57,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:57,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:57,834 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 01:48:57,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-12-09 01:48:57,911 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 34 treesize of output 27 [2018-12-09 01:48:57,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:57,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:57,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:57,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:57,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-12-09 01:48:57,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:57,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:57,927 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 01:48:57,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:24 [2018-12-09 01:48:58,022 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 34 treesize of output 27 [2018-12-09 01:48:58,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:58,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:58,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:58,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:58,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-12-09 01:48:58,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:58,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:58,038 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 01:48:58,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2018-12-09 01:48:58,235 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 28 treesize of output 20 [2018-12-09 01:48:58,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:48:58,237 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 01:48:58,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:48:58,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:48:58,239 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 01:48:58,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-12-09 01:48:58,291 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 1 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:48:58,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:48:58,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 47 [2018-12-09 01:48:58,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-09 01:48:58,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-09 01:48:58,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1957, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 01:48:58,307 INFO L87 Difference]: Start difference. First operand 474 states and 553 transitions. Second operand 47 states. [2018-12-09 01:48:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:48:59,871 INFO L93 Difference]: Finished difference Result 623 states and 722 transitions. [2018-12-09 01:48:59,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 01:48:59,872 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 55 [2018-12-09 01:48:59,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:48:59,873 INFO L225 Difference]: With dead ends: 623 [2018-12-09 01:48:59,873 INFO L226 Difference]: Without dead ends: 585 [2018-12-09 01:48:59,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=466, Invalid=3824, Unknown=0, NotChecked=0, Total=4290 [2018-12-09 01:48:59,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-12-09 01:49:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 490. [2018-12-09 01:49:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-12-09 01:49:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 573 transitions. [2018-12-09 01:49:00,023 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 573 transitions. Word has length 55 [2018-12-09 01:49:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:49:00,023 INFO L480 AbstractCegarLoop]: Abstraction has 490 states and 573 transitions. [2018-12-09 01:49:00,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-09 01:49:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 573 transitions. [2018-12-09 01:49:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 01:49:00,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:49:00,024 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:49:00,024 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:49:00,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:49:00,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1963459190, now seen corresponding path program 4 times [2018-12-09 01:49:00,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 01:49:00,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 01:49:00,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:49:00,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:49:00,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:49:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:49:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:49:00,057 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 01:49:00,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:49:00 BoogieIcfgContainer [2018-12-09 01:49:00,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:49:00,082 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:49:00,082 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:49:00,082 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:49:00,082 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:43:52" (3/4) ... [2018-12-09 01:49:00,084 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 01:49:00,113 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b3923773-46d8-473b-8687-651d323fbcd0/bin-2019/uautomizer/witness.graphml [2018-12-09 01:49:00,113 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:49:00,114 INFO L168 Benchmark]: Toolchain (without parser) took 307500.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 956.0 MB in the beginning and 901.9 MB in the end (delta: 54.1 MB). Peak memory consumption was 140.1 MB. Max. memory is 11.5 GB. [2018-12-09 01:49:00,114 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:49:00,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 129.33 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:49:00,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.44 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:49:00,115 INFO L168 Benchmark]: Boogie Preprocessor took 43.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-09 01:49:00,115 INFO L168 Benchmark]: RCFGBuilder took 148.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:49:00,115 INFO L168 Benchmark]: TraceAbstraction took 307132.01 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.7 MB). Free memory was 1.1 GB in the beginning and 908.8 MB in the end (delta: 170.9 MB). Peak memory consumption was 156.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:49:00,115 INFO L168 Benchmark]: Witness Printer took 31.91 ms. Allocated memory is still 1.1 GB. Free memory was 908.8 MB in the beginning and 901.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:49:00,116 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 129.33 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.44 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 148.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 307132.01 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.7 MB). Free memory was 1.1 GB in the beginning and 908.8 MB in the end (delta: 170.9 MB). Peak memory consumption was 156.2 MB. Max. memory is 11.5 GB. * Witness Printer took 31.91 ms. Allocated memory is still 1.1 GB. Free memory was 908.8 MB in the beginning and 901.9 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] unsigned int SIZE=__VERIFIER_nondet_uint(); [L12] int i, j, k, key; [L13] int v[SIZE]; [L14] j=1 VAL [j=1, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=1, k=0, SIZE=4, v={4294967302:0}, v[i]=-7] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=0, j=1, k=0, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=0, j=2, k=0, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=1, j=2, k=0, SIZE=4, v={4294967302:0}, v[i]=0] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=1, j=2, k=0, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=1, j=3, k=0, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=2, j=3, k=-3, SIZE=4, v={4294967302:0}, v[i]=0] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) VAL [i=2, j=3, k=-3, SIZE=4, v={4294967302:0}] [L20] i = i - 1 VAL [i=1, j=3, k=-3, SIZE=4, v={4294967302:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=1, j=3, k=-3, SIZE=4, v={4294967302:0}, v[i]=0] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR v[i] [L19] v[i+1] = v[i] [L20] i = i - 1 VAL [i=0, j=3, k=-3, SIZE=4, v={4294967302:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=3, k=-3, SIZE=4, v={4294967302:0}, v[i]=-7] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=0, j=3, k=-3, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=0, j=4, k=-3, SIZE=4, v={4294967302:0}] [L14] COND FALSE !(j