./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-5842f4b [2018-11-18 16:49:41,917 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:49:41,919 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:49:41,927 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:49:41,927 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:49:41,928 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:49:41,929 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:49:41,931 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:49:41,932 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:49:41,933 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:49:41,933 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:49:41,934 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:49:41,934 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:49:41,935 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:49:41,936 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:49:41,936 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:49:41,937 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:49:41,938 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:49:41,939 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:49:41,940 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:49:41,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:49:41,942 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:49:41,944 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:49:41,944 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:49:41,944 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:49:41,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:49:41,945 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:49:41,946 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:49:41,946 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:49:41,947 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:49:41,947 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:49:41,948 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:49:41,948 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:49:41,948 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:49:41,949 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:49:41,950 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:49:41,950 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 16:49:41,961 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:49:41,961 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:49:41,962 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:49:41,962 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 16:49:41,962 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:49:41,963 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:49:41,963 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:49:41,963 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:49:41,963 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:49:41,963 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:49:41,963 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:49:41,963 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:49:41,963 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:49:41,964 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:49:41,964 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:49:41,964 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:49:41,964 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:49:41,964 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:49:41,964 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:49:41,964 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:49:41,965 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:49:41,965 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:49:41,965 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:49:41,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:49:41,965 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:49:41,965 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:49:41,965 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:49:41,965 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:49:41,966 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:49:41,966 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:49:41,966 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_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:49:41,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:49:41,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:49:42,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:49:42,002 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:49:42,002 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:49:42,002 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/bin-2019/uautomizer/../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-18 16:49:42,049 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/bin-2019/uautomizer/data/0e6ff2ed7/50993ac9a3ca469dae5d56a8dd0fbb44/FLAGd9d5141bd [2018-11-18 16:49:42,391 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:49:42,391 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-18 16:49:42,396 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/bin-2019/uautomizer/data/0e6ff2ed7/50993ac9a3ca469dae5d56a8dd0fbb44/FLAGd9d5141bd [2018-11-18 16:49:42,811 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/bin-2019/uautomizer/data/0e6ff2ed7/50993ac9a3ca469dae5d56a8dd0fbb44 [2018-11-18 16:49:42,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:49:42,814 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 16:49:42,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:49:42,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:49:42,818 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:49:42,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:49:42" (1/1) ... [2018-11-18 16:49:42,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77c97579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:42, skipping insertion in model container [2018-11-18 16:49:42,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:49:42" (1/1) ... [2018-11-18 16:49:42,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:49:42,845 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:49:43,012 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:49:43,015 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:49:43,034 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:49:43,051 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:49:43,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:43 WrapperNode [2018-11-18 16:49:43,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:49:43,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:49:43,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:49:43,052 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:49:43,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:43" (1/1) ... [2018-11-18 16:49:43,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:43" (1/1) ... [2018-11-18 16:49:43,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:43" (1/1) ... [2018-11-18 16:49:43,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:43" (1/1) ... [2018-11-18 16:49:43,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:43" (1/1) ... [2018-11-18 16:49:43,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:43" (1/1) ... [2018-11-18 16:49:43,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:43" (1/1) ... [2018-11-18 16:49:43,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:49:43,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:49:43,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:49:43,084 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:49:43,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:49:43,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:49:43,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:49:43,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 16:49:43,191 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:49:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 16:49:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 16:49:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-18 16:49:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:49:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:49:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 16:49:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 16:49:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:49:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:49:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:49:43,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 16:49:43,457 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:49:43,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:49:43 BoogieIcfgContainer [2018-11-18 16:49:43,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:49:43,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:49:43,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:49:43,461 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:49:43,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:49:42" (1/3) ... [2018-11-18 16:49:43,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410552b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:49:43, skipping insertion in model container [2018-11-18 16:49:43,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:49:43" (2/3) ... [2018-11-18 16:49:43,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410552b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:49:43, skipping insertion in model container [2018-11-18 16:49:43,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:49:43" (3/3) ... [2018-11-18 16:49:43,463 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-11-18 16:49:43,470 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:49:43,475 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:49:43,484 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:49:43,505 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:49:43,506 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:49:43,506 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:49:43,506 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:49:43,506 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:49:43,506 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:49:43,506 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:49:43,506 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:49:43,507 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:49:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-18 16:49:43,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 16:49:43,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:43,529 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:43,530 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:43,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:43,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1403248464, now seen corresponding path program 1 times [2018-11-18 16:49:43,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:49:43,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:49:43,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:43,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:43,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:43,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:43,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:49:43,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 16:49:43,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:49:43,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:49:43,641 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-18 16:49:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:43,656 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2018-11-18 16:49:43,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:49:43,658 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-18 16:49:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:43,662 INFO L225 Difference]: With dead ends: 60 [2018-11-18 16:49:43,662 INFO L226 Difference]: Without dead ends: 28 [2018-11-18 16:49:43,665 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:49:43,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-18 16:49:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-18 16:49:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 16:49:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-18 16:49:43,690 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2018-11-18 16:49:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:43,690 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-18 16:49:43,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 16:49:43,691 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-18 16:49:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 16:49:43,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:43,691 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:43,692 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:43,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:43,692 INFO L82 PathProgramCache]: Analyzing trace with hash 969867983, now seen corresponding path program 1 times [2018-11-18 16:49:43,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:49:43,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:49:43,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:43,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:43,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:43,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:49:43,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:49:43,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:49:43,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:49:43,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:49:43,835 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-11-18 16:49:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:43,921 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-18 16:49:43,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:49:43,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-18 16:49:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:43,923 INFO L225 Difference]: With dead ends: 52 [2018-11-18 16:49:43,923 INFO L226 Difference]: Without dead ends: 38 [2018-11-18 16:49:43,923 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:49:43,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-18 16:49:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-11-18 16:49:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 16:49:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-18 16:49:43,928 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2018-11-18 16:49:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:43,928 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-18 16:49:43,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:49:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-18 16:49:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:49:43,929 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:43,929 INFO L375 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] [2018-11-18 16:49:43,929 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:43,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:43,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1889876064, now seen corresponding path program 1 times [2018-11-18 16:49:43,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:49:43,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:49:43,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:43,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:43,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:44,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:44,474 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:49:44,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:44,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:44,733 INFO L477 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-11-18 16:49:44,737 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:44,746 INFO L477 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-11-18 16:49:44,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:44,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:44,762 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-11-18 16:49:44,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-18 16:49:44,800 INFO L477 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-11-18 16:49:44,807 INFO L477 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-11-18 16:49:44,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:44,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:44,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:44,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-18 16:49:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:44,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:49:44,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-11-18 16:49:44,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 16:49:44,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 16:49:44,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-18 16:49:44,870 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 17 states. [2018-11-18 16:49:45,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:45,464 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2018-11-18 16:49:45,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 16:49:45,464 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-18 16:49:45,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:45,466 INFO L225 Difference]: With dead ends: 101 [2018-11-18 16:49:45,466 INFO L226 Difference]: Without dead ends: 79 [2018-11-18 16:49:45,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-11-18 16:49:45,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-18 16:49:45,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 52. [2018-11-18 16:49:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 16:49:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-11-18 16:49:45,477 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 23 [2018-11-18 16:49:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:45,477 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-18 16:49:45,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 16:49:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-11-18 16:49:45,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 16:49:45,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:45,478 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:45,479 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:45,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:45,479 INFO L82 PathProgramCache]: Analyzing trace with hash -249426572, now seen corresponding path program 1 times [2018-11-18 16:49:45,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:49:45,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:49:45,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:45,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:45,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:46,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:46,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:49:46,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:46,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:46,183 INFO L477 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-11-18 16:49:46,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:46,187 INFO L477 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-11-18 16:49:46,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:46,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:46,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:46,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-18 16:49:46,433 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:46,434 INFO L477 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-11-18 16:49:46,438 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:46,441 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:46,441 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:46,443 INFO L477 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-11-18 16:49:46,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:46,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:46,459 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-11-18 16:49:46,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-18 16:49:46,517 INFO L477 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-11-18 16:49:46,519 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:46,521 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:46,521 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:46,522 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:46,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:46,523 INFO L477 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-11-18 16:49:46,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:46,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:46,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:46,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-18 16:49:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:46,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:49:46,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 29 [2018-11-18 16:49:46,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 16:49:46,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 16:49:46,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2018-11-18 16:49:46,576 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 29 states. [2018-11-18 16:49:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:47,247 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2018-11-18 16:49:47,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 16:49:47,248 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-11-18 16:49:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:47,250 INFO L225 Difference]: With dead ends: 124 [2018-11-18 16:49:47,250 INFO L226 Difference]: Without dead ends: 83 [2018-11-18 16:49:47,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=231, Invalid=1491, Unknown=0, NotChecked=0, Total=1722 [2018-11-18 16:49:47,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-18 16:49:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 52. [2018-11-18 16:49:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 16:49:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-18 16:49:47,256 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 29 [2018-11-18 16:49:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:47,256 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-18 16:49:47,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 16:49:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-18 16:49:47,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 16:49:47,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:47,257 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:47,257 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:47,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:47,257 INFO L82 PathProgramCache]: Analyzing trace with hash -853417747, now seen corresponding path program 1 times [2018-11-18 16:49:47,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:49:47,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:49:47,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:47,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:47,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:47,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:47,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:49:47,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:47,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:47,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:49:47,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-11-18 16:49:47,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:49:47,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:49:47,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:49:47,401 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 9 states. [2018-11-18 16:49:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:47,454 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-11-18 16:49:47,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:49:47,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-18 16:49:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:47,455 INFO L225 Difference]: With dead ends: 75 [2018-11-18 16:49:47,455 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 16:49:47,456 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:49:47,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 16:49:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-11-18 16:49:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 16:49:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-18 16:49:47,460 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 32 [2018-11-18 16:49:47,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:47,460 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-18 16:49:47,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:49:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-18 16:49:47,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 16:49:47,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:47,461 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:47,461 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:47,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:47,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1757852431, now seen corresponding path program 2 times [2018-11-18 16:49:47,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:49:47,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:49:47,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:47,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:47,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:47,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:47,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:49:47,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 16:49:47,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:49:47,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:49:47,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:47,812 INFO L477 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-11-18 16:49:47,817 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:47,818 INFO L477 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-11-18 16:49:47,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:47,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:47,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:47,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-18 16:49:47,878 INFO L477 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-11-18 16:49:47,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:47,883 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:47,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:47,895 INFO L477 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-11-18 16:49:47,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:47,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:47,910 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-11-18 16:49:47,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2018-11-18 16:49:47,927 INFO L477 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-11-18 16:49:47,931 INFO L477 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-11-18 16:49:47,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:47,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:47,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:47,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-18 16:49:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:47,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:49:47,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 18 [2018-11-18 16:49:47,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 16:49:47,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 16:49:47,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-11-18 16:49:47,967 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 18 states. [2018-11-18 16:49:48,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:48,419 INFO L93 Difference]: Finished difference Result 130 states and 157 transitions. [2018-11-18 16:49:48,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 16:49:48,420 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 31 [2018-11-18 16:49:48,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:48,422 INFO L225 Difference]: With dead ends: 130 [2018-11-18 16:49:48,422 INFO L226 Difference]: Without dead ends: 108 [2018-11-18 16:49:48,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2018-11-18 16:49:48,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-18 16:49:48,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 69. [2018-11-18 16:49:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-18 16:49:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-11-18 16:49:48,430 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 31 [2018-11-18 16:49:48,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:48,431 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-11-18 16:49:48,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 16:49:48,431 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-11-18 16:49:48,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 16:49:48,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:48,432 INFO L375 BasicCegarLoop]: trace histogram [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-11-18 16:49:48,432 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:48,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:48,432 INFO L82 PathProgramCache]: Analyzing trace with hash -289889213, now seen corresponding path program 1 times [2018-11-18 16:49:48,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:49:48,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:49:48,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:48,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:49:48,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:48,667 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:48,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:48,667 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:49:48,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:48,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:48,786 INFO L477 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-11-18 16:49:48,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:48,789 INFO L477 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-11-18 16:49:48,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:48,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:48,797 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-11-18 16:49:48,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-18 16:49:48,818 INFO L477 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-11-18 16:49:48,822 INFO L477 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-11-18 16:49:48,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:48,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:48,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:48,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-18 16:49:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:48,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:49:48,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-11-18 16:49:48,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 16:49:48,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 16:49:48,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-11-18 16:49:48,851 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 17 states. [2018-11-18 16:49:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:49,267 INFO L93 Difference]: Finished difference Result 177 states and 220 transitions. [2018-11-18 16:49:49,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-18 16:49:49,268 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-11-18 16:49:49,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:49,269 INFO L225 Difference]: With dead ends: 177 [2018-11-18 16:49:49,269 INFO L226 Difference]: Without dead ends: 155 [2018-11-18 16:49:49,269 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 16:49:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-18 16:49:49,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 82. [2018-11-18 16:49:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 16:49:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2018-11-18 16:49:49,277 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 37 [2018-11-18 16:49:49,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:49,278 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2018-11-18 16:49:49,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 16:49:49,278 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2018-11-18 16:49:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 16:49:49,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:49,279 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-11-18 16:49:49,279 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:49,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:49,279 INFO L82 PathProgramCache]: Analyzing trace with hash -876695227, now seen corresponding path program 2 times [2018-11-18 16:49:49,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:49:49,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:49:49,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:49,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:49:49,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:49,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:49,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:49:49,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 16:49:49,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:49:49,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:49:49,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:49,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:49:49,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-18 16:49:49,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 16:49:49,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:49:49,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:49:49,378 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand 7 states. [2018-11-18 16:49:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:49,512 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-11-18 16:49:49,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:49:49,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-11-18 16:49:49,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:49,514 INFO L225 Difference]: With dead ends: 178 [2018-11-18 16:49:49,514 INFO L226 Difference]: Without dead ends: 128 [2018-11-18 16:49:49,515 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 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-11-18 16:49:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-18 16:49:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2018-11-18 16:49:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-18 16:49:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2018-11-18 16:49:49,525 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 37 [2018-11-18 16:49:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:49,525 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2018-11-18 16:49:49,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 16:49:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2018-11-18 16:49:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 16:49:49,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:49,526 INFO L375 BasicCegarLoop]: trace histogram [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, 1] [2018-11-18 16:49:49,527 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:49,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1634323973, now seen corresponding path program 3 times [2018-11-18 16:49:49,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:49:49,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:49:49,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:49,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:49:49,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:49,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:49,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:49:49,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:49:49,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 16:49:49,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:49:49,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:49,955 INFO L477 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-11-18 16:49:49,957 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:49,958 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:49,959 INFO L477 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-11-18 16:49:49,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:49,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:49,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:49,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-11-18 16:49:50,052 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:50,053 INFO L477 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-11-18 16:49:50,055 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:50,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:50,057 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:50,057 INFO L477 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-11-18 16:49:50,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:50,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:50,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:50,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-11-18 16:49:50,178 INFO L477 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-11-18 16:49:50,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:50,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:50,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:50,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:50,184 INFO L477 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-11-18 16:49:50,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:50,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:50,198 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-11-18 16:49:50,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:27 [2018-11-18 16:49:50,221 INFO L477 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-11-18 16:49:50,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:50,223 INFO L477 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-11-18 16:49:50,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:50,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:50,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:50,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-18 16:49:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:50,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:49:50,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25 [2018-11-18 16:49:50,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 16:49:50,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 16:49:50,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-11-18 16:49:50,267 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 25 states. [2018-11-18 16:49:50,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:50,748 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2018-11-18 16:49:50,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 16:49:50,748 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2018-11-18 16:49:50,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:50,749 INFO L225 Difference]: With dead ends: 156 [2018-11-18 16:49:50,749 INFO L226 Difference]: Without dead ends: 154 [2018-11-18 16:49:50,750 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 16:49:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-18 16:49:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 85. [2018-11-18 16:49:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-18 16:49:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2018-11-18 16:49:50,760 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 37 [2018-11-18 16:49:50,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:50,760 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2018-11-18 16:49:50,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 16:49:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2018-11-18 16:49:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 16:49:50,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:50,761 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:50,761 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:50,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:50,762 INFO L82 PathProgramCache]: Analyzing trace with hash -411213956, now seen corresponding path program 2 times [2018-11-18 16:49:50,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:49:50,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:49:50,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:50,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:49:50,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:50,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:50,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:49:50,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 16:49:50,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:49:50,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:49:50,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:51,052 INFO L477 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-11-18 16:49:51,054 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:51,055 INFO L477 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-11-18 16:49:51,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:51,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:51,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:51,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-18 16:49:51,184 INFO L477 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-11-18 16:49:51,186 INFO L477 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-11-18 16:49:51,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:51,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:51,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:51,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-18 16:49:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:51,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:49:51,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-11-18 16:49:51,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 16:49:51,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 16:49:51,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2018-11-18 16:49:51,230 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 29 states. [2018-11-18 16:49:59,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:49:59,352 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2018-11-18 16:49:59,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 16:49:59,352 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2018-11-18 16:49:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:49:59,353 INFO L225 Difference]: With dead ends: 154 [2018-11-18 16:49:59,353 INFO L226 Difference]: Without dead ends: 152 [2018-11-18 16:49:59,354 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=1735, Unknown=0, NotChecked=0, Total=1980 [2018-11-18 16:49:59,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-18 16:49:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 99. [2018-11-18 16:49:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 16:49:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2018-11-18 16:49:59,361 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 40 [2018-11-18 16:49:59,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:49:59,361 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2018-11-18 16:49:59,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 16:49:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2018-11-18 16:49:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 16:49:59,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:49:59,362 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:49:59,363 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:49:59,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:49:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2011153175, now seen corresponding path program 4 times [2018-11-18 16:49:59,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:49:59,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:49:59,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:59,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:49:59,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:49:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:49:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:49:59,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:49:59,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:49:59,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 16:49:59,666 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 16:49:59,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:49:59,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:49:59,750 INFO L477 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-11-18 16:49:59,757 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:59,758 INFO L477 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-11-18 16:49:59,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:59,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:59,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:59,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-11-18 16:49:59,937 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:59,938 INFO L477 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-11-18 16:49:59,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:59,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:59,941 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:59,942 INFO L477 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-11-18 16:49:59,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:49:59,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:49:59,953 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-11-18 16:49:59,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:35 [2018-11-18 16:49:59,992 INFO L477 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-11-18 16:49:59,994 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:59,995 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:59,995 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:59,996 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:49:59,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:49:59,997 INFO L477 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-11-18 16:49:59,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:00,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2018-11-18 16:50:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 16:50:00,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:50:00,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 28 [2018-11-18 16:50:00,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 16:50:00,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 16:50:00,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-11-18 16:50:00,036 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 28 states. [2018-11-18 16:50:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:01,207 INFO L93 Difference]: Finished difference Result 203 states and 237 transitions. [2018-11-18 16:50:01,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-18 16:50:01,208 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 43 [2018-11-18 16:50:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:01,209 INFO L225 Difference]: With dead ends: 203 [2018-11-18 16:50:01,209 INFO L226 Difference]: Without dead ends: 153 [2018-11-18 16:50:01,209 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=425, Invalid=2545, Unknown=0, NotChecked=0, Total=2970 [2018-11-18 16:50:01,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-18 16:50:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 103. [2018-11-18 16:50:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-18 16:50:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2018-11-18 16:50:01,218 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 43 [2018-11-18 16:50:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:01,219 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-11-18 16:50:01,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 16:50:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2018-11-18 16:50:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 16:50:01,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:01,220 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:01,220 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:01,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:01,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1389059306, now seen corresponding path program 1 times [2018-11-18 16:50:01,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:50:01,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:50:01,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:01,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:50:01,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:01,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:01,597 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:50:01,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:01,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:01,669 INFO L477 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-11-18 16:50:01,671 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:01,672 INFO L477 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-11-18 16:50:01,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:01,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:01,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:01,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-18 16:50:01,739 INFO L477 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-11-18 16:50:01,748 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 16:50:01,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:01,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:01,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:01,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:01,754 INFO L477 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 28 treesize of output 49 [2018-11-18 16:50:01,754 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:01,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:01,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:01,764 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:42, output treesize:19 [2018-11-18 16:50:01,800 INFO L477 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-11-18 16:50:01,807 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:01,808 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:01,810 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:01,814 INFO L477 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-11-18 16:50:01,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:01,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:01,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:01,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-18 16:50:01,846 INFO L477 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-11-18 16:50:01,850 INFO L477 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-11-18 16:50:01,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:01,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:01,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:01,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-18 16:50:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 16:50:01,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:50:01,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2018-11-18 16:50:01,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 16:50:01,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 16:50:01,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-11-18 16:50:01,916 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 21 states. [2018-11-18 16:50:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:02,488 INFO L93 Difference]: Finished difference Result 292 states and 339 transitions. [2018-11-18 16:50:02,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-18 16:50:02,489 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2018-11-18 16:50:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:02,489 INFO L225 Difference]: With dead ends: 292 [2018-11-18 16:50:02,490 INFO L226 Difference]: Without dead ends: 238 [2018-11-18 16:50:02,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 14 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=1135, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 16:50:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-18 16:50:02,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 149. [2018-11-18 16:50:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-18 16:50:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2018-11-18 16:50:02,507 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 45 [2018-11-18 16:50:02,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:02,507 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2018-11-18 16:50:02,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 16:50:02,507 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2018-11-18 16:50:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 16:50:02,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:02,508 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-11-18 16:50:02,509 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:02,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:02,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1009376150, now seen corresponding path program 1 times [2018-11-18 16:50:02,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:50:02,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:50:02,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:02,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:02,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:02,814 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:02,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:02,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:50:02,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:02,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:02,949 INFO L477 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-11-18 16:50:02,951 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:02,951 INFO L477 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-11-18 16:50:02,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:02,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:02,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:02,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-18 16:50:03,052 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:03,052 INFO L477 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-11-18 16:50:03,055 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:03,055 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:03,056 INFO L477 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-11-18 16:50:03,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:03,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:03,065 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-11-18 16:50:03,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2018-11-18 16:50:03,246 INFO L477 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-11-18 16:50:03,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:03,248 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:03,249 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:03,249 INFO L477 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-11-18 16:50:03,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:03,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:03,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:03,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-11-18 16:50:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:03,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:50:03,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2018-11-18 16:50:03,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-18 16:50:03,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-18 16:50:03,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1285, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 16:50:03,309 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 38 states. [2018-11-18 16:50:04,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:04,178 INFO L93 Difference]: Finished difference Result 229 states and 264 transitions. [2018-11-18 16:50:04,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 16:50:04,178 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 46 [2018-11-18 16:50:04,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:04,179 INFO L225 Difference]: With dead ends: 229 [2018-11-18 16:50:04,179 INFO L226 Difference]: Without dead ends: 227 [2018-11-18 16:50:04,179 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=338, Invalid=3202, Unknown=0, NotChecked=0, Total=3540 [2018-11-18 16:50:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-18 16:50:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 158. [2018-11-18 16:50:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-18 16:50:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 184 transitions. [2018-11-18 16:50:04,195 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 184 transitions. Word has length 46 [2018-11-18 16:50:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:04,195 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 184 transitions. [2018-11-18 16:50:04,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-18 16:50:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 184 transitions. [2018-11-18 16:50:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 16:50:04,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:04,196 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:04,196 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:04,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:04,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1700799956, now seen corresponding path program 2 times [2018-11-18 16:50:04,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:50:04,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:50:04,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:04,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:04,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:04,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:04,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:50:04,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 16:50:04,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:50:04,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:50:04,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:04,623 INFO L477 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-11-18 16:50:04,625 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:04,627 INFO L477 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-11-18 16:50:04,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:04,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:04,637 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-11-18 16:50:04,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-11-18 16:50:04,691 INFO L477 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-11-18 16:50:04,693 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:04,694 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:04,695 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:04,698 INFO L477 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-11-18 16:50:04,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:04,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:04,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:04,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-11-18 16:50:04,722 INFO L477 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-11-18 16:50:04,724 INFO L477 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-11-18 16:50:04,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:04,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:04,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-11-18 16:50:04,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-18 16:50:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:04,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:50:04,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-11-18 16:50:04,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 16:50:04,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 16:50:04,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2018-11-18 16:50:04,757 INFO L87 Difference]: Start difference. First operand 158 states and 184 transitions. Second operand 25 states. [2018-11-18 16:50:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:05,489 INFO L93 Difference]: Finished difference Result 315 states and 366 transitions. [2018-11-18 16:50:05,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-18 16:50:05,489 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 45 [2018-11-18 16:50:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:05,491 INFO L225 Difference]: With dead ends: 315 [2018-11-18 16:50:05,491 INFO L226 Difference]: Without dead ends: 261 [2018-11-18 16:50:05,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2018-11-18 16:50:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-18 16:50:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 173. [2018-11-18 16:50:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-18 16:50:05,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 203 transitions. [2018-11-18 16:50:05,511 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 203 transitions. Word has length 45 [2018-11-18 16:50:05,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:05,511 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 203 transitions. [2018-11-18 16:50:05,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 16:50:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 203 transitions. [2018-11-18 16:50:05,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 16:50:05,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:05,512 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:05,512 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:05,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:05,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1905129809, now seen corresponding path program 3 times [2018-11-18 16:50:05,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:50:05,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:50:05,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:05,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:50:05,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:50:05,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:05,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:50:05,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:50:05,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-18 16:50:05,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:50:05,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:50:05,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:50:05,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-11-18 16:50:05,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:50:05,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:50:05,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:50:05,739 INFO L87 Difference]: Start difference. First operand 173 states and 203 transitions. Second operand 12 states. [2018-11-18 16:50:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:05,834 INFO L93 Difference]: Finished difference Result 261 states and 305 transitions. [2018-11-18 16:50:05,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 16:50:05,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-11-18 16:50:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:05,836 INFO L225 Difference]: With dead ends: 261 [2018-11-18 16:50:05,836 INFO L226 Difference]: Without dead ends: 233 [2018-11-18 16:50:05,836 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 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-11-18 16:50:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-18 16:50:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 182. [2018-11-18 16:50:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-18 16:50:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 211 transitions. [2018-11-18 16:50:05,855 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 211 transitions. Word has length 49 [2018-11-18 16:50:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:05,855 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 211 transitions. [2018-11-18 16:50:05,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:50:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 211 transitions. [2018-11-18 16:50:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 16:50:05,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:05,857 INFO L375 BasicCegarLoop]: trace histogram [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-11-18 16:50:05,857 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:05,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:05,858 INFO L82 PathProgramCache]: Analyzing trace with hash -139141365, now seen corresponding path program 4 times [2018-11-18 16:50:05,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:50:05,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:50:05,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:05,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:50:05,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:06,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:06,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:50:06,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 16:50:06,113 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 16:50:06,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:50:06,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:06,139 INFO L477 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-11-18 16:50:06,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 16:50:06,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:06,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:06,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:06,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-18 16:50:06,214 INFO L477 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-11-18 16:50:06,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:06,217 INFO L477 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-11-18 16:50:06,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:06,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:06,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:06,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-18 16:50:06,274 INFO L477 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-11-18 16:50:06,276 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:06,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:06,278 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:06,280 INFO L477 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-11-18 16:50:06,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:06,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:06,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:06,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-18 16:50:06,418 INFO L477 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-11-18 16:50:06,420 INFO L477 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-11-18 16:50:06,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:06,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:06,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:06,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-18 16:50:06,452 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:06,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:50:06,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 34 [2018-11-18 16:50:06,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-18 16:50:06,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-18 16:50:06,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 16:50:06,468 INFO L87 Difference]: Start difference. First operand 182 states and 211 transitions. Second operand 34 states. [2018-11-18 16:50:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:18,974 INFO L93 Difference]: Finished difference Result 297 states and 345 transitions. [2018-11-18 16:50:18,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 16:50:18,975 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2018-11-18 16:50:18,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:18,976 INFO L225 Difference]: With dead ends: 297 [2018-11-18 16:50:18,976 INFO L226 Difference]: Without dead ends: 228 [2018-11-18 16:50:18,977 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=291, Invalid=2159, Unknown=0, NotChecked=0, Total=2450 [2018-11-18 16:50:18,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-11-18 16:50:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 201. [2018-11-18 16:50:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 16:50:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 230 transitions. [2018-11-18 16:50:19,006 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 230 transitions. Word has length 48 [2018-11-18 16:50:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:19,006 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 230 transitions. [2018-11-18 16:50:19,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-18 16:50:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 230 transitions. [2018-11-18 16:50:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 16:50:19,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:19,007 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:19,007 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:19,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:19,008 INFO L82 PathProgramCache]: Analyzing trace with hash 2124575766, now seen corresponding path program 1 times [2018-11-18 16:50:19,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:50:19,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:50:19,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:19,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:50:19,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:19,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:19,762 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:50:19,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:19,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:19,825 INFO L477 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-11-18 16:50:19,827 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:19,829 INFO L477 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-11-18 16:50:19,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:19,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:19,844 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-11-18 16:50:19,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-11-18 16:50:19,894 INFO L477 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-11-18 16:50:19,897 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:19,898 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:19,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:19,900 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:19,903 INFO L477 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 33 treesize of output 83 [2018-11-18 16:50:19,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:19,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:19,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:19,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:45 [2018-11-18 16:50:20,060 INFO L477 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-11-18 16:50:20,064 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:20,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:20,073 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:20,075 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:20,076 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:20,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:20,078 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:20,079 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:20,102 INFO L477 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-11-18 16:50:20,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:20,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:20,126 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-11-18 16:50:20,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:54 [2018-11-18 16:50:20,279 INFO L477 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-11-18 16:50:20,281 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:20,282 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:20,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:20,284 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:20,285 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:20,294 INFO L477 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 45 treesize of output 125 [2018-11-18 16:50:20,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 16:50:20,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:50:20,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 16:50:20,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:73, output treesize:85 [2018-11-18 16:50:20,529 INFO L477 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-11-18 16:50:20,531 INFO L477 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-11-18 16:50:20,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:20,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:20,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:20,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-18 16:50:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:20,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:50:20,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 41 [2018-11-18 16:50:20,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-18 16:50:20,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-18 16:50:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1476, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 16:50:20,610 INFO L87 Difference]: Start difference. First operand 201 states and 230 transitions. Second operand 41 states. [2018-11-18 16:50:32,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:32,765 INFO L93 Difference]: Finished difference Result 252 states and 286 transitions. [2018-11-18 16:50:32,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-18 16:50:32,766 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 52 [2018-11-18 16:50:32,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:32,767 INFO L225 Difference]: With dead ends: 252 [2018-11-18 16:50:32,767 INFO L226 Difference]: Without dead ends: 233 [2018-11-18 16:50:32,768 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 32 SyntacticMatches, 10 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=442, Invalid=3590, Unknown=0, NotChecked=0, Total=4032 [2018-11-18 16:50:32,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-18 16:50:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 217. [2018-11-18 16:50:32,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-18 16:50:32,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 247 transitions. [2018-11-18 16:50:32,799 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 247 transitions. Word has length 52 [2018-11-18 16:50:32,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:32,800 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 247 transitions. [2018-11-18 16:50:32,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-18 16:50:32,800 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 247 transitions. [2018-11-18 16:50:32,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 16:50:32,800 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:32,801 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:32,801 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:32,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:32,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1523240792, now seen corresponding path program 5 times [2018-11-18 16:50:32,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:50:32,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:50:32,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:32,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:32,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:33,283 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 30 [2018-11-18 16:50:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:33,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:33,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:50:33,590 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 16:50:33,610 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 16:50:33,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:50:33,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:33,738 INFO L477 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-11-18 16:50:33,740 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:33,741 INFO L477 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-11-18 16:50:33,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:33,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:33,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:33,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-11-18 16:50:33,816 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:33,817 INFO L477 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-11-18 16:50:33,819 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:33,820 INFO L477 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-11-18 16:50:33,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:33,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:33,835 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-11-18 16:50:33,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:42 [2018-11-18 16:50:33,882 INFO L477 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-11-18 16:50:33,884 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:33,885 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:33,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:33,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:33,888 INFO L477 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-11-18 16:50:33,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:33,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:33,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:33,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-11-18 16:50:33,912 INFO L477 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-11-18 16:50:33,914 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:33,914 INFO L477 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-11-18 16:50:33,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:33,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:33,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:33,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-18 16:50:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 40 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 16:50:33,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:50:33,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 32 [2018-11-18 16:50:33,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-18 16:50:33,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-18 16:50:33,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2018-11-18 16:50:33,948 INFO L87 Difference]: Start difference. First operand 217 states and 247 transitions. Second operand 32 states. [2018-11-18 16:50:35,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:35,393 INFO L93 Difference]: Finished difference Result 410 states and 476 transitions. [2018-11-18 16:50:35,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-18 16:50:35,394 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2018-11-18 16:50:35,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:35,395 INFO L225 Difference]: With dead ends: 410 [2018-11-18 16:50:35,395 INFO L226 Difference]: Without dead ends: 341 [2018-11-18 16:50:35,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=679, Invalid=3743, Unknown=0, NotChecked=0, Total=4422 [2018-11-18 16:50:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-11-18 16:50:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 237. [2018-11-18 16:50:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-11-18 16:50:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 271 transitions. [2018-11-18 16:50:35,419 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 271 transitions. Word has length 51 [2018-11-18 16:50:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:35,419 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 271 transitions. [2018-11-18 16:50:35,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-18 16:50:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 271 transitions. [2018-11-18 16:50:35,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 16:50:35,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:35,420 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:50:35,420 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:35,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:35,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2031333674, now seen corresponding path program 1 times [2018-11-18 16:50:35,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:50:35,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:50:35,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:35,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:50:35,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:35,686 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2018-11-18 16:50:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:36,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:36,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:50:36,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:36,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:36,209 INFO L477 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-11-18 16:50:36,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:36,212 INFO L477 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-11-18 16:50:36,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:36,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:36,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:36,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-11-18 16:50:36,351 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:36,351 INFO L477 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-11-18 16:50:36,354 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:36,354 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:36,355 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:36,355 INFO L477 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-11-18 16:50:36,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:36,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:36,369 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-11-18 16:50:36,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2018-11-18 16:50:36,465 INFO L477 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-11-18 16:50:36,467 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:36,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:36,469 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:36,469 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:36,471 INFO L477 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-11-18 16:50:36,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:36,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:36,487 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-11-18 16:50:36,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:62, output treesize:41 [2018-11-18 16:50:36,592 INFO L477 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-11-18 16:50:36,594 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:36,594 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:36,595 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:36,596 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:36,597 INFO L477 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-11-18 16:50:36,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:36,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:36,612 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-11-18 16:50:36,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2018-11-18 16:50:36,681 INFO L477 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-11-18 16:50:36,682 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:36,683 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:36,684 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:36,684 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:36,685 INFO L477 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 28 treesize of output 50 [2018-11-18 16:50:36,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:36,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:36,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:36,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:5 [2018-11-18 16:50:36,743 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 53 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 16:50:36,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:50:36,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 38 [2018-11-18 16:50:36,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-18 16:50:36,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-18 16:50:36,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1250, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 16:50:36,760 INFO L87 Difference]: Start difference. First operand 237 states and 271 transitions. Second operand 38 states. [2018-11-18 16:50:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:50:37,868 INFO L93 Difference]: Finished difference Result 437 states and 508 transitions. [2018-11-18 16:50:37,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 16:50:37,869 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 51 [2018-11-18 16:50:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:50:37,870 INFO L225 Difference]: With dead ends: 437 [2018-11-18 16:50:37,870 INFO L226 Difference]: Without dead ends: 341 [2018-11-18 16:50:37,871 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=380, Invalid=3160, Unknown=0, NotChecked=0, Total=3540 [2018-11-18 16:50:37,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-11-18 16:50:37,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 233. [2018-11-18 16:50:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-18 16:50:37,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 267 transitions. [2018-11-18 16:50:37,901 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 267 transitions. Word has length 51 [2018-11-18 16:50:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:50:37,901 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 267 transitions. [2018-11-18 16:50:37,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-18 16:50:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 267 transitions. [2018-11-18 16:50:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 16:50:37,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:50:37,902 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1] [2018-11-18 16:50:37,902 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:50:37,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:50:37,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1451238135, now seen corresponding path program 1 times [2018-11-18 16:50:37,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:50:37,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:50:37,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:37,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:37,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:50:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:38,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:50:38,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:50:38,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:50:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:50:38,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:50:38,239 INFO L477 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-11-18 16:50:38,241 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:38,243 INFO L477 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-11-18 16:50:38,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:38,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:38,253 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-11-18 16:50:38,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-18 16:50:38,448 INFO L477 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-11-18 16:50:38,450 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:38,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:50:38,451 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:50:38,455 INFO L477 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-11-18 16:50:38,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:50:38,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:38,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:50:38,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-11-18 16:50:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:50:38,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:50:38,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2018-11-18 16:50:38,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-18 16:50:38,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-18 16:50:38,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2018-11-18 16:50:38,518 INFO L87 Difference]: Start difference. First operand 233 states and 267 transitions. Second operand 32 states. [2018-11-18 16:51:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:05,496 INFO L93 Difference]: Finished difference Result 536 states and 622 transitions. [2018-11-18 16:51:05,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-18 16:51:05,496 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 54 [2018-11-18 16:51:05,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:05,498 INFO L225 Difference]: With dead ends: 536 [2018-11-18 16:51:05,498 INFO L226 Difference]: Without dead ends: 440 [2018-11-18 16:51:05,499 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=568, Invalid=4544, Unknown=0, NotChecked=0, Total=5112 [2018-11-18 16:51:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-11-18 16:51:05,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 265. [2018-11-18 16:51:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-18 16:51:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 306 transitions. [2018-11-18 16:51:05,547 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 306 transitions. Word has length 54 [2018-11-18 16:51:05,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:05,548 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 306 transitions. [2018-11-18 16:51:05,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-18 16:51:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 306 transitions. [2018-11-18 16:51:05,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-18 16:51:05,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:05,549 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:05,549 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:51:05,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:05,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1822056025, now seen corresponding path program 2 times [2018-11-18 16:51:05,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:51:05,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:51:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:05,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:06,115 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:06,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:06,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:51:06,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 16:51:06,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:51:06,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:51:06,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:06,177 INFO L477 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-11-18 16:51:06,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:06,180 INFO L477 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-11-18 16:51:06,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:06,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:06,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:06,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-11-18 16:51:06,237 INFO L477 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-11-18 16:51:06,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:06,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:06,240 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:06,242 INFO L477 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-11-18 16:51:06,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:06,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:06,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:06,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-11-18 16:51:06,291 INFO L477 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-11-18 16:51:06,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:06,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:06,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:06,297 INFO L477 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-11-18 16:51:06,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:06,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:06,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:06,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:35 [2018-11-18 16:51:06,335 INFO L477 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-11-18 16:51:06,336 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:06,337 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:06,338 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:06,340 INFO L477 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-11-18 16:51:06,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:06,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:06,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:06,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-11-18 16:51:06,367 INFO L477 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-11-18 16:51:06,382 INFO L477 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-11-18 16:51:06,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:06,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:06,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:06,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-18 16:51:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:06,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:51:06,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 25 [2018-11-18 16:51:06,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 16:51:06,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 16:51:06,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2018-11-18 16:51:06,420 INFO L87 Difference]: Start difference. First operand 265 states and 306 transitions. Second operand 25 states. [2018-11-18 16:51:07,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:07,113 INFO L93 Difference]: Finished difference Result 551 states and 648 transitions. [2018-11-18 16:51:07,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-18 16:51:07,113 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 53 [2018-11-18 16:51:07,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:07,115 INFO L225 Difference]: With dead ends: 551 [2018-11-18 16:51:07,115 INFO L226 Difference]: Without dead ends: 455 [2018-11-18 16:51:07,116 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 40 SyntacticMatches, 11 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=297, Invalid=1509, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 16:51:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-11-18 16:51:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 312. [2018-11-18 16:51:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-18 16:51:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 363 transitions. [2018-11-18 16:51:07,153 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 363 transitions. Word has length 53 [2018-11-18 16:51:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:07,153 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 363 transitions. [2018-11-18 16:51:07,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 16:51:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 363 transitions. [2018-11-18 16:51:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 16:51:07,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:07,154 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1] [2018-11-18 16:51:07,154 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:51:07,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:07,154 INFO L82 PathProgramCache]: Analyzing trace with hash 950588921, now seen corresponding path program 2 times [2018-11-18 16:51:07,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:51:07,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:51:07,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:07,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:51:07,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:07,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:07,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:51:07,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 16:51:07,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:51:07,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:51:07,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:07,722 INFO L477 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-11-18 16:51:07,724 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:07,724 INFO L477 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-11-18 16:51:07,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:07,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:07,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:07,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-11-18 16:51:07,847 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:07,848 INFO L477 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-11-18 16:51:07,850 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:07,851 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:07,851 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:07,852 INFO L477 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-11-18 16:51:07,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:07,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:07,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:07,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-18 16:51:07,931 INFO L477 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-11-18 16:51:07,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:07,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:07,934 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:07,934 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:07,936 INFO L477 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-11-18 16:51:07,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:07,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:07,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:07,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-11-18 16:51:08,099 INFO L477 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-11-18 16:51:08,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:08,100 INFO L477 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-11-18 16:51:08,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:08,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:08,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:08,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-18 16:51:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:08,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:51:08,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2018-11-18 16:51:08,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-18 16:51:08,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-18 16:51:08,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1634, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 16:51:08,191 INFO L87 Difference]: Start difference. First operand 312 states and 363 transitions. Second operand 43 states. [2018-11-18 16:51:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:08,879 INFO L93 Difference]: Finished difference Result 361 states and 416 transitions. [2018-11-18 16:51:08,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 16:51:08,880 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 54 [2018-11-18 16:51:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:08,880 INFO L225 Difference]: With dead ends: 361 [2018-11-18 16:51:08,880 INFO L226 Difference]: Without dead ends: 359 [2018-11-18 16:51:08,881 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=371, Invalid=3535, Unknown=0, NotChecked=0, Total=3906 [2018-11-18 16:51:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-11-18 16:51:08,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 312. [2018-11-18 16:51:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-18 16:51:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 363 transitions. [2018-11-18 16:51:08,913 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 363 transitions. Word has length 54 [2018-11-18 16:51:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:08,913 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 363 transitions. [2018-11-18 16:51:08,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-18 16:51:08,913 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 363 transitions. [2018-11-18 16:51:08,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 16:51:08,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:08,914 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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-11-18 16:51:08,914 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:51:08,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:08,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1822717278, now seen corresponding path program 5 times [2018-11-18 16:51:08,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:51:08,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:51:08,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:08,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:51:08,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 16:51:09,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:09,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:51:09,191 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 16:51:09,221 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-18 16:51:09,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:51:09,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:09,314 INFO L477 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-11-18 16:51:09,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 16:51:09,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:09,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:09,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:09,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-11-18 16:51:09,415 INFO L477 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-11-18 16:51:09,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:09,421 INFO L477 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-11-18 16:51:09,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:09,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:09,435 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-11-18 16:51:09,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-18 16:51:09,719 INFO L477 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-11-18 16:51:09,720 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:09,721 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:09,721 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:09,724 INFO L477 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-11-18 16:51:09,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:09,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:09,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:09,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-11-18 16:51:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 16:51:09,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:51:09,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 37 [2018-11-18 16:51:09,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-18 16:51:09,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-18 16:51:09,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1219, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 16:51:09,784 INFO L87 Difference]: Start difference. First operand 312 states and 363 transitions. Second operand 37 states. [2018-11-18 16:51:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:20,269 INFO L93 Difference]: Finished difference Result 449 states and 520 transitions. [2018-11-18 16:51:20,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 16:51:20,269 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 57 [2018-11-18 16:51:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:20,270 INFO L225 Difference]: With dead ends: 449 [2018-11-18 16:51:20,270 INFO L226 Difference]: Without dead ends: 447 [2018-11-18 16:51:20,271 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=303, Invalid=2777, Unknown=0, NotChecked=0, Total=3080 [2018-11-18 16:51:20,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-11-18 16:51:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 368. [2018-11-18 16:51:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-11-18 16:51:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 425 transitions. [2018-11-18 16:51:20,329 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 425 transitions. Word has length 57 [2018-11-18 16:51:20,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:20,329 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 425 transitions. [2018-11-18 16:51:20,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-18 16:51:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 425 transitions. [2018-11-18 16:51:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 16:51:20,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:20,330 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 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-11-18 16:51:20,330 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:51:20,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:20,330 INFO L82 PathProgramCache]: Analyzing trace with hash -672192638, now seen corresponding path program 2 times [2018-11-18 16:51:20,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:51:20,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:51:20,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:20,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:51:20,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 2 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:21,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:21,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:51:21,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 16:51:21,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:51:21,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:51:21,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:21,401 INFO L477 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-11-18 16:51:21,402 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:21,403 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,403 INFO L477 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-11-18 16:51:21,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:21,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:21,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:21,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-11-18 16:51:21,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,527 INFO L477 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-11-18 16:51:21,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,530 INFO L477 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-11-18 16:51:21,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:21,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:21,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:21,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-11-18 16:51:21,580 INFO L477 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-11-18 16:51:21,582 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:21,583 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,585 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,586 INFO L477 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-11-18 16:51:21,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:21,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:21,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:21,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-11-18 16:51:21,762 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,763 INFO L477 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-11-18 16:51:21,766 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,768 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,769 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:21,769 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,770 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:21,770 INFO L477 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 145 [2018-11-18 16:51:21,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:21,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:21,788 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-11-18 16:51:21,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:56 [2018-11-18 16:51:21,939 INFO L477 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 58 treesize of output 47 [2018-11-18 16:51:21,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,944 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,945 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:21,953 INFO L477 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 47 treesize of output 148 [2018-11-18 16:51:21,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 16:51:21,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:51:21,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-18 16:51:21,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:89 [2018-11-18 16:51:22,175 INFO L477 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-11-18 16:51:22,177 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:22,178 INFO L477 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-11-18 16:51:22,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:22,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:22,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:22,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-18 16:51:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:22,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:51:22,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 49 [2018-11-18 16:51:22,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-18 16:51:22,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-18 16:51:22,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2174, Unknown=0, NotChecked=0, Total=2352 [2018-11-18 16:51:22,281 INFO L87 Difference]: Start difference. First operand 368 states and 425 transitions. Second operand 49 states. [2018-11-18 16:51:24,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:24,369 INFO L93 Difference]: Finished difference Result 448 states and 514 transitions. [2018-11-18 16:51:24,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-18 16:51:24,370 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 58 [2018-11-18 16:51:24,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:24,371 INFO L225 Difference]: With dead ends: 448 [2018-11-18 16:51:24,372 INFO L226 Difference]: Without dead ends: 429 [2018-11-18 16:51:24,373 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 34 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1993 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=508, Invalid=5812, Unknown=0, NotChecked=0, Total=6320 [2018-11-18 16:51:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-11-18 16:51:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 331. [2018-11-18 16:51:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-11-18 16:51:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 384 transitions. [2018-11-18 16:51:24,423 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 384 transitions. Word has length 58 [2018-11-18 16:51:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:24,423 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 384 transitions. [2018-11-18 16:51:24,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-18 16:51:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 384 transitions. [2018-11-18 16:51:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 16:51:24,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:24,424 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 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, 1] [2018-11-18 16:51:24,424 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:51:24,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash 857284517, now seen corresponding path program 1 times [2018-11-18 16:51:24,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:51:24,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:51:24,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:24,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:51:24,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:24,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:24,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:51:24,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:24,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:24,848 INFO L477 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-11-18 16:51:24,850 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:24,851 INFO L477 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-11-18 16:51:24,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:24,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:24,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:24,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-11-18 16:51:24,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:24,980 INFO L477 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-11-18 16:51:24,982 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:24,982 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:24,983 INFO L477 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 58 [2018-11-18 16:51:24,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:24,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:24,996 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-11-18 16:51:24,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:32 [2018-11-18 16:51:25,193 INFO L477 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 34 treesize of output 26 [2018-11-18 16:51:25,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:25,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:25,195 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:25,196 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:25,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:25,197 INFO L477 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 26 treesize of output 44 [2018-11-18 16:51:25,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:25,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:25,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:25,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-11-18 16:51:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 9 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:25,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:51:25,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 39 [2018-11-18 16:51:25,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-18 16:51:25,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-18 16:51:25,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1352, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 16:51:25,263 INFO L87 Difference]: Start difference. First operand 331 states and 384 transitions. Second operand 39 states. [2018-11-18 16:51:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:26,721 INFO L93 Difference]: Finished difference Result 557 states and 643 transitions. [2018-11-18 16:51:26,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-18 16:51:26,722 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 60 [2018-11-18 16:51:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:26,723 INFO L225 Difference]: With dead ends: 557 [2018-11-18 16:51:26,723 INFO L226 Difference]: Without dead ends: 473 [2018-11-18 16:51:26,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=526, Invalid=5024, Unknown=0, NotChecked=0, Total=5550 [2018-11-18 16:51:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-11-18 16:51:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 346. [2018-11-18 16:51:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-11-18 16:51:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 400 transitions. [2018-11-18 16:51:26,813 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 400 transitions. Word has length 60 [2018-11-18 16:51:26,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:26,814 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 400 transitions. [2018-11-18 16:51:26,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-18 16:51:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 400 transitions. [2018-11-18 16:51:26,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 16:51:26,815 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:26,815 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 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] [2018-11-18 16:51:26,815 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:51:26,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:26,815 INFO L82 PathProgramCache]: Analyzing trace with hash 598784421, now seen corresponding path program 3 times [2018-11-18 16:51:26,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:51:26,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:51:26,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:26,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:51:26,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:27,830 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:27,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:27,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:51:27,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:51:27,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-18 16:51:27,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:51:27,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:27,976 INFO L477 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-11-18 16:51:27,977 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:27,979 INFO L477 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-11-18 16:51:27,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:27,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:27,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:27,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-18 16:51:28,030 INFO L477 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-11-18 16:51:28,033 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,034 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,051 INFO L477 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 85 [2018-11-18 16:51:28,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-18 16:51:28,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:51:28,078 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 2 xjuncts. [2018-11-18 16:51:28,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:86 [2018-11-18 16:51:28,306 INFO L477 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-11-18 16:51:28,308 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,309 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,312 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,313 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 160 [2018-11-18 16:51:28,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-18 16:51:28,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:51:28,382 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 2 xjuncts. [2018-11-18 16:51:28,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:118 [2018-11-18 16:51:28,655 INFO L477 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-11-18 16:51:28,657 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,657 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,658 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,659 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,660 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:28,665 INFO L477 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 43 treesize of output 105 [2018-11-18 16:51:28,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:28,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:28,680 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-11-18 16:51:28,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:40 [2018-11-18 16:51:28,786 INFO L477 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-11-18 16:51:28,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,790 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:28,792 INFO L477 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-11-18 16:51:28,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:28,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:28,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:28,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:23 [2018-11-18 16:51:28,973 INFO L477 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-11-18 16:51:28,975 INFO L477 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-11-18 16:51:28,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:28,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:28,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:28,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-18 16:51:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:29,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:51:29,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 48 [2018-11-18 16:51:29,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-18 16:51:29,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-18 16:51:29,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2075, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 16:51:29,058 INFO L87 Difference]: Start difference. First operand 346 states and 400 transitions. Second operand 48 states. [2018-11-18 16:51:41,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:41,332 INFO L93 Difference]: Finished difference Result 523 states and 591 transitions. [2018-11-18 16:51:41,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-18 16:51:41,333 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 60 [2018-11-18 16:51:41,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:41,334 INFO L225 Difference]: With dead ends: 523 [2018-11-18 16:51:41,334 INFO L226 Difference]: Without dead ends: 521 [2018-11-18 16:51:41,335 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2050 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=594, Invalid=6212, Unknown=0, NotChecked=0, Total=6806 [2018-11-18 16:51:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-11-18 16:51:41,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 378. [2018-11-18 16:51:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-11-18 16:51:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 437 transitions. [2018-11-18 16:51:41,415 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 437 transitions. Word has length 60 [2018-11-18 16:51:41,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:41,416 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 437 transitions. [2018-11-18 16:51:41,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-18 16:51:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 437 transitions. [2018-11-18 16:51:41,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 16:51:41,417 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:41,417 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:41,417 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:51:41,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:41,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1672436667, now seen corresponding path program 2 times [2018-11-18 16:51:41,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:51:41,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:51:41,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:41,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:51:41,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:41,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:41,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:51:41,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 16:51:42,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:51:42,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:51:42,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:42,060 INFO L477 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-11-18 16:51:42,062 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:42,062 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,063 INFO L477 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-11-18 16:51:42,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-11-18 16:51:42,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,200 INFO L477 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-11-18 16:51:42,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,204 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:51:42,204 INFO L477 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-11-18 16:51:42,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-18 16:51:42,255 INFO L477 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 35 treesize of output 28 [2018-11-18 16:51:42,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,259 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,260 INFO L477 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 28 treesize of output 81 [2018-11-18 16:51:42,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:28 [2018-11-18 16:51:42,328 INFO L477 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-11-18 16:51:42,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,333 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,334 INFO L477 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-11-18 16:51:42,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:33 [2018-11-18 16:51:42,385 INFO L477 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-11-18 16:51:42,387 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,387 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,389 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,391 INFO L477 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-11-18 16:51:42,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2018-11-18 16:51:42,418 INFO L477 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-11-18 16:51:42,420 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:42,420 INFO L477 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-11-18 16:51:42,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:42,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-18 16:51:42,447 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 6 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:42,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:51:42,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 33 [2018-11-18 16:51:42,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-18 16:51:42,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-18 16:51:42,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 16:51:42,465 INFO L87 Difference]: Start difference. First operand 378 states and 437 transitions. Second operand 33 states. [2018-11-18 16:51:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:51:43,727 INFO L93 Difference]: Finished difference Result 605 states and 707 transitions. [2018-11-18 16:51:43,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-18 16:51:43,727 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 59 [2018-11-18 16:51:43,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:51:43,729 INFO L225 Difference]: With dead ends: 605 [2018-11-18 16:51:43,729 INFO L226 Difference]: Without dead ends: 521 [2018-11-18 16:51:43,730 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 42 SyntacticMatches, 11 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=441, Invalid=3219, Unknown=0, NotChecked=0, Total=3660 [2018-11-18 16:51:43,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-11-18 16:51:43,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 339. [2018-11-18 16:51:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-11-18 16:51:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 388 transitions. [2018-11-18 16:51:43,805 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 388 transitions. Word has length 59 [2018-11-18 16:51:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:51:43,806 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 388 transitions. [2018-11-18 16:51:43,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-18 16:51:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 388 transitions. [2018-11-18 16:51:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 16:51:43,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:51:43,807 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:51:43,807 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:51:43,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:51:43,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1170062406, now seen corresponding path program 2 times [2018-11-18 16:51:43,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:51:43,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:51:43,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:43,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:51:43,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:51:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:51:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 3 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:44,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:51:44,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:51:44,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 16:51:44,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:51:44,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:51:44,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:51:44,493 INFO L477 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-11-18 16:51:44,495 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:44,496 INFO L477 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-11-18 16:51:44,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:44,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:44,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:44,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-18 16:51:44,566 INFO L477 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-11-18 16:51:44,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:44,569 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:44,569 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:44,572 INFO L477 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-11-18 16:51:44,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:44,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:44,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:44,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2018-11-18 16:51:44,643 INFO L477 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-11-18 16:51:44,646 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:44,649 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:44,650 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:51:44,652 INFO L477 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-11-18 16:51:44,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:44,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:44,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:44,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-11-18 16:51:44,852 INFO L477 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-11-18 16:51:44,854 INFO L477 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-11-18 16:51:44,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:51:44,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:44,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:51:44,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-18 16:51:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:51:44,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:51:44,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2018-11-18 16:51:44,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-18 16:51:44,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-18 16:51:44,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1409, Unknown=0, NotChecked=0, Total=1560 [2018-11-18 16:51:44,919 INFO L87 Difference]: Start difference. First operand 339 states and 388 transitions. Second operand 40 states. [2018-11-18 16:52:06,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:52:06,065 INFO L93 Difference]: Finished difference Result 539 states and 611 transitions. [2018-11-18 16:52:06,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-18 16:52:06,066 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 62 [2018-11-18 16:52:06,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:52:06,066 INFO L225 Difference]: With dead ends: 539 [2018-11-18 16:52:06,067 INFO L226 Difference]: Without dead ends: 537 [2018-11-18 16:52:06,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2335 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=876, Invalid=6606, Unknown=0, NotChecked=0, Total=7482 [2018-11-18 16:52:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-11-18 16:52:06,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 370. [2018-11-18 16:52:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-18 16:52:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 422 transitions. [2018-11-18 16:52:06,144 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 422 transitions. Word has length 62 [2018-11-18 16:52:06,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:52:06,144 INFO L480 AbstractCegarLoop]: Abstraction has 370 states and 422 transitions. [2018-11-18 16:52:06,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-18 16:52:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 422 transitions. [2018-11-18 16:52:06,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 16:52:06,145 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:52:06,145 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 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-11-18 16:52:06,145 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:52:06,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:52:06,145 INFO L82 PathProgramCache]: Analyzing trace with hash 356511798, now seen corresponding path program 3 times [2018-11-18 16:52:06,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:52:06,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:52:06,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:52:06,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:52:06,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:52:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:52:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 57 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 16:52:06,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:52:06,362 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:52:06,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:52:06,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 16:52:06,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:52:06,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:52:06,528 INFO L477 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 24 [2018-11-18 16:52:06,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:06,531 INFO L477 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 24 treesize of output 39 [2018-11-18 16:52:06,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:06,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:06,539 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-11-18 16:52:06,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-18 16:52:06,735 INFO L477 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 34 treesize of output 26 [2018-11-18 16:52:06,737 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:06,737 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:06,738 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:06,741 INFO L477 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 26 treesize of output 32 [2018-11-18 16:52:06,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:06,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:06,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:06,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:3 [2018-11-18 16:52:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:52:06,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:52:06,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-11-18 16:52:06,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 16:52:06,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 16:52:06,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2018-11-18 16:52:06,797 INFO L87 Difference]: Start difference. First operand 370 states and 422 transitions. Second operand 29 states. [2018-11-18 16:52:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:52:22,346 INFO L93 Difference]: Finished difference Result 484 states and 551 transitions. [2018-11-18 16:52:22,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-18 16:52:22,346 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 63 [2018-11-18 16:52:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:52:22,348 INFO L225 Difference]: With dead ends: 484 [2018-11-18 16:52:22,348 INFO L226 Difference]: Without dead ends: 482 [2018-11-18 16:52:22,348 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=265, Invalid=2285, Unknown=0, NotChecked=0, Total=2550 [2018-11-18 16:52:22,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-11-18 16:52:22,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 370. [2018-11-18 16:52:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-18 16:52:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 422 transitions. [2018-11-18 16:52:22,427 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 422 transitions. Word has length 63 [2018-11-18 16:52:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:52:22,427 INFO L480 AbstractCegarLoop]: Abstraction has 370 states and 422 transitions. [2018-11-18 16:52:22,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 16:52:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 422 transitions. [2018-11-18 16:52:22,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 16:52:22,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:52:22,428 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:52:22,428 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:52:22,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:52:22,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1574570106, now seen corresponding path program 4 times [2018-11-18 16:52:22,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:52:22,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:52:22,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:52:22,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:52:22,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:52:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:52:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 1 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:52:22,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:52:22,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:52:22,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 16:52:22,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 16:52:22,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:52:22,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:52:23,017 INFO L477 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-11-18 16:52:23,019 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:23,023 INFO L477 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-11-18 16:52:23,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:23,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:23,035 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-11-18 16:52:23,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-11-18 16:52:23,116 INFO L477 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-11-18 16:52:23,118 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:23,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:23,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:23,122 INFO L477 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 27 treesize of output 64 [2018-11-18 16:52:23,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:23,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:23,132 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-11-18 16:52:23,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-11-18 16:52:23,321 INFO L477 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-11-18 16:52:23,322 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:23,323 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:23,323 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:23,323 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:23,326 INFO L477 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-11-18 16:52:23,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:23,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:23,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:23,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-11-18 16:52:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 4 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:52:23,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:52:23,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2018-11-18 16:52:23,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-18 16:52:23,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-18 16:52:23,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1267, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 16:52:23,388 INFO L87 Difference]: Start difference. First operand 370 states and 422 transitions. Second operand 38 states. [2018-11-18 16:52:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:52:54,438 INFO L93 Difference]: Finished difference Result 779 states and 911 transitions. [2018-11-18 16:52:54,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-11-18 16:52:54,438 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 62 [2018-11-18 16:52:54,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:52:54,439 INFO L225 Difference]: With dead ends: 779 [2018-11-18 16:52:54,439 INFO L226 Difference]: Without dead ends: 674 [2018-11-18 16:52:54,440 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2029 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=826, Invalid=6146, Unknown=0, NotChecked=0, Total=6972 [2018-11-18 16:52:54,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-11-18 16:52:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 486. [2018-11-18 16:52:54,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-11-18 16:52:54,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 557 transitions. [2018-11-18 16:52:54,538 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 557 transitions. Word has length 62 [2018-11-18 16:52:54,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:52:54,539 INFO L480 AbstractCegarLoop]: Abstraction has 486 states and 557 transitions. [2018-11-18 16:52:54,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-18 16:52:54,539 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 557 transitions. [2018-11-18 16:52:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 16:52:54,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:52:54,540 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:52:54,540 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:52:54,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:52:54,540 INFO L82 PathProgramCache]: Analyzing trace with hash -562788216, now seen corresponding path program 3 times [2018-11-18 16:52:54,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:52:54,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:52:54,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:52:54,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:52:54,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:52:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:52:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 1 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:52:54,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:52:54,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:52:54,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 16:52:54,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-18 16:52:54,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:52:54,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:52:55,040 INFO L477 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-11-18 16:52:55,041 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:55,042 INFO L477 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-11-18 16:52:55,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:55,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:55,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:55,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-18 16:52:55,208 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:55,208 INFO L477 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-11-18 16:52:55,210 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:55,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:55,212 INFO L477 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 58 [2018-11-18 16:52:55,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:55,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:55,236 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-11-18 16:52:55,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:32 [2018-11-18 16:52:55,396 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:55,396 INFO L477 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 52 [2018-11-18 16:52:55,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:55,400 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:55,404 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:55,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 52 treesize of output 101 [2018-11-18 16:52:55,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-18 16:52:55,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:55,437 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-11-18 16:52:55,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:35 [2018-11-18 16:52:55,532 INFO L477 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 48 treesize of output 39 [2018-11-18 16:52:55,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:55,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:55,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:55,544 INFO L477 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 3 case distinctions, treesize of input 39 treesize of output 76 [2018-11-18 16:52:55,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:55,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:55,553 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-11-18 16:52:55,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:32 [2018-11-18 16:52:55,737 INFO L477 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 34 treesize of output 26 [2018-11-18 16:52:55,739 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:55,739 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:55,740 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:55,740 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:52:55,741 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:52:55,741 INFO L477 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 26 treesize of output 44 [2018-11-18 16:52:55,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:52:55,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:55,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:52:55,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-11-18 16:52:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 43 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 16:52:55,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:52:55,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2018-11-18 16:52:55,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-18 16:52:55,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-18 16:52:55,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1805, Unknown=0, NotChecked=0, Total=1980 [2018-11-18 16:52:55,815 INFO L87 Difference]: Start difference. First operand 486 states and 557 transitions. Second operand 45 states. [2018-11-18 16:53:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:00,195 INFO L93 Difference]: Finished difference Result 691 states and 791 transitions. [2018-11-18 16:53:00,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-11-18 16:53:00,196 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 62 [2018-11-18 16:53:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:00,198 INFO L225 Difference]: With dead ends: 691 [2018-11-18 16:53:00,198 INFO L226 Difference]: Without dead ends: 689 [2018-11-18 16:53:00,199 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5722 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1527, Invalid=14985, Unknown=0, NotChecked=0, Total=16512 [2018-11-18 16:53:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-11-18 16:53:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 524. [2018-11-18 16:53:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-11-18 16:53:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 604 transitions. [2018-11-18 16:53:00,310 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 604 transitions. Word has length 62 [2018-11-18 16:53:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:00,310 INFO L480 AbstractCegarLoop]: Abstraction has 524 states and 604 transitions. [2018-11-18 16:53:00,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-18 16:53:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 604 transitions. [2018-11-18 16:53:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 16:53:00,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:00,311 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:00,312 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:00,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash -665388821, now seen corresponding path program 6 times [2018-11-18 16:53:00,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:00,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:00,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:00,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:53:00,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 16:53:00,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:53:00,442 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:53:00,458 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 16:53:00,492 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-18 16:53:00,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:53:00,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:00,583 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 16:53:00,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:53:00,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-11-18 16:53:00,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 16:53:00,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 16:53:00,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:53:00,601 INFO L87 Difference]: Start difference. First operand 524 states and 604 transitions. Second operand 15 states. [2018-11-18 16:53:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:00,865 INFO L93 Difference]: Finished difference Result 701 states and 808 transitions. [2018-11-18 16:53:00,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:53:00,865 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2018-11-18 16:53:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:00,867 INFO L225 Difference]: With dead ends: 701 [2018-11-18 16:53:00,867 INFO L226 Difference]: Without dead ends: 606 [2018-11-18 16:53:00,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-11-18 16:53:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-11-18 16:53:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 494. [2018-11-18 16:53:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-11-18 16:53:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 569 transitions. [2018-11-18 16:53:00,962 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 569 transitions. Word has length 66 [2018-11-18 16:53:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:00,963 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 569 transitions. [2018-11-18 16:53:00,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 16:53:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 569 transitions. [2018-11-18 16:53:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-18 16:53:00,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:00,963 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:00,963 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:00,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:00,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1152334579, now seen corresponding path program 7 times [2018-11-18 16:53:00,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:00,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:00,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:00,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:53:00,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 3 proven. 71 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 16:53:01,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:53:01,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:53:01,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:01,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:01,430 INFO L477 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-11-18 16:53:01,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 16:53:01,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-18 16:53:01,530 INFO L477 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-11-18 16:53:01,532 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:01,533 INFO L477 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-11-18 16:53:01,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-18 16:53:01,619 INFO L477 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-11-18 16:53:01,621 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:01,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:01,623 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:01,626 INFO L477 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-11-18 16:53:01,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-18 16:53:01,861 INFO L477 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-11-18 16:53:01,863 INFO L477 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-11-18 16:53:01,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:01,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-18 16:53:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 16:53:01,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:53:01,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2018-11-18 16:53:01,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-18 16:53:01,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-18 16:53:01,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 16:53:01,920 INFO L87 Difference]: Start difference. First operand 494 states and 569 transitions. Second operand 39 states. [2018-11-18 16:53:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:12,107 INFO L93 Difference]: Finished difference Result 611 states and 700 transitions. [2018-11-18 16:53:12,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-18 16:53:12,107 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 65 [2018-11-18 16:53:12,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:12,109 INFO L225 Difference]: With dead ends: 611 [2018-11-18 16:53:12,109 INFO L226 Difference]: Without dead ends: 607 [2018-11-18 16:53:12,110 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=366, Invalid=2940, Unknown=0, NotChecked=0, Total=3306 [2018-11-18 16:53:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-11-18 16:53:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 531. [2018-11-18 16:53:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-11-18 16:53:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 610 transitions. [2018-11-18 16:53:12,219 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 610 transitions. Word has length 65 [2018-11-18 16:53:12,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:12,219 INFO L480 AbstractCegarLoop]: Abstraction has 531 states and 610 transitions. [2018-11-18 16:53:12,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-18 16:53:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 610 transitions. [2018-11-18 16:53:12,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 16:53:12,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:12,221 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 3, 3, 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-11-18 16:53:12,221 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:12,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:12,221 INFO L82 PathProgramCache]: Analyzing trace with hash -510863599, now seen corresponding path program 1 times [2018-11-18 16:53:12,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:12,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:12,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:12,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:12,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 1 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:53:12,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:53:12,827 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:53:12,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:12,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:12,989 INFO L477 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-11-18 16:53:12,991 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:12,992 INFO L477 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-11-18 16:53:12,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:12,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,001 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-11-18 16:53:13,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-11-18 16:53:13,054 INFO L477 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 50 treesize of output 43 [2018-11-18 16:53:13,090 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,091 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,091 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,093 INFO L477 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 46 treesize of output 83 [2018-11-18 16:53:13,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,095 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 16:53:13,095 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,096 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 16:53:13,096 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,097 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 16:53:13,097 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,110 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:68, output treesize:26 [2018-11-18 16:53:13,166 INFO L477 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-11-18 16:53:13,179 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:13,180 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,184 INFO L477 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-11-18 16:53:13,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,185 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 16:53:13,186 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,196 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:64, output treesize:44 [2018-11-18 16:53:13,296 INFO L477 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-11-18 16:53:13,298 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,299 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,299 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,300 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:13,300 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,301 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,301 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:13,305 INFO L477 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-11-18 16:53:13,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,319 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-11-18 16:53:13,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:47 [2018-11-18 16:53:13,434 INFO L477 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-11-18 16:53:13,436 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,437 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,438 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,439 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,440 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:13,448 INFO L477 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-11-18 16:53:13,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 16:53:13,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 16:53:13,483 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-11-18 16:53:13,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:83 [2018-11-18 16:53:13,624 INFO L477 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-11-18 16:53:13,625 INFO L477 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-11-18 16:53:13,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:13,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-18 16:53:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 11 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:53:13,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:53:13,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30] total 45 [2018-11-18 16:53:13,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-18 16:53:13,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-18 16:53:13,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1791, Unknown=0, NotChecked=0, Total=1980 [2018-11-18 16:53:13,696 INFO L87 Difference]: Start difference. First operand 531 states and 610 transitions. Second operand 45 states. [2018-11-18 16:53:26,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:26,821 INFO L93 Difference]: Finished difference Result 826 states and 943 transitions. [2018-11-18 16:53:26,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-18 16:53:26,821 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 66 [2018-11-18 16:53:26,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:26,823 INFO L225 Difference]: With dead ends: 826 [2018-11-18 16:53:26,823 INFO L226 Difference]: Without dead ends: 824 [2018-11-18 16:53:26,824 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 38 SyntacticMatches, 16 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2265 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=633, Invalid=6173, Unknown=0, NotChecked=0, Total=6806 [2018-11-18 16:53:26,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2018-11-18 16:53:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 664. [2018-11-18 16:53:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-11-18 16:53:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 757 transitions. [2018-11-18 16:53:27,010 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 757 transitions. Word has length 66 [2018-11-18 16:53:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:27,010 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 757 transitions. [2018-11-18 16:53:27,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-18 16:53:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 757 transitions. [2018-11-18 16:53:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 16:53:27,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:27,011 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1] [2018-11-18 16:53:27,011 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:27,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:27,012 INFO L82 PathProgramCache]: Analyzing trace with hash -679919343, now seen corresponding path program 4 times [2018-11-18 16:53:27,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:27,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:27,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:27,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:53:27,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 7 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:53:28,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:53:28,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:53:28,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 16:53:28,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 16:53:28,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:53:28,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:28,376 INFO L477 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-11-18 16:53:28,377 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:28,378 INFO L477 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-11-18 16:53:28,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:28,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:28,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:28,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-11-18 16:53:28,520 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:28,521 INFO L477 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-11-18 16:53:28,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:28,523 INFO L477 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-11-18 16:53:28,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:28,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:28,535 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-11-18 16:53:28,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:41 [2018-11-18 16:53:28,557 INFO L477 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-11-18 16:53:28,561 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:28,564 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:28,569 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:28,581 INFO L477 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-11-18 16:53:28,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-18 16:53:28,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:53:28,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 16:53:28,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:137 [2018-11-18 16:53:28,859 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:28,859 INFO L477 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-11-18 16:53:28,862 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:28,862 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:28,863 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:28,864 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:28,864 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:28,865 INFO L477 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 67 treesize of output 132 [2018-11-18 16:53:28,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:28,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:28,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:28,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:58 [2018-11-18 16:53:28,957 INFO L477 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 50 [2018-11-18 16:53:28,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:28,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:28,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:28,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:28,963 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 103 [2018-11-18 16:53:28,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:28,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:28,977 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-11-18 16:53:28,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:41 [2018-11-18 16:53:29,063 INFO L477 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-11-18 16:53:29,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:29,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:29,066 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:29,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:29,068 INFO L477 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 31 treesize of output 92 [2018-11-18 16:53:29,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:29,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:29,080 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-11-18 16:53:29,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:44 [2018-11-18 16:53:29,261 INFO L477 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-11-18 16:53:29,263 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:29,263 INFO L477 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-11-18 16:53:29,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:29,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:29,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:29,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-18 16:53:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 8 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:53:29,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:53:29,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 53 [2018-11-18 16:53:29,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-18 16:53:29,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-18 16:53:29,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=2499, Unknown=0, NotChecked=0, Total=2756 [2018-11-18 16:53:29,347 INFO L87 Difference]: Start difference. First operand 664 states and 757 transitions. Second operand 53 states. [2018-11-18 16:53:31,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:53:31,449 INFO L93 Difference]: Finished difference Result 727 states and 823 transitions. [2018-11-18 16:53:31,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-18 16:53:31,450 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 66 [2018-11-18 16:53:31,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:53:31,451 INFO L225 Difference]: With dead ends: 727 [2018-11-18 16:53:31,451 INFO L226 Difference]: Without dead ends: 710 [2018-11-18 16:53:31,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=666, Invalid=6644, Unknown=0, NotChecked=0, Total=7310 [2018-11-18 16:53:31,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-11-18 16:53:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 604. [2018-11-18 16:53:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-11-18 16:53:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 691 transitions. [2018-11-18 16:53:31,594 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 691 transitions. Word has length 66 [2018-11-18 16:53:31,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:53:31,595 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 691 transitions. [2018-11-18 16:53:31,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-18 16:53:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 691 transitions. [2018-11-18 16:53:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 16:53:31,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:53:31,596 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:53:31,596 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:53:31,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:53:31,597 INFO L82 PathProgramCache]: Analyzing trace with hash -255924238, now seen corresponding path program 5 times [2018-11-18 16:53:31,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:53:31,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:53:31,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:31,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:53:31,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:53:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:53:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 1 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:53:31,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:53:31,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/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-11-18 16:53:31,841 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 16:53:31,864 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-18 16:53:31,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:53:31,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:53:31,953 INFO L477 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-11-18 16:53:31,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 16:53:31,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:31,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:31,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:31,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-11-18 16:53:32,020 INFO L477 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-11-18 16:53:32,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 16:53:32,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:32,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:32,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:32,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-11-18 16:53:32,065 INFO L477 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-11-18 16:53:32,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-18 16:53:32,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:32,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:32,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:32,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:10 [2018-11-18 16:53:32,201 INFO L477 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-11-18 16:53:32,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:32,204 INFO L477 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-11-18 16:53:32,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:32,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:32,213 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-11-18 16:53:32,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-18 16:53:32,436 INFO L477 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-11-18 16:53:32,437 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:32,438 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 16:53:32,438 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 16:53:32,441 INFO L477 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-11-18 16:53:32,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 16:53:32,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:32,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 16:53:32,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-11-18 16:53:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:53:32,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:53:32,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 41 [2018-11-18 16:53:32,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-18 16:53:32,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-18 16:53:32,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1513, Unknown=0, NotChecked=0, Total=1640 [2018-11-18 16:53:32,505 INFO L87 Difference]: Start difference. First operand 604 states and 691 transitions. Second operand 41 states. [2018-11-18 16:54:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:54:04,958 INFO L93 Difference]: Finished difference Result 1319 states and 1529 transitions. [2018-11-18 16:54:04,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-18 16:54:04,958 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 68 [2018-11-18 16:54:04,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:54:04,961 INFO L225 Difference]: With dead ends: 1319 [2018-11-18 16:54:04,961 INFO L226 Difference]: Without dead ends: 1166 [2018-11-18 16:54:04,962 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2963 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=745, Invalid=8761, Unknown=0, NotChecked=0, Total=9506 [2018-11-18 16:54:04,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2018-11-18 16:54:05,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 690. [2018-11-18 16:54:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-11-18 16:54:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 795 transitions. [2018-11-18 16:54:05,125 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 795 transitions. Word has length 68 [2018-11-18 16:54:05,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:54:05,125 INFO L480 AbstractCegarLoop]: Abstraction has 690 states and 795 transitions. [2018-11-18 16:54:05,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-18 16:54:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 795 transitions. [2018-11-18 16:54:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 16:54:05,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:54:05,126 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 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-11-18 16:54:05,126 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:54:05,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:54:05,127 INFO L82 PathProgramCache]: Analyzing trace with hash 955078472, now seen corresponding path program 2 times [2018-11-18 16:54:05,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:54:05,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:54:05,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:54:05,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:54:05,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:54:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:54:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:54:05,181 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 16:54:05,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:54:05 BoogieIcfgContainer [2018-11-18 16:54:05,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:54:05,216 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:54:05,216 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:54:05,216 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:54:05,217 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:49:43" (3/4) ... [2018-11-18 16:54:05,219 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 16:54:05,272 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b88055d9-b405-4efc-a5e1-28c82fdf0e6a/bin-2019/uautomizer/witness.graphml [2018-11-18 16:54:05,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:54:05,273 INFO L168 Benchmark]: Toolchain (without parser) took 262459.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 958.5 MB in the beginning and 914.0 MB in the end (delta: 44.5 MB). Peak memory consumption was 256.8 MB. Max. memory is 11.5 GB. [2018-11-18 16:54:05,273 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:54:05,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.58 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 947.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:54:05,274 INFO L168 Benchmark]: Boogie Preprocessor took 31.86 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:54:05,274 INFO L168 Benchmark]: RCFGBuilder took 373.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 945.0 MB in the beginning and 1.2 GB in the end (delta: -212.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 16:54:05,274 INFO L168 Benchmark]: TraceAbstraction took 261757.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 37.7 MB). Free memory was 1.2 GB in the beginning and 914.0 MB in the end (delta: 243.8 MB). Peak memory consumption was 281.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:54:05,274 INFO L168 Benchmark]: Witness Printer took 55.99 ms. Allocated memory is still 1.2 GB. Free memory is still 914.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:54:05,275 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 236.58 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 947.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.86 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 373.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 945.0 MB in the beginning and 1.2 GB in the end (delta: -212.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 261757.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 37.7 MB). Free memory was 1.2 GB in the beginning and 914.0 MB in the end (delta: 243.8 MB). Peak memory consumption was 281.5 MB. Max. memory is 11.5 GB. * Witness Printer took 55.99 ms. Allocated memory is still 1.2 GB. Free memory is still 914.0 MB. There was no memory consumed. 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] FCALL int v[SIZE]; [L14] j=1 VAL [j=1, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=1, k=-3, SIZE=4, v={4294967302:0}, v[i]=-10] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] FCALL v[i+1] = key VAL [i=0, j=1, k=-3, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=0, j=2, k=-3, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=1, j=2, k=-2, SIZE=4, v={4294967302:0}, v[i]=-3] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] FCALL v[i+1] = key VAL [i=1, j=2, k=-2, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=1, j=3, k=-2, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=2, j=3, k=-6, SIZE=4, v={4294967302:0}, v[i]=-2] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) VAL [i=2, j=3, k=-6, SIZE=4, v={4294967302:0}] [L20] i = i - 1 VAL [i=1, j=3, k=-6, SIZE=4, v={4294967302:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=1, j=3, k=-6, SIZE=4, v={4294967302:0}, v[i]=-3] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR, FCALL v[i] [L19] FCALL v[i+1] = v[i] [L20] i = i - 1 VAL [i=0, j=3, k=-6, SIZE=4, v={4294967302:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=3, k=-6, SIZE=4, v={4294967302:0}, v[i]=-10] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] FCALL v[i+1] = key VAL [i=0, j=3, k=-6, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=0, j=4, k=-6, SIZE=4, v={4294967302:0}] [L14] COND FALSE !(j