./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/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 e5083763cd1026dac92f37bc5a05779baf01a71b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0cd3be1 [2018-11-28 13:17:31,028 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:17:31,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:17:31,038 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:17:31,038 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:17:31,039 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:17:31,040 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:17:31,041 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:17:31,042 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:17:31,043 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:17:31,043 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:17:31,043 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:17:31,044 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:17:31,045 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:17:31,046 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:17:31,047 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:17:31,047 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:17:31,048 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:17:31,050 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:17:31,051 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:17:31,052 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:17:31,053 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:17:31,055 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:17:31,055 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:17:31,055 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:17:31,056 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:17:31,056 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:17:31,057 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:17:31,058 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:17:31,059 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:17:31,059 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:17:31,060 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:17:31,060 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:17:31,060 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:17:31,061 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:17:31,061 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:17:31,061 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:17:31,072 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:17:31,072 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:17:31,073 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:17:31,073 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:17:31,074 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:17:31,074 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:17:31,074 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:17:31,074 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:17:31,075 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:17:31,075 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:17:31,075 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:17:31,075 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:17:31,075 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:17:31,075 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:17:31,075 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:17:31,075 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:17:31,076 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:17:31,076 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:17:31,076 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:17:31,076 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:17:31,078 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:17:31,078 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:17:31,078 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:17:31,078 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:17:31,078 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:17:31,078 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:17:31,078 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:17:31,079 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:17:31,079 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:17:31,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:17:31,079 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_e436e53e-997a-4953-96b4-ca3df75b42c7/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 -> e5083763cd1026dac92f37bc5a05779baf01a71b [2018-11-28 13:17:31,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:17:31,113 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:17:31,116 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:17:31,117 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:17:31,117 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:17:31,117 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-28 13:17:31,164 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/bin-2019/uautomizer/data/14bc784ab/5161ced8abd649b7b2f6a5d89a640fdc/FLAG55173793a [2018-11-28 13:17:31,507 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:17:31,507 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-28 13:17:31,514 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/bin-2019/uautomizer/data/14bc784ab/5161ced8abd649b7b2f6a5d89a640fdc/FLAG55173793a [2018-11-28 13:17:31,524 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/bin-2019/uautomizer/data/14bc784ab/5161ced8abd649b7b2f6a5d89a640fdc [2018-11-28 13:17:31,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:17:31,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:17:31,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:17:31,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:17:31,531 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:17:31,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:17:31" (1/1) ... [2018-11-28 13:17:31,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dbbec04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:31, skipping insertion in model container [2018-11-28 13:17:31,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:17:31" (1/1) ... [2018-11-28 13:17:31,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:17:31,565 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:17:31,750 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:17:31,795 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:17:31,832 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:17:31,864 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:17:31,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:31 WrapperNode [2018-11-28 13:17:31,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:17:31,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:17:31,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:17:31,865 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:17:31,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:31" (1/1) ... [2018-11-28 13:17:31,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:31" (1/1) ... [2018-11-28 13:17:31,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:17:31,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:17:31,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:17:31,888 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:17:31,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:31" (1/1) ... [2018-11-28 13:17:31,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:31" (1/1) ... [2018-11-28 13:17:31,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:31" (1/1) ... [2018-11-28 13:17:31,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:31" (1/1) ... [2018-11-28 13:17:31,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:31" (1/1) ... [2018-11-28 13:17:31,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:31" (1/1) ... [2018-11-28 13:17:31,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:31" (1/1) ... [2018-11-28 13:17:31,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:17:31,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:17:31,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:17:31,920 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:17:31,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/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-28 13:17:31,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:17:31,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:17:31,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:17:31,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:17:31,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:17:31,953 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:17:31,953 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:17:31,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 13:17:31,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:17:31,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:17:31,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:17:31,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:17:32,266 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:17:32,266 INFO L280 CfgBuilder]: Removed 31 assue(true) statements. [2018-11-28 13:17:32,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:17:32 BoogieIcfgContainer [2018-11-28 13:17:32,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:17:32,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:17:32,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:17:32,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:17:32,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:17:31" (1/3) ... [2018-11-28 13:17:32,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5078a6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:17:32, skipping insertion in model container [2018-11-28 13:17:32,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:31" (2/3) ... [2018-11-28 13:17:32,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5078a6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:17:32, skipping insertion in model container [2018-11-28 13:17:32,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:17:32" (3/3) ... [2018-11-28 13:17:32,277 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-28 13:17:32,285 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:17:32,291 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-11-28 13:17:32,303 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-11-28 13:17:32,321 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:17:32,321 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:17:32,321 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:17:32,321 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:17:32,321 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:17:32,321 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:17:32,322 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:17:32,322 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:17:32,322 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:17:32,334 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-11-28 13:17:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 13:17:32,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:32,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:32,342 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:32,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:32,347 INFO L82 PathProgramCache]: Analyzing trace with hash 786723767, now seen corresponding path program 1 times [2018-11-28 13:17:32,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:32,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:32,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:32,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:32,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:32,432 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-28 13:17:32,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:32,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:17:32,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 13:17:32,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 13:17:32,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 13:17:32,445 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 2 states. [2018-11-28 13:17:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:32,464 INFO L93 Difference]: Finished difference Result 174 states and 284 transitions. [2018-11-28 13:17:32,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 13:17:32,465 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-28 13:17:32,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:32,473 INFO L225 Difference]: With dead ends: 174 [2018-11-28 13:17:32,473 INFO L226 Difference]: Without dead ends: 84 [2018-11-28 13:17:32,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 13:17:32,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-28 13:17:32,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-28 13:17:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-28 13:17:32,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-11-28 13:17:32,502 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 9 [2018-11-28 13:17:32,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:32,502 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-11-28 13:17:32,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 13:17:32,503 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-11-28 13:17:32,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 13:17:32,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:32,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:32,504 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:32,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:32,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1383122703, now seen corresponding path program 1 times [2018-11-28 13:17:32,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:32,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:32,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:32,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:32,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:32,545 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-28 13:17:32,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:32,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:32,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:32,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:32,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:32,548 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 3 states. [2018-11-28 13:17:32,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:32,582 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2018-11-28 13:17:32,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:32,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 13:17:32,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:32,583 INFO L225 Difference]: With dead ends: 84 [2018-11-28 13:17:32,583 INFO L226 Difference]: Without dead ends: 74 [2018-11-28 13:17:32,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:32,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-28 13:17:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-28 13:17:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-28 13:17:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-11-28 13:17:32,590 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 10 [2018-11-28 13:17:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:32,590 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-11-28 13:17:32,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-28 13:17:32,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 13:17:32,591 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:32,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:32,592 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:32,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:32,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1313288485, now seen corresponding path program 1 times [2018-11-28 13:17:32,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:32,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:32,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:32,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:32,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:32,630 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-28 13:17:32,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:32,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:32,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:32,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:32,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:32,630 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 3 states. [2018-11-28 13:17:32,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:32,650 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-28 13:17:32,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:32,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-28 13:17:32,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:32,651 INFO L225 Difference]: With dead ends: 74 [2018-11-28 13:17:32,651 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 13:17:32,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 13:17:32,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-28 13:17:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 13:17:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-11-28 13:17:32,656 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 13 [2018-11-28 13:17:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:32,656 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-11-28 13:17:32,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-11-28 13:17:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 13:17:32,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:32,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:32,657 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:32,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:32,657 INFO L82 PathProgramCache]: Analyzing trace with hash -577581690, now seen corresponding path program 1 times [2018-11-28 13:17:32,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:32,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:32,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:32,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:32,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:32,694 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-28 13:17:32,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:32,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:32,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:32,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:32,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:32,695 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 3 states. [2018-11-28 13:17:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:32,728 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2018-11-28 13:17:32,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:32,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-28 13:17:32,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:32,730 INFO L225 Difference]: With dead ends: 157 [2018-11-28 13:17:32,731 INFO L226 Difference]: Without dead ends: 91 [2018-11-28 13:17:32,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:32,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-28 13:17:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2018-11-28 13:17:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-28 13:17:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-11-28 13:17:32,739 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 16 [2018-11-28 13:17:32,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:32,739 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-11-28 13:17:32,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-11-28 13:17:32,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 13:17:32,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:32,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:32,741 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:32,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:32,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1346327205, now seen corresponding path program 1 times [2018-11-28 13:17:32,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:32,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:32,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:32,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:32,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:32,770 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-28 13:17:32,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:32,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:32,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:32,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:32,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:32,771 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 3 states. [2018-11-28 13:17:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:32,778 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-11-28 13:17:32,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:32,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 13:17:32,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:32,780 INFO L225 Difference]: With dead ends: 83 [2018-11-28 13:17:32,780 INFO L226 Difference]: Without dead ends: 81 [2018-11-28 13:17:32,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:32,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-28 13:17:32,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-28 13:17:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-28 13:17:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-11-28 13:17:32,786 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 21 [2018-11-28 13:17:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:32,786 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-11-28 13:17:32,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-11-28 13:17:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 13:17:32,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:32,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:32,788 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:32,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:32,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1346325283, now seen corresponding path program 1 times [2018-11-28 13:17:32,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:32,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:32,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:32,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:32,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:32,826 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-28 13:17:32,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:32,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:32,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:32,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:32,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:32,828 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 4 states. [2018-11-28 13:17:32,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:32,867 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2018-11-28 13:17:32,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:17:32,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-28 13:17:32,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:32,868 INFO L225 Difference]: With dead ends: 101 [2018-11-28 13:17:32,868 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 13:17:32,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:32,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 13:17:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-28 13:17:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 13:17:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-11-28 13:17:32,875 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 21 [2018-11-28 13:17:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:32,875 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-11-28 13:17:32,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-11-28 13:17:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 13:17:32,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:32,876 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:32,877 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:32,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:32,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2021783647, now seen corresponding path program 1 times [2018-11-28 13:17:32,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:32,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:32,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:32,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:32,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:32,947 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-28 13:17:32,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:17:32,947 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/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-28 13:17:32,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:32,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:33,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:17:33,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-28 13:17:33,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:33,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:33,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 13:17:33,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-28 13:17:33,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:33,061 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:17:33,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:33,078 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,084 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,087 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,097 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2018-11-28 13:17:33,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2018-11-28 13:17:33,120 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:33,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-28 13:17:33,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,140 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-28 13:17:33,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2018-11-28 13:17:33,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2018-11-28 13:17:33,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-28 13:17:33,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:17:33,194 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,210 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-28 13:17:33,210 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2018-11-28 13:17:33,215 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-28 13:17:33,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:17:33,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-28 13:17:33,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:17:33,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:17:33,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:17:33,242 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 8 states. [2018-11-28 13:17:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:33,407 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2018-11-28 13:17:33,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:17:33,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-28 13:17:33,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:33,408 INFO L225 Difference]: With dead ends: 151 [2018-11-28 13:17:33,408 INFO L226 Difference]: Without dead ends: 149 [2018-11-28 13:17:33,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:17:33,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-28 13:17:33,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 89. [2018-11-28 13:17:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-28 13:17:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-11-28 13:17:33,416 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 23 [2018-11-28 13:17:33,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:33,416 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-11-28 13:17:33,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:17:33,416 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-11-28 13:17:33,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 13:17:33,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:33,417 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:33,418 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:33,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:33,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2066926113, now seen corresponding path program 1 times [2018-11-28 13:17:33,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:33,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:33,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:33,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:33,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:33,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:33,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:33,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:33,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:33,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:33,458 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 3 states. [2018-11-28 13:17:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:33,497 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2018-11-28 13:17:33,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:33,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 13:17:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:33,498 INFO L225 Difference]: With dead ends: 181 [2018-11-28 13:17:33,498 INFO L226 Difference]: Without dead ends: 114 [2018-11-28 13:17:33,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:33,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-28 13:17:33,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2018-11-28 13:17:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 13:17:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-11-28 13:17:33,504 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 24 [2018-11-28 13:17:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:33,505 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-11-28 13:17:33,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-11-28 13:17:33,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 13:17:33,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:33,506 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:33,506 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:33,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1129078447, now seen corresponding path program 1 times [2018-11-28 13:17:33,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:33,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:33,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:17:33,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:33,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:33,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:33,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:33,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:33,554 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 3 states. [2018-11-28 13:17:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:33,607 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2018-11-28 13:17:33,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:33,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 13:17:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:33,608 INFO L225 Difference]: With dead ends: 179 [2018-11-28 13:17:33,608 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 13:17:33,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:33,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 13:17:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2018-11-28 13:17:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 13:17:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-11-28 13:17:33,615 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 31 [2018-11-28 13:17:33,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:33,616 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-11-28 13:17:33,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:33,616 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-28 13:17:33,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 13:17:33,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:33,617 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:33,618 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:33,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:33,618 INFO L82 PathProgramCache]: Analyzing trace with hash -323983759, now seen corresponding path program 1 times [2018-11-28 13:17:33,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:33,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:33,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:33,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:33,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:33,718 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:33,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:17:33,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/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-28 13:17:33,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:33,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:33,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:17:33,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-28 13:17:33,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:33,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:33,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 13:17:33,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-28 13:17:33,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:33,811 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:17:33,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:33,823 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,837 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,841 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,864 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-11-28 13:17:33,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 13:17:33,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:33,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 13:17:33,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-11-28 13:17:33,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:33,916 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:33,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:33,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-28 13:17:33,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 56 [2018-11-28 13:17:33,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-28 13:17:33,945 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-11-28 13:17:33,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:33,975 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,982 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,988 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:33,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:33,999 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:90, output treesize:47 [2018-11-28 13:17:34,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2018-11-28 13:17:34,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:34,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-11-28 13:17:34,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,050 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-28 13:17:34,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:60 [2018-11-28 13:17:34,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 42 [2018-11-28 13:17:34,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-28 13:17:34,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:17:34,093 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 13:17:34,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,107 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-28 13:17:34,107 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:67, output treesize:4 [2018-11-28 13:17:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:34,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:17:34,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-11-28 13:17:34,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:17:34,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:17:34,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:17:34,128 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 12 states. [2018-11-28 13:17:34,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:34,403 INFO L93 Difference]: Finished difference Result 165 states and 181 transitions. [2018-11-28 13:17:34,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:17:34,403 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-28 13:17:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:34,404 INFO L225 Difference]: With dead ends: 165 [2018-11-28 13:17:34,404 INFO L226 Difference]: Without dead ends: 163 [2018-11-28 13:17:34,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:17:34,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-28 13:17:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 85. [2018-11-28 13:17:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 13:17:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-11-28 13:17:34,409 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 32 [2018-11-28 13:17:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:34,409 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-11-28 13:17:34,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:17:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-11-28 13:17:34,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 13:17:34,412 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:34,412 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:34,412 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:34,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:34,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1584673033, now seen corresponding path program 1 times [2018-11-28 13:17:34,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:34,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:34,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:34,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:34,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:34,632 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-28 13:17:34,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:17:34,632 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/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-28 13:17:34,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:34,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:34,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:17:34,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-28 13:17:34,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:34,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:34,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 13:17:34,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-28 13:17:34,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:34,723 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:17:34,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-11-28 13:17:34,740 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,745 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-28 13:17:34,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:34,760 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:17:34,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-11-28 13:17:34,769 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,772 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,774 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,780 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:68, output treesize:44 [2018-11-28 13:17:34,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-11-28 13:17:34,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 13:17:34,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 60 [2018-11-28 13:17:34,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:34,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-28 13:17:34,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 67 [2018-11-28 13:17:34,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:34,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-28 13:17:34,846 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,853 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,860 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:119, output treesize:57 [2018-11-28 13:17:34,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2018-11-28 13:17:34,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-11-28 13:17:34,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-28 13:17:34,901 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-28 13:17:34,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-28 13:17:34,929 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 13:17:34,934 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,936 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:34,939 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:71, output treesize:11 [2018-11-28 13:17:34,960 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-28 13:17:34,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:17:34,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2018-11-28 13:17:34,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 13:17:34,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 13:17:34,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:17:34,984 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 14 states. [2018-11-28 13:17:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:35,335 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-11-28 13:17:35,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:17:35,336 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-28 13:17:35,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:35,336 INFO L225 Difference]: With dead ends: 108 [2018-11-28 13:17:35,336 INFO L226 Difference]: Without dead ends: 106 [2018-11-28 13:17:35,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:17:35,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-28 13:17:35,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 91. [2018-11-28 13:17:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-28 13:17:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-11-28 13:17:35,341 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 33 [2018-11-28 13:17:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:35,341 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-11-28 13:17:35,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 13:17:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-11-28 13:17:35,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 13:17:35,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:35,342 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:35,343 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:35,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:35,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1808152883, now seen corresponding path program 1 times [2018-11-28 13:17:35,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:35,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:35,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:35,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:35,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:17:35,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:35,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:35,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:35,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:35,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:35,368 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 3 states. [2018-11-28 13:17:35,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:35,400 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2018-11-28 13:17:35,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:35,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-28 13:17:35,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:35,402 INFO L225 Difference]: With dead ends: 152 [2018-11-28 13:17:35,402 INFO L226 Difference]: Without dead ends: 117 [2018-11-28 13:17:35,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:35,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-28 13:17:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-11-28 13:17:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 13:17:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2018-11-28 13:17:35,408 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 33 [2018-11-28 13:17:35,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:35,408 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2018-11-28 13:17:35,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:35,408 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2018-11-28 13:17:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 13:17:35,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:35,409 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:35,409 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:35,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:35,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1004579722, now seen corresponding path program 1 times [2018-11-28 13:17:35,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:35,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:35,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:35,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:35,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:35,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:17:35,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/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-28 13:17:35,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:35,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:35,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:17:35,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-28 13:17:35,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 13:17:35,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-28 13:17:35,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:35,616 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:17:35,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-11-28 13:17:35,630 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,639 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,643 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-28 13:17:35,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:35,658 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:17:35,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-11-28 13:17:35,668 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,674 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,677 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,687 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-28 13:17:35,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-11-28 13:17:35,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-28 13:17:35,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-11-28 13:17:35,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-11-28 13:17:35,757 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:92, output treesize:58 [2018-11-28 13:17:35,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-28 13:17:35,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,823 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 116 [2018-11-28 13:17:35,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2018-11-28 13:17:35,827 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 105 [2018-11-28 13:17:35,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:35,852 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,863 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,872 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2018-11-28 13:17:35,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-11-28 13:17:35,894 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 66 [2018-11-28 13:17:35,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:35,911 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,919 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,925 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,936 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:155, output treesize:61 [2018-11-28 13:17:35,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 154 [2018-11-28 13:17:35,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-11-28 13:17:35,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 127 [2018-11-28 13:17:35,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-11-28 13:17:35,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:36,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:216, output treesize:106 [2018-11-28 13:17:36,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 71 [2018-11-28 13:17:36,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:17:36,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 13:17:36,064 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 16 [2018-11-28 13:17:36,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2018-11-28 13:17:36,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:17:36,086 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:17:36,090 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,091 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,093 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:121, output treesize:4 [2018-11-28 13:17:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:36,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:17:36,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2018-11-28 13:17:36,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:17:36,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:17:36,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:17:36,122 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand 12 states. [2018-11-28 13:17:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:36,409 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-11-28 13:17:36,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:17:36,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-28 13:17:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:36,411 INFO L225 Difference]: With dead ends: 128 [2018-11-28 13:17:36,411 INFO L226 Difference]: Without dead ends: 126 [2018-11-28 13:17:36,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-11-28 13:17:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-28 13:17:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 109. [2018-11-28 13:17:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-28 13:17:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-11-28 13:17:36,417 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 35 [2018-11-28 13:17:36,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:36,417 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-11-28 13:17:36,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:17:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-11-28 13:17:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 13:17:36,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:36,418 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:36,419 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:36,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:36,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1088300863, now seen corresponding path program 1 times [2018-11-28 13:17:36,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:36,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:36,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:36,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:36,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:17:36,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:36,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:36,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:36,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:36,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:36,447 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 4 states. [2018-11-28 13:17:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:36,477 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2018-11-28 13:17:36,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:36,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-28 13:17:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:36,479 INFO L225 Difference]: With dead ends: 131 [2018-11-28 13:17:36,479 INFO L226 Difference]: Without dead ends: 120 [2018-11-28 13:17:36,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-28 13:17:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-11-28 13:17:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-28 13:17:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2018-11-28 13:17:36,486 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 41 [2018-11-28 13:17:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:36,486 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2018-11-28 13:17:36,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2018-11-28 13:17:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 13:17:36,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:36,487 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:36,487 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:36,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash -387236285, now seen corresponding path program 1 times [2018-11-28 13:17:36,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:36,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:36,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:36,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:36,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:36,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:17:36,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/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-28 13:17:36,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:36,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:36,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:17:36,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-28 13:17:36,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:36,686 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:36,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 13:17:36,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-28 13:17:36,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:36,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:17:36,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:36,714 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,718 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-28 13:17:36,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:36,733 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-28 13:17:36,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:17:36,741 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,744 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,747 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,754 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:68, output treesize:44 [2018-11-28 13:17:36,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 79 [2018-11-28 13:17:36,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-11-28 13:17:36,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2018-11-28 13:17:36,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:36,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-28 13:17:36,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,838 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:96, output treesize:42 [2018-11-28 13:17:36,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 52 [2018-11-28 13:17:36,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-11-28 13:17:36,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:36,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2018-11-28 13:17:36,896 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:36,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-28 13:17:36,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 13:17:36,909 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-28 13:17:36,914 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,918 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:36,921 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:72, output treesize:7 [2018-11-28 13:17:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:36,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:17:36,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2018-11-28 13:17:36,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 13:17:36,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 13:17:36,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:17:36,957 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand 14 states. [2018-11-28 13:17:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:37,165 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2018-11-28 13:17:37,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:17:37,166 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-11-28 13:17:37,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:37,166 INFO L225 Difference]: With dead ends: 139 [2018-11-28 13:17:37,166 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 13:17:37,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:17:37,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 13:17:37,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-28 13:17:37,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 13:17:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-11-28 13:17:37,172 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 41 [2018-11-28 13:17:37,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:37,173 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-11-28 13:17:37,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 13:17:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-11-28 13:17:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 13:17:37,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:37,173 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:37,174 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:37,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:37,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1997813481, now seen corresponding path program 1 times [2018-11-28 13:17:37,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:37,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:37,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:37,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:37,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:37,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:17:37,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/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-28 13:17:37,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:37,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:37,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:17:37,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-28 13:17:37,334 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:37,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:37,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 13:17:37,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-28 13:17:37,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:37,349 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:17:37,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:37,356 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,359 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,361 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,367 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-11-28 13:17:37,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 13:17:37,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:37,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 13:17:37,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-11-28 13:17:37,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:37,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:37,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:37,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-11-28 13:17:37,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 65 [2018-11-28 13:17:37,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-28 13:17:37,437 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-11-28 13:17:37,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:37,453 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,464 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,472 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:37,482 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:96, output treesize:66 [2018-11-28 13:17:37,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 73 [2018-11-28 13:17:37,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:37,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 13:17:37,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,561 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-28 13:17:37,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:66 [2018-11-28 13:17:37,572 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:37,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:37,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:37,577 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:37,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-11-28 13:17:37,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 91 [2018-11-28 13:17:37,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-28 13:17:37,605 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 86 [2018-11-28 13:17:37,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:37,653 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,670 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,679 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:37,688 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:151, output treesize:91 [2018-11-28 13:17:37,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 115 [2018-11-28 13:17:37,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:37,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-11-28 13:17:37,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:37,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:179, output treesize:124 [2018-11-28 13:17:37,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 69 [2018-11-28 13:17:37,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-28 13:17:37,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:17:37,790 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-28 13:17:37,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-28 13:17:37,802 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:37,808 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:131, output treesize:4 [2018-11-28 13:17:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:37,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:17:37,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-11-28 13:17:37,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 13:17:37,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 13:17:37,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:17:37,838 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 14 states. [2018-11-28 13:17:38,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:38,285 INFO L93 Difference]: Finished difference Result 175 states and 187 transitions. [2018-11-28 13:17:38,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:17:38,286 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-11-28 13:17:38,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:38,286 INFO L225 Difference]: With dead ends: 175 [2018-11-28 13:17:38,286 INFO L226 Difference]: Without dead ends: 173 [2018-11-28 13:17:38,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2018-11-28 13:17:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-28 13:17:38,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 91. [2018-11-28 13:17:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-28 13:17:38,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-11-28 13:17:38,294 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 42 [2018-11-28 13:17:38,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:38,294 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-11-28 13:17:38,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 13:17:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-11-28 13:17:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 13:17:38,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:38,295 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:38,295 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:38,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:38,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1874896500, now seen corresponding path program 1 times [2018-11-28 13:17:38,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:38,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:38,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:38,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:38,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:38,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:17:38,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/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-28 13:17:38,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:38,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:38,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:17:38,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-28 13:17:38,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:38,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:38,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 13:17:38,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-28 13:17:38,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:38,586 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:17:38,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:38,596 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,599 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-28 13:17:38,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:38,615 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-28 13:17:38,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 13:17:38,622 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,625 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,628 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,635 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-28 13:17:38,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-11-28 13:17:38,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:38,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-28 13:17:38,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 59 [2018-11-28 13:17:38,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:38,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-11-28 13:17:38,690 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,697 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 14 [2018-11-28 13:17:38,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-28 13:17:38,711 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,713 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,723 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:71 [2018-11-28 13:17:38,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:38,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:38,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:38,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-28 13:17:38,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 148 [2018-11-28 13:17:38,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-11-28 13:17:38,795 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 143 [2018-11-28 13:17:38,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:38,833 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,849 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2018-11-28 13:17:38,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-11-28 13:17:38,890 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,893 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2018-11-28 13:17:38,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-11-28 13:17:38,915 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2018-11-28 13:17:38,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:38,929 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,936 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,941 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-11-28 13:17:38,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-28 13:17:38,958 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,961 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:38,970 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:204, output treesize:68 [2018-11-28 13:17:39,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 182 [2018-11-28 13:17:39,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:39,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-11-28 13:17:39,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:39,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:39,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 148 [2018-11-28 13:17:39,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:39,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2018-11-28 13:17:39,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:39,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:39,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2018-11-28 13:17:39,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-28 13:17:39,086 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:39,092 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:39,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:39,104 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:248, output treesize:122 [2018-11-28 13:17:39,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 85 [2018-11-28 13:17:39,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-11-28 13:17:39,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:39,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2018-11-28 13:17:39,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:39,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:17:39,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:39,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:39,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 13:17:39,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 13:17:39,213 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:39,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:17:39,217 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:39,218 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:39,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:39,223 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:136, output treesize:24 [2018-11-28 13:17:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:39,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:17:39,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-11-28 13:17:39,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 13:17:39,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 13:17:39,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2018-11-28 13:17:39,272 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 16 states. [2018-11-28 13:17:39,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:39,829 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-11-28 13:17:39,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:17:39,830 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-11-28 13:17:39,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:39,830 INFO L225 Difference]: With dead ends: 116 [2018-11-28 13:17:39,830 INFO L226 Difference]: Without dead ends: 114 [2018-11-28 13:17:39,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=502, Unknown=1, NotChecked=0, Total=600 [2018-11-28 13:17:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-28 13:17:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2018-11-28 13:17:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 13:17:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-11-28 13:17:39,840 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 44 [2018-11-28 13:17:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:39,840 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-11-28 13:17:39,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 13:17:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-11-28 13:17:39,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 13:17:39,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:39,841 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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-28 13:17:39,841 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:39,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:39,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1415179328, now seen corresponding path program 1 times [2018-11-28 13:17:39,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:39,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:39,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:39,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:39,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 13:17:39,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:39,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:39,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:39,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:39,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:39,872 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 3 states. [2018-11-28 13:17:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:39,914 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-11-28 13:17:39,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:39,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-28 13:17:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:39,915 INFO L225 Difference]: With dead ends: 125 [2018-11-28 13:17:39,915 INFO L226 Difference]: Without dead ends: 102 [2018-11-28 13:17:39,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-28 13:17:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2018-11-28 13:17:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 13:17:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2018-11-28 13:17:39,923 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 44 [2018-11-28 13:17:39,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:39,923 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2018-11-28 13:17:39,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-28 13:17:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:17:39,924 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:39,924 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:39,924 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:39,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:39,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1495461684, now seen corresponding path program 1 times [2018-11-28 13:17:39,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:39,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:39,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:39,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:39,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:40,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:17:40,202 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/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-28 13:17:40,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:40,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:40,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:17:40,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-28 13:17:40,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 13:17:40,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-28 13:17:40,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:40,278 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:17:40,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-11-28 13:17:40,291 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,295 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,299 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-28 13:17:40,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:40,312 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:17:40,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-11-28 13:17:40,322 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,326 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,329 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,338 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-28 13:17:40,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-11-28 13:17:40,364 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-11-28 13:17:40,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-11-28 13:17:40,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-28 13:17:40,392 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,411 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:61 [2018-11-28 13:17:40,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,448 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-11-28 13:17:40,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 118 [2018-11-28 13:17:40,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2018-11-28 13:17:40,489 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 100 treesize of output 117 [2018-11-28 13:17:40,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:40,513 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,525 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 90 [2018-11-28 13:17:40,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-11-28 13:17:40,561 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 71 [2018-11-28 13:17:40,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:40,581 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,588 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,596 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,612 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:180, output treesize:83 [2018-11-28 13:17:40,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-11-28 13:17:40,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 13:17:40,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2018-11-28 13:17:40,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-28 13:17:40,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:118, output treesize:80 [2018-11-28 13:17:40,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2018-11-28 13:17:40,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 185 [2018-11-28 13:17:40,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-11-28 13:17:40,792 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 180 [2018-11-28 13:17:40,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:40,824 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,838 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,852 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 134 [2018-11-28 13:17:40,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-11-28 13:17:40,874 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 129 [2018-11-28 13:17:40,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:40,890 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,900 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,908 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:40,921 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:292, output treesize:129 [2018-11-28 13:17:40,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 316 treesize of output 282 [2018-11-28 13:17:40,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2018-11-28 13:17:40,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:41,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 146 [2018-11-28 13:17:41,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:41,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2018-11-28 13:17:41,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:41,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:41,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:41,030 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:324, output treesize:190 [2018-11-28 13:17:41,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 98 [2018-11-28 13:17:41,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 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-28 13:17:41,075 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:41,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 19 [2018-11-28 13:17:41,094 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:41,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-28 13:17:41,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:41,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:17:41,122 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:41,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:41,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2018-11-28 13:17:41,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:17:41,143 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:41,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:17:41,149 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:41,151 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:41,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:41,155 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:205, output treesize:4 [2018-11-28 13:17:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:41,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:17:41,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-11-28 13:17:41,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:17:41,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:17:41,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:17:41,182 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand 19 states. [2018-11-28 13:17:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:41,863 INFO L93 Difference]: Finished difference Result 181 states and 190 transitions. [2018-11-28 13:17:41,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 13:17:41,864 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-28 13:17:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:41,865 INFO L225 Difference]: With dead ends: 181 [2018-11-28 13:17:41,865 INFO L226 Difference]: Without dead ends: 179 [2018-11-28 13:17:41,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2018-11-28 13:17:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-28 13:17:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 118. [2018-11-28 13:17:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-28 13:17:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-11-28 13:17:41,872 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 45 [2018-11-28 13:17:41,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:41,873 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-11-28 13:17:41,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:17:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-28 13:17:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 13:17:41,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:41,873 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:41,874 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:41,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash 400881353, now seen corresponding path program 1 times [2018-11-28 13:17:41,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:41,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:41,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:41,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:41,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:42,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:17:42,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/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-28 13:17:42,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:42,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:42,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 13:17:42,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-28 13:17:42,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,221 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-28 13:17:42,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-28 13:17:42,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:42,241 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:17:42,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-11-28 13:17:42,254 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,259 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,263 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-28 13:17:42,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:42,277 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-28 13:17:42,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-11-28 13:17:42,285 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,289 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,292 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,301 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-28 13:17:42,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-11-28 13:17:42,341 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-28 13:17:42,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-11-28 13:17:42,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-11-28 13:17:42,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,385 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:61 [2018-11-28 13:17:42,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-11-28 13:17:42,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 119 [2018-11-28 13:17:42,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-11-28 13:17:42,459 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 114 [2018-11-28 13:17:42,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:42,487 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,499 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,510 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,532 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:17:42,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 68 [2018-11-28 13:17:42,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-28 13:17:42,535 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2018-11-28 13:17:42,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 19 [2018-11-28 13:17:42,550 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,559 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,564 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,580 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:163, output treesize:109 [2018-11-28 13:17:42,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 103 [2018-11-28 13:17:42,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2018-11-28 13:17:42,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 110 [2018-11-28 13:17:42,689 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2018-11-28 13:17:42,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,716 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:144, output treesize:118 [2018-11-28 13:17:42,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2018-11-28 13:17:42,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,790 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 215 [2018-11-28 13:17:42,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-11-28 13:17:42,795 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,817 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,823 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 203 [2018-11-28 13:17:42,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:42,831 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,849 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,863 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 153 [2018-11-28 13:17:42,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2018-11-28 13:17:42,915 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:42,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 156 [2018-11-28 13:17:42,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:42,938 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,951 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,960 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:42,975 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:307, output treesize:112 [2018-11-28 13:17:43,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 315 treesize of output 289 [2018-11-28 13:17:43,016 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:43,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2018-11-28 13:17:43,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:43,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:43,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:43,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:43,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 165 [2018-11-28 13:17:43,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:43,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2018-11-28 13:17:43,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:43,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:43,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:43,097 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:323, output treesize:189 [2018-11-28 13:17:43,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:43,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:43,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 126 [2018-11-28 13:17:43,160 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2018-11-28 13:17:43,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:43,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-11-28 13:17:43,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:43,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:17:43,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:43,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-11-28 13:17:43,197 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:43,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:43,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 30 [2018-11-28 13:17:43,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:17:43,213 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:43,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 13:17:43,218 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:43,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:17:43,221 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:43,222 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:43,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:43,225 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:220, output treesize:4 [2018-11-28 13:17:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:43,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:17:43,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2018-11-28 13:17:43,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:17:43,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:17:43,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:17:43,254 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 19 states. [2018-11-28 13:17:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:43,861 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2018-11-28 13:17:43,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:17:43,861 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-11-28 13:17:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:43,862 INFO L225 Difference]: With dead ends: 156 [2018-11-28 13:17:43,862 INFO L226 Difference]: Without dead ends: 154 [2018-11-28 13:17:43,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-11-28 13:17:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-28 13:17:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 133. [2018-11-28 13:17:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-28 13:17:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2018-11-28 13:17:43,870 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 48 [2018-11-28 13:17:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:43,870 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2018-11-28 13:17:43,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:17:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2018-11-28 13:17:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 13:17:43,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:43,871 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:43,871 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:43,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:43,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1643497090, now seen corresponding path program 1 times [2018-11-28 13:17:43,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:43,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:43,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:43,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:43,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:43,908 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:17:43,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:17:43 BoogieIcfgContainer [2018-11-28 13:17:43,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:17:43,942 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:17:43,942 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:17:43,942 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:17:43,945 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:17:32" (3/4) ... [2018-11-28 13:17:43,947 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 13:17:43,986 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e436e53e-997a-4953-96b4-ca3df75b42c7/bin-2019/uautomizer/witness.graphml [2018-11-28 13:17:43,986 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:17:43,987 INFO L168 Benchmark]: Toolchain (without parser) took 12459.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.9 MB). Free memory was 949.6 MB in the beginning and 1.2 GB in the end (delta: -263.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:43,989 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:17:43,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:43,989 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:43,989 INFO L168 Benchmark]: Boogie Preprocessor took 31.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:43,989 INFO L168 Benchmark]: RCFGBuilder took 347.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:43,990 INFO L168 Benchmark]: TraceAbstraction took 11674.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:43,990 INFO L168 Benchmark]: Witness Printer took 43.66 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-28 13:17:43,991 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 347.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11674.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Witness Printer took 43.66 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1035]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] head->data = 0 [L988] SLL* item = head; [L989] int status = 0; VAL [head={23:0}, item={23:0}, malloc(sizeof(SLL))={23:0}, status=0] [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=0] [L997] COND TRUE !status [L999] item->data = 1 [L1000] status = 1 VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=1] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=1] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={23:0}, item={26:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={26:0}, status=1] [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=1] [L997] COND FALSE !(!status) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=1] [L1002] COND TRUE status == 1 [L1004] item->data = 2 [L1005] status = 2 VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=2] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=2] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={23:0}, item={21:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={21:0}, status=2] [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=2] [L997] COND FALSE !(!status) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=2] [L1002] COND FALSE !(status == 1) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=2] [L1007] COND TRUE status >= 2 [L1009] item->data = 3 [L1010] status = 3 VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1017] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1018] COND FALSE !(status == 1) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1023] COND FALSE !(status == 2) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1029] COND TRUE status == 3 VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1031] COND FALSE !(!(head != ((void*)0))) VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1032] EXPR head->next VAL [head={23:0}, head->next={26:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1032] COND FALSE !(!(head->next != ((void*)0))) [L1033] EXPR head->next [L1033] EXPR head->next->next VAL [head={23:0}, head->next={26:0}, head->next->next={21:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1033] COND FALSE !(!(head->next->next != ((void*)0))) [L1034] EXPR head->next [L1034] EXPR head->next->next [L1034] EXPR head->next->next->next VAL [head={23:0}, head->next={26:0}, head->next->next={21:0}, head->next->next->next={29:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1034] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1035] EXPR head->next [L1035] EXPR head->next->next [L1035] EXPR head->next->next->next [L1035] EXPR head->next->next->next->data VAL [head={23:0}, head->next={26:0}, head->next->next={21:0}, head->next->next->next={29:0}, head->next->next->next->data=3, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] [L1035] COND TRUE !(head->next->next->next->data != 3) [L1035] __VERIFIER_error() VAL [head={23:0}, item={29:0}, malloc(sizeof(SLL))={23:0}, malloc(sizeof(SLL))={29:0}, status=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 90 locations, 14 error locations. UNSAFE Result, 11.6s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1481 SDtfs, 1915 SDslu, 5161 SDs, 0 SdLazy, 2774 SolverSat, 232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 529 GetRequests, 331 SyntacticMatches, 16 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 415 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 1000 NumberOfCodeBlocks, 1000 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 920 ConstructedInterpolants, 141 QuantifiedInterpolants, 1243414 SizeOfPredicates, 117 NumberOfNonLiveVariables, 1297 ConjunctsInSsa, 327 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 68/318 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...