./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/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 e2cfc7f3e461f5ecb57edb2b49f889b2b38a58c8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/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 e2cfc7f3e461f5ecb57edb2b49f889b2b38a58c8 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 01:55:14,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:55:14,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:55:14,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:55:14,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:55:14,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:55:14,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:55:14,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:55:14,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:55:14,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:55:14,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:55:14,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:55:14,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:55:14,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:55:14,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:55:14,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:55:14,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:55:14,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:55:14,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:55:14,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:55:14,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:55:14,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:55:14,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:55:14,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:55:14,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:55:14,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:55:14,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:55:14,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:55:14,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:55:14,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:55:14,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:55:14,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:55:14,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:55:14,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:55:14,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:55:14,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:55:14,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:55:14,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:55:14,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:55:14,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:55:14,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:55:14,252 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 01:55:14,279 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:55:14,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:55:14,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:55:14,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:55:14,293 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:55:14,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:55:14,293 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:55:14,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:55:14,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:55:14,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:55:14,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:55:14,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:55:14,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:55:14,295 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:55:14,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:55:14,296 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:55:14,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:55:14,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:55:14,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:55:14,297 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:55:14,297 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:55:14,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:55:14,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:55:14,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:55:14,298 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:55:14,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:55:14,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:55:14,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:55:14,300 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/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 -> e2cfc7f3e461f5ecb57edb2b49f889b2b38a58c8 [2019-11-20 01:55:14,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:55:14,517 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:55:14,521 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:55:14,522 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:55:14,523 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:55:14,524 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-2.c [2019-11-20 01:55:14,590 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/data/2ba1939bd/393644c9d25b4bc8b8b41830ce7b5c85/FLAGb360540b3 [2019-11-20 01:55:15,213 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:55:15,223 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-2.c [2019-11-20 01:55:15,260 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/data/2ba1939bd/393644c9d25b4bc8b8b41830ce7b5c85/FLAGb360540b3 [2019-11-20 01:55:15,475 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/data/2ba1939bd/393644c9d25b4bc8b8b41830ce7b5c85 [2019-11-20 01:55:15,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:55:15,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:55:15,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:55:15,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:55:15,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:55:15,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:55:15" (1/1) ... [2019-11-20 01:55:15,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ade7115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:15, skipping insertion in model container [2019-11-20 01:55:15,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:55:15" (1/1) ... [2019-11-20 01:55:15,504 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:55:15,588 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:55:16,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:55:16,161 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:55:16,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:55:16,382 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:55:16,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:16 WrapperNode [2019-11-20 01:55:16,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:55:16,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:55:16,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:55:16,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:55:16,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:16" (1/1) ... [2019-11-20 01:55:16,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:16" (1/1) ... [2019-11-20 01:55:16,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:55:16,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:55:16,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:55:16,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:55:16,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:16" (1/1) ... [2019-11-20 01:55:16,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:16" (1/1) ... [2019-11-20 01:55:16,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:16" (1/1) ... [2019-11-20 01:55:16,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:16" (1/1) ... [2019-11-20 01:55:16,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:16" (1/1) ... [2019-11-20 01:55:16,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:16" (1/1) ... [2019-11-20 01:55:16,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:16" (1/1) ... [2019-11-20 01:55:16,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:55:16,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:55:16,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:55:16,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:55:16,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/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 [2019-11-20 01:55:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 01:55:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:55:16,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 01:55:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 01:55:16,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 01:55:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 01:55:16,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:55:16,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:55:16,944 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 01:55:18,038 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 01:55:18,038 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 01:55:18,039 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:55:18,040 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 01:55:18,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:55:18 BoogieIcfgContainer [2019-11-20 01:55:18,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:55:18,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:55:18,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:55:18,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:55:18,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:55:15" (1/3) ... [2019-11-20 01:55:18,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba75586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:55:18, skipping insertion in model container [2019-11-20 01:55:18,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:16" (2/3) ... [2019-11-20 01:55:18,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba75586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:55:18, skipping insertion in model container [2019-11-20 01:55:18,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:55:18" (3/3) ... [2019-11-20 01:55:18,053 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-2.c [2019-11-20 01:55:18,063 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:55:18,071 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:55:18,082 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:55:18,110 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:55:18,110 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:55:18,110 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:55:18,110 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:55:18,110 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:55:18,111 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:55:18,111 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:55:18,111 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:55:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-20 01:55:18,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 01:55:18,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:18,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:18,139 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:18,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:18,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1923572963, now seen corresponding path program 1 times [2019-11-20 01:55:18,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:18,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336406326] [2019-11-20 01:55:18,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:18,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:18,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336406326] [2019-11-20 01:55:18,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:18,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:18,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553380643] [2019-11-20 01:55:18,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:18,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:18,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:18,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:18,483 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2019-11-20 01:55:19,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:19,111 INFO L93 Difference]: Finished difference Result 331 states and 563 transitions. [2019-11-20 01:55:19,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:19,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-20 01:55:19,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:19,139 INFO L225 Difference]: With dead ends: 331 [2019-11-20 01:55:19,139 INFO L226 Difference]: Without dead ends: 167 [2019-11-20 01:55:19,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:19,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-20 01:55:19,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2019-11-20 01:55:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-20 01:55:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 234 transitions. [2019-11-20 01:55:19,219 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 234 transitions. Word has length 44 [2019-11-20 01:55:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:19,219 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 234 transitions. [2019-11-20 01:55:19,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:19,219 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 234 transitions. [2019-11-20 01:55:19,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 01:55:19,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:19,223 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:19,224 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:19,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:19,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1205735271, now seen corresponding path program 1 times [2019-11-20 01:55:19,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:19,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37297810] [2019-11-20 01:55:19,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:19,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37297810] [2019-11-20 01:55:19,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:19,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:19,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240364164] [2019-11-20 01:55:19,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:19,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:19,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:19,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:19,368 INFO L87 Difference]: Start difference. First operand 150 states and 234 transitions. Second operand 4 states. [2019-11-20 01:55:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:19,820 INFO L93 Difference]: Finished difference Result 298 states and 459 transitions. [2019-11-20 01:55:19,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:19,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-20 01:55:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:19,823 INFO L225 Difference]: With dead ends: 298 [2019-11-20 01:55:19,824 INFO L226 Difference]: Without dead ends: 167 [2019-11-20 01:55:19,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:19,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-20 01:55:19,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 150. [2019-11-20 01:55:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-20 01:55:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 233 transitions. [2019-11-20 01:55:19,843 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 233 transitions. Word has length 57 [2019-11-20 01:55:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:19,844 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 233 transitions. [2019-11-20 01:55:19,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 233 transitions. [2019-11-20 01:55:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:55:19,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:19,852 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:19,853 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:19,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1990910741, now seen corresponding path program 1 times [2019-11-20 01:55:19,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:19,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876828552] [2019-11-20 01:55:19,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:20,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876828552] [2019-11-20 01:55:20,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:20,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:20,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711499476] [2019-11-20 01:55:20,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:20,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:20,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:20,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:20,032 INFO L87 Difference]: Start difference. First operand 150 states and 233 transitions. Second operand 4 states. [2019-11-20 01:55:20,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:20,593 INFO L93 Difference]: Finished difference Result 297 states and 457 transitions. [2019-11-20 01:55:20,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:20,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 01:55:20,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:20,596 INFO L225 Difference]: With dead ends: 297 [2019-11-20 01:55:20,596 INFO L226 Difference]: Without dead ends: 166 [2019-11-20 01:55:20,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-20 01:55:20,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 150. [2019-11-20 01:55:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-20 01:55:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 232 transitions. [2019-11-20 01:55:20,612 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 232 transitions. Word has length 58 [2019-11-20 01:55:20,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:20,613 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 232 transitions. [2019-11-20 01:55:20,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 232 transitions. [2019-11-20 01:55:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:55:20,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:20,617 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:20,617 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:20,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:20,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2034239562, now seen corresponding path program 1 times [2019-11-20 01:55:20,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:20,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607590660] [2019-11-20 01:55:20,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:20,772 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:20,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607590660] [2019-11-20 01:55:20,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:20,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:20,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372028516] [2019-11-20 01:55:20,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:20,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:20,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:20,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:20,775 INFO L87 Difference]: Start difference. First operand 150 states and 232 transitions. Second operand 4 states. [2019-11-20 01:55:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:21,158 INFO L93 Difference]: Finished difference Result 295 states and 454 transitions. [2019-11-20 01:55:21,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:21,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 01:55:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:21,161 INFO L225 Difference]: With dead ends: 295 [2019-11-20 01:55:21,161 INFO L226 Difference]: Without dead ends: 164 [2019-11-20 01:55:21,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:21,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-20 01:55:21,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2019-11-20 01:55:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-20 01:55:21,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 231 transitions. [2019-11-20 01:55:21,181 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 231 transitions. Word has length 58 [2019-11-20 01:55:21,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:21,181 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 231 transitions. [2019-11-20 01:55:21,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:21,182 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 231 transitions. [2019-11-20 01:55:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:55:21,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:21,183 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:21,183 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:21,184 INFO L82 PathProgramCache]: Analyzing trace with hash -290440950, now seen corresponding path program 1 times [2019-11-20 01:55:21,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:21,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904349483] [2019-11-20 01:55:21,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:21,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904349483] [2019-11-20 01:55:21,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:21,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:21,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454442409] [2019-11-20 01:55:21,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:21,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:21,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:21,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:21,330 INFO L87 Difference]: Start difference. First operand 150 states and 231 transitions. Second operand 4 states. [2019-11-20 01:55:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:21,717 INFO L93 Difference]: Finished difference Result 294 states and 452 transitions. [2019-11-20 01:55:21,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:21,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 01:55:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:21,719 INFO L225 Difference]: With dead ends: 294 [2019-11-20 01:55:21,719 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 01:55:21,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:21,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 01:55:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2019-11-20 01:55:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-20 01:55:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 230 transitions. [2019-11-20 01:55:21,728 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 230 transitions. Word has length 58 [2019-11-20 01:55:21,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:21,729 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 230 transitions. [2019-11-20 01:55:21,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:21,729 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 230 transitions. [2019-11-20 01:55:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 01:55:21,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:21,730 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:21,730 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:21,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash 355375361, now seen corresponding path program 1 times [2019-11-20 01:55:21,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:21,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071986130] [2019-11-20 01:55:21,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:21,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071986130] [2019-11-20 01:55:21,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:21,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:21,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350531000] [2019-11-20 01:55:21,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:21,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:21,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:21,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:21,812 INFO L87 Difference]: Start difference. First operand 150 states and 230 transitions. Second operand 4 states. [2019-11-20 01:55:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:22,116 INFO L93 Difference]: Finished difference Result 294 states and 451 transitions. [2019-11-20 01:55:22,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:22,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 01:55:22,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:22,117 INFO L225 Difference]: With dead ends: 294 [2019-11-20 01:55:22,117 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 01:55:22,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:22,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 01:55:22,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2019-11-20 01:55:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-20 01:55:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 229 transitions. [2019-11-20 01:55:22,131 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 229 transitions. Word has length 58 [2019-11-20 01:55:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:22,132 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 229 transitions. [2019-11-20 01:55:22,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 229 transitions. [2019-11-20 01:55:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 01:55:22,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:22,133 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:22,134 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:22,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:22,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1368481214, now seen corresponding path program 1 times [2019-11-20 01:55:22,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:22,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108195681] [2019-11-20 01:55:22,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:22,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108195681] [2019-11-20 01:55:22,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:22,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:22,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798485681] [2019-11-20 01:55:22,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:22,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:22,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:22,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:22,195 INFO L87 Difference]: Start difference. First operand 150 states and 229 transitions. Second operand 4 states. [2019-11-20 01:55:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:22,554 INFO L93 Difference]: Finished difference Result 294 states and 450 transitions. [2019-11-20 01:55:22,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:22,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 01:55:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:22,557 INFO L225 Difference]: With dead ends: 294 [2019-11-20 01:55:22,557 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 01:55:22,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 01:55:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2019-11-20 01:55:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-20 01:55:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 228 transitions. [2019-11-20 01:55:22,564 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 228 transitions. Word has length 59 [2019-11-20 01:55:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:22,564 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 228 transitions. [2019-11-20 01:55:22,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 228 transitions. [2019-11-20 01:55:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 01:55:22,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:22,566 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:22,566 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:22,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:22,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1032037892, now seen corresponding path program 1 times [2019-11-20 01:55:22,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:22,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128901162] [2019-11-20 01:55:22,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:22,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128901162] [2019-11-20 01:55:22,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:22,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:22,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575605810] [2019-11-20 01:55:22,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:22,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:22,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:22,632 INFO L87 Difference]: Start difference. First operand 150 states and 228 transitions. Second operand 4 states. [2019-11-20 01:55:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:23,017 INFO L93 Difference]: Finished difference Result 294 states and 449 transitions. [2019-11-20 01:55:23,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:23,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-20 01:55:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:23,019 INFO L225 Difference]: With dead ends: 294 [2019-11-20 01:55:23,019 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 01:55:23,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 01:55:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2019-11-20 01:55:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-20 01:55:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 227 transitions. [2019-11-20 01:55:23,025 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 227 transitions. Word has length 60 [2019-11-20 01:55:23,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:23,025 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 227 transitions. [2019-11-20 01:55:23,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:23,025 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 227 transitions. [2019-11-20 01:55:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 01:55:23,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:23,027 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:23,027 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:23,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:23,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1880748327, now seen corresponding path program 1 times [2019-11-20 01:55:23,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:23,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585679908] [2019-11-20 01:55:23,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:23,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585679908] [2019-11-20 01:55:23,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:23,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:23,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211972027] [2019-11-20 01:55:23,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:23,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:23,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:23,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:23,088 INFO L87 Difference]: Start difference. First operand 150 states and 227 transitions. Second operand 4 states. [2019-11-20 01:55:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:23,401 INFO L93 Difference]: Finished difference Result 284 states and 435 transitions. [2019-11-20 01:55:23,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:23,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-20 01:55:23,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:23,403 INFO L225 Difference]: With dead ends: 284 [2019-11-20 01:55:23,403 INFO L226 Difference]: Without dead ends: 153 [2019-11-20 01:55:23,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:23,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-20 01:55:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2019-11-20 01:55:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-20 01:55:23,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 226 transitions. [2019-11-20 01:55:23,409 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 226 transitions. Word has length 61 [2019-11-20 01:55:23,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:23,409 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 226 transitions. [2019-11-20 01:55:23,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 226 transitions. [2019-11-20 01:55:23,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 01:55:23,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:23,410 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:23,411 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:23,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:23,411 INFO L82 PathProgramCache]: Analyzing trace with hash 626011761, now seen corresponding path program 1 times [2019-11-20 01:55:23,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:23,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165516877] [2019-11-20 01:55:23,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:23,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165516877] [2019-11-20 01:55:23,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:23,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:23,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997012953] [2019-11-20 01:55:23,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:23,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:23,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:23,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:23,479 INFO L87 Difference]: Start difference. First operand 150 states and 226 transitions. Second operand 4 states. [2019-11-20 01:55:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:23,967 INFO L93 Difference]: Finished difference Result 324 states and 496 transitions. [2019-11-20 01:55:23,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:23,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-20 01:55:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:23,969 INFO L225 Difference]: With dead ends: 324 [2019-11-20 01:55:23,970 INFO L226 Difference]: Without dead ends: 193 [2019-11-20 01:55:23,970 INFO L630 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 [2019-11-20 01:55:23,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-20 01:55:23,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 172. [2019-11-20 01:55:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-20 01:55:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 264 transitions. [2019-11-20 01:55:23,976 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 264 transitions. Word has length 61 [2019-11-20 01:55:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:23,977 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 264 transitions. [2019-11-20 01:55:23,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 264 transitions. [2019-11-20 01:55:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 01:55:23,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:23,978 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:23,979 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:23,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:23,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1836467047, now seen corresponding path program 1 times [2019-11-20 01:55:23,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:23,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297670267] [2019-11-20 01:55:23,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:24,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297670267] [2019-11-20 01:55:24,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:24,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:24,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515673879] [2019-11-20 01:55:24,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:24,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:24,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:24,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:24,043 INFO L87 Difference]: Start difference. First operand 172 states and 264 transitions. Second operand 4 states. [2019-11-20 01:55:24,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:24,504 INFO L93 Difference]: Finished difference Result 346 states and 533 transitions. [2019-11-20 01:55:24,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:24,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 01:55:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:24,507 INFO L225 Difference]: With dead ends: 346 [2019-11-20 01:55:24,507 INFO L226 Difference]: Without dead ends: 193 [2019-11-20 01:55:24,507 INFO L630 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 [2019-11-20 01:55:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-20 01:55:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 172. [2019-11-20 01:55:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-20 01:55:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 263 transitions. [2019-11-20 01:55:24,514 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 263 transitions. Word has length 74 [2019-11-20 01:55:24,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:24,516 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 263 transitions. [2019-11-20 01:55:24,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 263 transitions. [2019-11-20 01:55:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 01:55:24,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:24,517 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:24,518 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:24,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:24,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2123047901, now seen corresponding path program 1 times [2019-11-20 01:55:24,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:24,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143722330] [2019-11-20 01:55:24,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:24,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143722330] [2019-11-20 01:55:24,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:24,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:24,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382785491] [2019-11-20 01:55:24,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:24,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:24,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:24,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:24,603 INFO L87 Difference]: Start difference. First operand 172 states and 263 transitions. Second operand 4 states. [2019-11-20 01:55:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:25,097 INFO L93 Difference]: Finished difference Result 345 states and 530 transitions. [2019-11-20 01:55:25,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:25,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 01:55:25,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:25,100 INFO L225 Difference]: With dead ends: 345 [2019-11-20 01:55:25,100 INFO L226 Difference]: Without dead ends: 192 [2019-11-20 01:55:25,101 INFO L630 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 [2019-11-20 01:55:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-20 01:55:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2019-11-20 01:55:25,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-20 01:55:25,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 262 transitions. [2019-11-20 01:55:25,109 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 262 transitions. Word has length 75 [2019-11-20 01:55:25,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:25,110 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 262 transitions. [2019-11-20 01:55:25,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:25,110 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 262 transitions. [2019-11-20 01:55:25,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 01:55:25,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:25,112 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:25,112 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:25,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:25,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2079719080, now seen corresponding path program 1 times [2019-11-20 01:55:25,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:25,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577111175] [2019-11-20 01:55:25,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:25,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577111175] [2019-11-20 01:55:25,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:25,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:25,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930495248] [2019-11-20 01:55:25,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:25,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:25,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:25,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:25,180 INFO L87 Difference]: Start difference. First operand 172 states and 262 transitions. Second operand 4 states. [2019-11-20 01:55:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:25,592 INFO L93 Difference]: Finished difference Result 343 states and 526 transitions. [2019-11-20 01:55:25,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:25,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 01:55:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:25,595 INFO L225 Difference]: With dead ends: 343 [2019-11-20 01:55:25,595 INFO L226 Difference]: Without dead ends: 190 [2019-11-20 01:55:25,596 INFO L630 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 [2019-11-20 01:55:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-20 01:55:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 172. [2019-11-20 01:55:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-20 01:55:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 261 transitions. [2019-11-20 01:55:25,605 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 261 transitions. Word has length 75 [2019-11-20 01:55:25,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:25,606 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 261 transitions. [2019-11-20 01:55:25,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 261 transitions. [2019-11-20 01:55:25,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 01:55:25,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:25,608 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:25,608 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:25,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:25,612 INFO L82 PathProgramCache]: Analyzing trace with hash -109432296, now seen corresponding path program 1 times [2019-11-20 01:55:25,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:25,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773187431] [2019-11-20 01:55:25,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:25,684 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:25,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773187431] [2019-11-20 01:55:25,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:25,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:25,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635718174] [2019-11-20 01:55:25,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:25,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:25,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:25,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:25,687 INFO L87 Difference]: Start difference. First operand 172 states and 261 transitions. Second operand 4 states. [2019-11-20 01:55:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:26,141 INFO L93 Difference]: Finished difference Result 342 states and 523 transitions. [2019-11-20 01:55:26,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:26,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 01:55:26,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:26,144 INFO L225 Difference]: With dead ends: 342 [2019-11-20 01:55:26,144 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 01:55:26,144 INFO L630 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 [2019-11-20 01:55:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 01:55:26,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 172. [2019-11-20 01:55:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-20 01:55:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 260 transitions. [2019-11-20 01:55:26,152 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 260 transitions. Word has length 75 [2019-11-20 01:55:26,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:26,153 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 260 transitions. [2019-11-20 01:55:26,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:26,153 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 260 transitions. [2019-11-20 01:55:26,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 01:55:26,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:26,155 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:26,155 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:26,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:26,155 INFO L82 PathProgramCache]: Analyzing trace with hash 536384015, now seen corresponding path program 1 times [2019-11-20 01:55:26,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:26,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850519038] [2019-11-20 01:55:26,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:26,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850519038] [2019-11-20 01:55:26,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:26,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:26,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341139799] [2019-11-20 01:55:26,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:26,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:26,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:26,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:26,208 INFO L87 Difference]: Start difference. First operand 172 states and 260 transitions. Second operand 4 states. [2019-11-20 01:55:26,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:26,609 INFO L93 Difference]: Finished difference Result 342 states and 521 transitions. [2019-11-20 01:55:26,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:26,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 01:55:26,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:26,612 INFO L225 Difference]: With dead ends: 342 [2019-11-20 01:55:26,612 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 01:55:26,612 INFO L630 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 [2019-11-20 01:55:26,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 01:55:26,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 172. [2019-11-20 01:55:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-20 01:55:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 259 transitions. [2019-11-20 01:55:26,618 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 259 transitions. Word has length 75 [2019-11-20 01:55:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:26,619 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 259 transitions. [2019-11-20 01:55:26,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 259 transitions. [2019-11-20 01:55:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 01:55:26,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:26,620 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:26,621 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:26,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:26,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1610185104, now seen corresponding path program 1 times [2019-11-20 01:55:26,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:26,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439615736] [2019-11-20 01:55:26,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:26,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439615736] [2019-11-20 01:55:26,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:26,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:26,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26937963] [2019-11-20 01:55:26,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:26,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:26,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:26,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:26,669 INFO L87 Difference]: Start difference. First operand 172 states and 259 transitions. Second operand 4 states. [2019-11-20 01:55:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:27,092 INFO L93 Difference]: Finished difference Result 342 states and 519 transitions. [2019-11-20 01:55:27,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:27,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 01:55:27,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:27,095 INFO L225 Difference]: With dead ends: 342 [2019-11-20 01:55:27,095 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 01:55:27,096 INFO L630 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 [2019-11-20 01:55:27,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 01:55:27,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 172. [2019-11-20 01:55:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-20 01:55:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 258 transitions. [2019-11-20 01:55:27,101 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 258 transitions. Word has length 76 [2019-11-20 01:55:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:27,102 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 258 transitions. [2019-11-20 01:55:27,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 258 transitions. [2019-11-20 01:55:27,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 01:55:27,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:27,103 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:27,104 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:27,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:27,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1118586762, now seen corresponding path program 1 times [2019-11-20 01:55:27,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:27,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039538847] [2019-11-20 01:55:27,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:27,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039538847] [2019-11-20 01:55:27,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:27,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:27,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114829986] [2019-11-20 01:55:27,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:27,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:27,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:27,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:27,151 INFO L87 Difference]: Start difference. First operand 172 states and 258 transitions. Second operand 4 states. [2019-11-20 01:55:27,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:27,618 INFO L93 Difference]: Finished difference Result 342 states and 517 transitions. [2019-11-20 01:55:27,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:27,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-20 01:55:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:27,621 INFO L225 Difference]: With dead ends: 342 [2019-11-20 01:55:27,621 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 01:55:27,621 INFO L630 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 [2019-11-20 01:55:27,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 01:55:27,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 172. [2019-11-20 01:55:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-20 01:55:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2019-11-20 01:55:27,627 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 77 [2019-11-20 01:55:27,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:27,628 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2019-11-20 01:55:27,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2019-11-20 01:55:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 01:55:27,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:27,629 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:27,629 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:27,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:27,629 INFO L82 PathProgramCache]: Analyzing trace with hash 364106507, now seen corresponding path program 1 times [2019-11-20 01:55:27,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:27,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322874385] [2019-11-20 01:55:27,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:55:27,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322874385] [2019-11-20 01:55:27,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:27,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:27,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546924780] [2019-11-20 01:55:27,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:27,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:27,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:27,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:27,688 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2019-11-20 01:55:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:28,095 INFO L93 Difference]: Finished difference Result 332 states and 502 transitions. [2019-11-20 01:55:28,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:28,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-20 01:55:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:28,098 INFO L225 Difference]: With dead ends: 332 [2019-11-20 01:55:28,098 INFO L226 Difference]: Without dead ends: 179 [2019-11-20 01:55:28,098 INFO L630 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 [2019-11-20 01:55:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-20 01:55:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 172. [2019-11-20 01:55:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-20 01:55:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2019-11-20 01:55:28,106 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 78 [2019-11-20 01:55:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:28,107 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2019-11-20 01:55:28,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2019-11-20 01:55:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 01:55:28,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:28,108 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:28,109 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:28,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:28,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1853928521, now seen corresponding path program 1 times [2019-11-20 01:55:28,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:28,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95278595] [2019-11-20 01:55:28,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:28,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95278595] [2019-11-20 01:55:28,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:28,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:28,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466212892] [2019-11-20 01:55:28,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:28,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:28,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:28,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:28,192 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2019-11-20 01:55:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:28,693 INFO L93 Difference]: Finished difference Result 435 states and 661 transitions. [2019-11-20 01:55:28,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:28,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-20 01:55:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:28,696 INFO L225 Difference]: With dead ends: 435 [2019-11-20 01:55:28,696 INFO L226 Difference]: Without dead ends: 282 [2019-11-20 01:55:28,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-20 01:55:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 213. [2019-11-20 01:55:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-20 01:55:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 330 transitions. [2019-11-20 01:55:28,704 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 330 transitions. Word has length 83 [2019-11-20 01:55:28,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:28,705 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 330 transitions. [2019-11-20 01:55:28,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:28,705 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 330 transitions. [2019-11-20 01:55:28,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 01:55:28,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:28,706 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:28,707 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:28,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:28,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2102075015, now seen corresponding path program 1 times [2019-11-20 01:55:28,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:28,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625374962] [2019-11-20 01:55:28,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:28,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625374962] [2019-11-20 01:55:28,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:28,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:28,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259838894] [2019-11-20 01:55:28,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:28,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:28,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:28,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:28,808 INFO L87 Difference]: Start difference. First operand 213 states and 330 transitions. Second operand 4 states. [2019-11-20 01:55:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:29,200 INFO L93 Difference]: Finished difference Result 456 states and 713 transitions. [2019-11-20 01:55:29,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:29,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-20 01:55:29,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:29,203 INFO L225 Difference]: With dead ends: 456 [2019-11-20 01:55:29,204 INFO L226 Difference]: Without dead ends: 262 [2019-11-20 01:55:29,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-20 01:55:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 237. [2019-11-20 01:55:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-20 01:55:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 372 transitions. [2019-11-20 01:55:29,211 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 372 transitions. Word has length 83 [2019-11-20 01:55:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:29,211 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 372 transitions. [2019-11-20 01:55:29,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 372 transitions. [2019-11-20 01:55:29,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 01:55:29,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:29,213 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:29,213 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:29,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:29,213 INFO L82 PathProgramCache]: Analyzing trace with hash 399512031, now seen corresponding path program 1 times [2019-11-20 01:55:29,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:29,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38270831] [2019-11-20 01:55:29,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:29,290 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:29,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38270831] [2019-11-20 01:55:29,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:29,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:29,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119340086] [2019-11-20 01:55:29,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:29,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:29,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:29,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:29,293 INFO L87 Difference]: Start difference. First operand 237 states and 372 transitions. Second operand 4 states. [2019-11-20 01:55:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:29,907 INFO L93 Difference]: Finished difference Result 515 states and 805 transitions. [2019-11-20 01:55:29,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:29,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-20 01:55:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:29,910 INFO L225 Difference]: With dead ends: 515 [2019-11-20 01:55:29,911 INFO L226 Difference]: Without dead ends: 297 [2019-11-20 01:55:29,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-20 01:55:29,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 238. [2019-11-20 01:55:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-20 01:55:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 373 transitions. [2019-11-20 01:55:29,920 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 373 transitions. Word has length 84 [2019-11-20 01:55:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:29,920 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 373 transitions. [2019-11-20 01:55:29,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 373 transitions. [2019-11-20 01:55:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 01:55:29,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:29,922 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:29,922 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:29,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:29,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2076478015, now seen corresponding path program 1 times [2019-11-20 01:55:29,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:29,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187034658] [2019-11-20 01:55:29,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:29,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187034658] [2019-11-20 01:55:29,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:29,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:29,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814969594] [2019-11-20 01:55:29,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:29,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:29,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:29,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:29,998 INFO L87 Difference]: Start difference. First operand 238 states and 373 transitions. Second operand 4 states. [2019-11-20 01:55:30,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:30,468 INFO L93 Difference]: Finished difference Result 516 states and 805 transitions. [2019-11-20 01:55:30,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:30,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 01:55:30,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:30,471 INFO L225 Difference]: With dead ends: 516 [2019-11-20 01:55:30,471 INFO L226 Difference]: Without dead ends: 297 [2019-11-20 01:55:30,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-20 01:55:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 238. [2019-11-20 01:55:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-20 01:55:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 372 transitions. [2019-11-20 01:55:30,478 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 372 transitions. Word has length 96 [2019-11-20 01:55:30,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:30,479 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 372 transitions. [2019-11-20 01:55:30,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:30,479 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 372 transitions. [2019-11-20 01:55:30,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 01:55:30,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:30,481 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:30,481 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:30,481 INFO L82 PathProgramCache]: Analyzing trace with hash -689692605, now seen corresponding path program 1 times [2019-11-20 01:55:30,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:30,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005900898] [2019-11-20 01:55:30,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:30,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005900898] [2019-11-20 01:55:30,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:30,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:30,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613468365] [2019-11-20 01:55:30,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:30,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:30,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:30,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:30,543 INFO L87 Difference]: Start difference. First operand 238 states and 372 transitions. Second operand 4 states. [2019-11-20 01:55:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:30,982 INFO L93 Difference]: Finished difference Result 482 states and 754 transitions. [2019-11-20 01:55:30,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:30,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 01:55:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:30,984 INFO L225 Difference]: With dead ends: 482 [2019-11-20 01:55:30,984 INFO L226 Difference]: Without dead ends: 263 [2019-11-20 01:55:30,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-11-20 01:55:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 238. [2019-11-20 01:55:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-20 01:55:30,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 371 transitions. [2019-11-20 01:55:30,991 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 371 transitions. Word has length 96 [2019-11-20 01:55:30,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:30,991 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 371 transitions. [2019-11-20 01:55:30,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 371 transitions. [2019-11-20 01:55:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 01:55:30,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:30,993 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:30,993 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:30,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:30,994 INFO L82 PathProgramCache]: Analyzing trace with hash -973453317, now seen corresponding path program 1 times [2019-11-20 01:55:30,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:30,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906558722] [2019-11-20 01:55:30,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:31,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906558722] [2019-11-20 01:55:31,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:31,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:31,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383288859] [2019-11-20 01:55:31,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:31,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:31,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:31,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:31,059 INFO L87 Difference]: Start difference. First operand 238 states and 371 transitions. Second operand 4 states. [2019-11-20 01:55:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:31,484 INFO L93 Difference]: Finished difference Result 515 states and 800 transitions. [2019-11-20 01:55:31,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:31,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 01:55:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:31,486 INFO L225 Difference]: With dead ends: 515 [2019-11-20 01:55:31,486 INFO L226 Difference]: Without dead ends: 296 [2019-11-20 01:55:31,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:31,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-20 01:55:31,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 238. [2019-11-20 01:55:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-20 01:55:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 370 transitions. [2019-11-20 01:55:31,494 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 370 transitions. Word has length 97 [2019-11-20 01:55:31,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:31,495 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 370 transitions. [2019-11-20 01:55:31,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 370 transitions. [2019-11-20 01:55:31,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 01:55:31,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:31,497 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:31,497 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:31,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:31,497 INFO L82 PathProgramCache]: Analyzing trace with hash -930124496, now seen corresponding path program 1 times [2019-11-20 01:55:31,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:31,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048003206] [2019-11-20 01:55:31,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:31,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048003206] [2019-11-20 01:55:31,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:31,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:31,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927459234] [2019-11-20 01:55:31,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:31,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:31,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:31,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:31,585 INFO L87 Difference]: Start difference. First operand 238 states and 370 transitions. Second operand 4 states. [2019-11-20 01:55:32,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:32,245 INFO L93 Difference]: Finished difference Result 513 states and 796 transitions. [2019-11-20 01:55:32,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:32,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 01:55:32,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:32,248 INFO L225 Difference]: With dead ends: 513 [2019-11-20 01:55:32,248 INFO L226 Difference]: Without dead ends: 294 [2019-11-20 01:55:32,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-20 01:55:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 238. [2019-11-20 01:55:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-20 01:55:32,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 369 transitions. [2019-11-20 01:55:32,256 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 369 transitions. Word has length 97 [2019-11-20 01:55:32,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:32,256 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 369 transitions. [2019-11-20 01:55:32,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 369 transitions. [2019-11-20 01:55:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 01:55:32,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:32,258 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:32,258 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:32,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:32,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1040162288, now seen corresponding path program 1 times [2019-11-20 01:55:32,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:32,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382263450] [2019-11-20 01:55:32,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:32,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382263450] [2019-11-20 01:55:32,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:32,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:32,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950981732] [2019-11-20 01:55:32,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:32,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:32,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:32,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:32,338 INFO L87 Difference]: Start difference. First operand 238 states and 369 transitions. Second operand 4 states. [2019-11-20 01:55:32,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:32,956 INFO L93 Difference]: Finished difference Result 512 states and 793 transitions. [2019-11-20 01:55:32,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:32,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 01:55:32,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:32,959 INFO L225 Difference]: With dead ends: 512 [2019-11-20 01:55:32,959 INFO L226 Difference]: Without dead ends: 293 [2019-11-20 01:55:32,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-20 01:55:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 238. [2019-11-20 01:55:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-11-20 01:55:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 368 transitions. [2019-11-20 01:55:32,968 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 368 transitions. Word has length 97 [2019-11-20 01:55:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:32,968 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 368 transitions. [2019-11-20 01:55:32,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 368 transitions. [2019-11-20 01:55:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 01:55:32,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:32,970 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:32,970 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:32,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:32,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1685978599, now seen corresponding path program 1 times [2019-11-20 01:55:32,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:32,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731198170] [2019-11-20 01:55:32,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:55:33,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731198170] [2019-11-20 01:55:33,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:33,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 01:55:33,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139682164] [2019-11-20 01:55:33,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 01:55:33,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:33,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 01:55:33,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:33,081 INFO L87 Difference]: Start difference. First operand 238 states and 368 transitions. Second operand 5 states. [2019-11-20 01:55:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:33,786 INFO L93 Difference]: Finished difference Result 478 states and 744 transitions. [2019-11-20 01:55:33,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 01:55:33,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-11-20 01:55:33,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:33,789 INFO L225 Difference]: With dead ends: 478 [2019-11-20 01:55:33,789 INFO L226 Difference]: Without dead ends: 259 [2019-11-20 01:55:33,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:55:33,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-20 01:55:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2019-11-20 01:55:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-20 01:55:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 394 transitions. [2019-11-20 01:55:33,798 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 394 transitions. Word has length 97 [2019-11-20 01:55:33,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:33,798 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 394 transitions. [2019-11-20 01:55:33,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 01:55:33,798 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 394 transitions. [2019-11-20 01:55:33,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 01:55:33,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:33,800 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:33,800 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:33,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:33,801 INFO L82 PathProgramCache]: Analyzing trace with hash -889449746, now seen corresponding path program 1 times [2019-11-20 01:55:33,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:33,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555778785] [2019-11-20 01:55:33,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:33,865 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:33,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555778785] [2019-11-20 01:55:33,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:33,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:33,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213295076] [2019-11-20 01:55:33,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:33,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:33,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:33,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:33,867 INFO L87 Difference]: Start difference. First operand 258 states and 394 transitions. Second operand 4 states. [2019-11-20 01:55:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:34,215 INFO L93 Difference]: Finished difference Result 519 states and 794 transitions. [2019-11-20 01:55:34,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:34,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 01:55:34,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:34,218 INFO L225 Difference]: With dead ends: 519 [2019-11-20 01:55:34,218 INFO L226 Difference]: Without dead ends: 280 [2019-11-20 01:55:34,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-20 01:55:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 258. [2019-11-20 01:55:34,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-20 01:55:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 393 transitions. [2019-11-20 01:55:34,226 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 393 transitions. Word has length 97 [2019-11-20 01:55:34,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:34,227 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 393 transitions. [2019-11-20 01:55:34,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 393 transitions. [2019-11-20 01:55:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 01:55:34,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:34,229 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2019-11-20 01:55:34,229 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:34,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:34,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1080837038, now seen corresponding path program 1 times [2019-11-20 01:55:34,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:34,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408348129] [2019-11-20 01:55:34,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:34,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408348129] [2019-11-20 01:55:34,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:34,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:34,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128450117] [2019-11-20 01:55:34,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:34,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:34,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:34,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:34,300 INFO L87 Difference]: Start difference. First operand 258 states and 393 transitions. Second operand 4 states. [2019-11-20 01:55:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:34,709 INFO L93 Difference]: Finished difference Result 518 states and 791 transitions. [2019-11-20 01:55:34,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:34,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 01:55:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:34,711 INFO L225 Difference]: With dead ends: 518 [2019-11-20 01:55:34,711 INFO L226 Difference]: Without dead ends: 279 [2019-11-20 01:55:34,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:34,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-20 01:55:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-11-20 01:55:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-20 01:55:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 392 transitions. [2019-11-20 01:55:34,721 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 392 transitions. Word has length 97 [2019-11-20 01:55:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:34,721 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 392 transitions. [2019-11-20 01:55:34,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 392 transitions. [2019-11-20 01:55:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 01:55:34,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:34,723 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:34,724 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:34,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:34,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1274184123, now seen corresponding path program 1 times [2019-11-20 01:55:34,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:34,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604084372] [2019-11-20 01:55:34,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:34,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604084372] [2019-11-20 01:55:34,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:34,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:34,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239224687] [2019-11-20 01:55:34,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:34,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:34,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:34,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:34,788 INFO L87 Difference]: Start difference. First operand 258 states and 392 transitions. Second operand 4 states. [2019-11-20 01:55:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:35,192 INFO L93 Difference]: Finished difference Result 552 states and 838 transitions. [2019-11-20 01:55:35,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:35,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 01:55:35,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:35,194 INFO L225 Difference]: With dead ends: 552 [2019-11-20 01:55:35,195 INFO L226 Difference]: Without dead ends: 313 [2019-11-20 01:55:35,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-20 01:55:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 258. [2019-11-20 01:55:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-20 01:55:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 391 transitions. [2019-11-20 01:55:35,203 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 391 transitions. Word has length 98 [2019-11-20 01:55:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:35,203 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 391 transitions. [2019-11-20 01:55:35,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 391 transitions. [2019-11-20 01:55:35,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 01:55:35,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:35,204 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:35,205 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:35,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:35,205 INFO L82 PathProgramCache]: Analyzing trace with hash -13266873, now seen corresponding path program 1 times [2019-11-20 01:55:35,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:35,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536739692] [2019-11-20 01:55:35,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:35,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536739692] [2019-11-20 01:55:35,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:35,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:35,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16506983] [2019-11-20 01:55:35,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:35,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:35,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:35,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:35,300 INFO L87 Difference]: Start difference. First operand 258 states and 391 transitions. Second operand 4 states. [2019-11-20 01:55:35,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:35,702 INFO L93 Difference]: Finished difference Result 518 states and 787 transitions. [2019-11-20 01:55:35,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:35,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 01:55:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:35,705 INFO L225 Difference]: With dead ends: 518 [2019-11-20 01:55:35,705 INFO L226 Difference]: Without dead ends: 279 [2019-11-20 01:55:35,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:35,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-20 01:55:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-11-20 01:55:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-20 01:55:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 390 transitions. [2019-11-20 01:55:35,713 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 390 transitions. Word has length 98 [2019-11-20 01:55:35,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:35,714 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 390 transitions. [2019-11-20 01:55:35,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 390 transitions. [2019-11-20 01:55:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 01:55:35,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:35,715 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:35,715 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:35,715 INFO L82 PathProgramCache]: Analyzing trace with hash 577756340, now seen corresponding path program 1 times [2019-11-20 01:55:35,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:35,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108289966] [2019-11-20 01:55:35,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:35,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108289966] [2019-11-20 01:55:35,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:35,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:35,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48932863] [2019-11-20 01:55:35,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:35,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:35,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:35,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:35,786 INFO L87 Difference]: Start difference. First operand 258 states and 390 transitions. Second operand 4 states. [2019-11-20 01:55:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:36,208 INFO L93 Difference]: Finished difference Result 552 states and 834 transitions. [2019-11-20 01:55:36,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:36,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 01:55:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:36,210 INFO L225 Difference]: With dead ends: 552 [2019-11-20 01:55:36,210 INFO L226 Difference]: Without dead ends: 313 [2019-11-20 01:55:36,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:36,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-20 01:55:36,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 258. [2019-11-20 01:55:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-20 01:55:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 389 transitions. [2019-11-20 01:55:36,219 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 389 transitions. Word has length 99 [2019-11-20 01:55:36,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:36,219 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 389 transitions. [2019-11-20 01:55:36,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 389 transitions. [2019-11-20 01:55:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 01:55:36,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:36,220 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:36,220 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:36,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:36,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1011485426, now seen corresponding path program 1 times [2019-11-20 01:55:36,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:36,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597510703] [2019-11-20 01:55:36,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:36,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597510703] [2019-11-20 01:55:36,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:36,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:36,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986729709] [2019-11-20 01:55:36,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:36,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:36,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:36,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:36,284 INFO L87 Difference]: Start difference. First operand 258 states and 389 transitions. Second operand 4 states. [2019-11-20 01:55:36,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:36,687 INFO L93 Difference]: Finished difference Result 518 states and 783 transitions. [2019-11-20 01:55:36,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:36,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 01:55:36,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:36,689 INFO L225 Difference]: With dead ends: 518 [2019-11-20 01:55:36,689 INFO L226 Difference]: Without dead ends: 279 [2019-11-20 01:55:36,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:36,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-20 01:55:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-11-20 01:55:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-20 01:55:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 388 transitions. [2019-11-20 01:55:36,706 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 388 transitions. Word has length 99 [2019-11-20 01:55:36,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:36,707 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 388 transitions. [2019-11-20 01:55:36,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 388 transitions. [2019-11-20 01:55:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 01:55:36,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:36,709 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:36,709 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:36,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:36,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2114539050, now seen corresponding path program 1 times [2019-11-20 01:55:36,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:36,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922355226] [2019-11-20 01:55:36,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:36,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922355226] [2019-11-20 01:55:36,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:36,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:36,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248520281] [2019-11-20 01:55:36,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:36,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:36,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:36,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:36,770 INFO L87 Difference]: Start difference. First operand 258 states and 388 transitions. Second operand 4 states. [2019-11-20 01:55:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:37,248 INFO L93 Difference]: Finished difference Result 552 states and 830 transitions. [2019-11-20 01:55:37,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:37,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-20 01:55:37,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:37,253 INFO L225 Difference]: With dead ends: 552 [2019-11-20 01:55:37,254 INFO L226 Difference]: Without dead ends: 313 [2019-11-20 01:55:37,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:37,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-20 01:55:37,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 258. [2019-11-20 01:55:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-20 01:55:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 387 transitions. [2019-11-20 01:55:37,262 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 387 transitions. Word has length 100 [2019-11-20 01:55:37,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:37,263 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 387 transitions. [2019-11-20 01:55:37,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 387 transitions. [2019-11-20 01:55:37,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 01:55:37,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:37,264 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:37,264 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:37,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:37,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1619728468, now seen corresponding path program 1 times [2019-11-20 01:55:37,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:37,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135794545] [2019-11-20 01:55:37,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:37,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135794545] [2019-11-20 01:55:37,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:37,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:37,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92599348] [2019-11-20 01:55:37,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:37,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:37,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:37,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:37,333 INFO L87 Difference]: Start difference. First operand 258 states and 387 transitions. Second operand 4 states. [2019-11-20 01:55:37,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:37,712 INFO L93 Difference]: Finished difference Result 518 states and 779 transitions. [2019-11-20 01:55:37,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:37,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-20 01:55:37,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:37,714 INFO L225 Difference]: With dead ends: 518 [2019-11-20 01:55:37,714 INFO L226 Difference]: Without dead ends: 279 [2019-11-20 01:55:37,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-20 01:55:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 258. [2019-11-20 01:55:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-20 01:55:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 386 transitions. [2019-11-20 01:55:37,723 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 386 transitions. Word has length 100 [2019-11-20 01:55:37,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:37,723 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 386 transitions. [2019-11-20 01:55:37,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 386 transitions. [2019-11-20 01:55:37,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 01:55:37,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:37,725 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:37,725 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:37,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:37,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1823601287, now seen corresponding path program 1 times [2019-11-20 01:55:37,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:37,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963744167] [2019-11-20 01:55:37,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:37,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963744167] [2019-11-20 01:55:37,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:37,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:37,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745145003] [2019-11-20 01:55:37,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:37,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:37,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:37,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:37,796 INFO L87 Difference]: Start difference. First operand 258 states and 386 transitions. Second operand 4 states. [2019-11-20 01:55:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:38,163 INFO L93 Difference]: Finished difference Result 542 states and 814 transitions. [2019-11-20 01:55:38,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:38,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-20 01:55:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:38,165 INFO L225 Difference]: With dead ends: 542 [2019-11-20 01:55:38,165 INFO L226 Difference]: Without dead ends: 303 [2019-11-20 01:55:38,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-20 01:55:38,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 258. [2019-11-20 01:55:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-20 01:55:38,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 385 transitions. [2019-11-20 01:55:38,174 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 385 transitions. Word has length 101 [2019-11-20 01:55:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:38,174 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 385 transitions. [2019-11-20 01:55:38,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 385 transitions. [2019-11-20 01:55:38,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 01:55:38,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:38,175 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:38,175 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:38,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:38,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1621777353, now seen corresponding path program 1 times [2019-11-20 01:55:38,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:38,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77823541] [2019-11-20 01:55:38,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:38,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77823541] [2019-11-20 01:55:38,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:38,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:38,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658242721] [2019-11-20 01:55:38,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:38,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:38,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:38,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:38,260 INFO L87 Difference]: Start difference. First operand 258 states and 385 transitions. Second operand 4 states. [2019-11-20 01:55:38,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:38,638 INFO L93 Difference]: Finished difference Result 508 states and 763 transitions. [2019-11-20 01:55:38,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:38,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-20 01:55:38,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:38,640 INFO L225 Difference]: With dead ends: 508 [2019-11-20 01:55:38,640 INFO L226 Difference]: Without dead ends: 269 [2019-11-20 01:55:38,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:38,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-20 01:55:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 258. [2019-11-20 01:55:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-20 01:55:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 384 transitions. [2019-11-20 01:55:38,650 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 384 transitions. Word has length 101 [2019-11-20 01:55:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:38,650 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 384 transitions. [2019-11-20 01:55:38,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 384 transitions. [2019-11-20 01:55:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 01:55:38,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:38,652 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:38,653 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:38,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1479826643, now seen corresponding path program 1 times [2019-11-20 01:55:38,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:38,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006020309] [2019-11-20 01:55:38,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 01:55:38,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006020309] [2019-11-20 01:55:38,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:38,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:38,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63865214] [2019-11-20 01:55:38,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:38,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:38,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:38,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:38,797 INFO L87 Difference]: Start difference. First operand 258 states and 384 transitions. Second operand 4 states. [2019-11-20 01:55:39,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:39,270 INFO L93 Difference]: Finished difference Result 542 states and 810 transitions. [2019-11-20 01:55:39,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:39,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-20 01:55:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:39,272 INFO L225 Difference]: With dead ends: 542 [2019-11-20 01:55:39,272 INFO L226 Difference]: Without dead ends: 303 [2019-11-20 01:55:39,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-20 01:55:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 258. [2019-11-20 01:55:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-20 01:55:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 383 transitions. [2019-11-20 01:55:39,280 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 383 transitions. Word has length 105 [2019-11-20 01:55:39,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:39,280 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 383 transitions. [2019-11-20 01:55:39,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 383 transitions. [2019-11-20 01:55:39,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 01:55:39,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:39,282 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:39,282 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:39,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:39,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1534219541, now seen corresponding path program 1 times [2019-11-20 01:55:39,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:39,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994896784] [2019-11-20 01:55:39,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 01:55:39,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994896784] [2019-11-20 01:55:39,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:39,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:55:39,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631292665] [2019-11-20 01:55:39,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:55:39,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:39,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:55:39,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:55:39,348 INFO L87 Difference]: Start difference. First operand 258 states and 383 transitions. Second operand 3 states. [2019-11-20 01:55:39,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:39,442 INFO L93 Difference]: Finished difference Result 734 states and 1104 transitions. [2019-11-20 01:55:39,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:55:39,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-20 01:55:39,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:39,446 INFO L225 Difference]: With dead ends: 734 [2019-11-20 01:55:39,447 INFO L226 Difference]: Without dead ends: 495 [2019-11-20 01:55:39,447 INFO L630 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 [2019-11-20 01:55:39,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-11-20 01:55:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2019-11-20 01:55:39,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-11-20 01:55:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 732 transitions. [2019-11-20 01:55:39,463 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 732 transitions. Word has length 105 [2019-11-20 01:55:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:39,464 INFO L462 AbstractCegarLoop]: Abstraction has 495 states and 732 transitions. [2019-11-20 01:55:39,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:55:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 732 transitions. [2019-11-20 01:55:39,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 01:55:39,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:39,466 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:39,466 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:39,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:39,466 INFO L82 PathProgramCache]: Analyzing trace with hash 958806617, now seen corresponding path program 1 times [2019-11-20 01:55:39,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:39,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300194966] [2019-11-20 01:55:39,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 01:55:39,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300194966] [2019-11-20 01:55:39,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:39,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:55:39,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408940361] [2019-11-20 01:55:39,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:55:39,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:39,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:55:39,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:55:39,532 INFO L87 Difference]: Start difference. First operand 495 states and 732 transitions. Second operand 3 states. [2019-11-20 01:55:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:39,631 INFO L93 Difference]: Finished difference Result 1208 states and 1802 transitions. [2019-11-20 01:55:39,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:55:39,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-20 01:55:39,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:39,636 INFO L225 Difference]: With dead ends: 1208 [2019-11-20 01:55:39,636 INFO L226 Difference]: Without dead ends: 732 [2019-11-20 01:55:39,637 INFO L630 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 [2019-11-20 01:55:39,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-11-20 01:55:39,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2019-11-20 01:55:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2019-11-20 01:55:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1082 transitions. [2019-11-20 01:55:39,658 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1082 transitions. Word has length 124 [2019-11-20 01:55:39,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:39,659 INFO L462 AbstractCegarLoop]: Abstraction has 732 states and 1082 transitions. [2019-11-20 01:55:39,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:55:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1082 transitions. [2019-11-20 01:55:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-20 01:55:39,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:39,662 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:39,662 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:39,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1787782109, now seen corresponding path program 1 times [2019-11-20 01:55:39,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:39,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791517632] [2019-11-20 01:55:39,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-20 01:55:39,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791517632] [2019-11-20 01:55:39,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:39,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:55:39,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292337531] [2019-11-20 01:55:39,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:55:39,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:39,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:55:39,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:55:39,759 INFO L87 Difference]: Start difference. First operand 732 states and 1082 transitions. Second operand 3 states. [2019-11-20 01:55:39,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:39,888 INFO L93 Difference]: Finished difference Result 1675 states and 2491 transitions. [2019-11-20 01:55:39,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:55:39,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-20 01:55:39,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:39,895 INFO L225 Difference]: With dead ends: 1675 [2019-11-20 01:55:39,895 INFO L226 Difference]: Without dead ends: 962 [2019-11-20 01:55:39,896 INFO L630 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 [2019-11-20 01:55:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-11-20 01:55:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2019-11-20 01:55:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-11-20 01:55:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1420 transitions. [2019-11-20 01:55:39,933 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1420 transitions. Word has length 167 [2019-11-20 01:55:39,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:39,933 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 1420 transitions. [2019-11-20 01:55:39,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:55:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1420 transitions. [2019-11-20 01:55:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-20 01:55:39,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:39,938 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:39,938 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:39,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:39,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1469041126, now seen corresponding path program 1 times [2019-11-20 01:55:39,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:39,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509647213] [2019-11-20 01:55:39,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-11-20 01:55:40,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509647213] [2019-11-20 01:55:40,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:40,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:55:40,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980579479] [2019-11-20 01:55:40,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:55:40,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:40,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:55:40,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:55:40,066 INFO L87 Difference]: Start difference. First operand 962 states and 1420 transitions. Second operand 3 states. [2019-11-20 01:55:40,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:40,184 INFO L93 Difference]: Finished difference Result 2142 states and 3178 transitions. [2019-11-20 01:55:40,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:55:40,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-11-20 01:55:40,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:40,192 INFO L225 Difference]: With dead ends: 2142 [2019-11-20 01:55:40,192 INFO L226 Difference]: Without dead ends: 1199 [2019-11-20 01:55:40,194 INFO L630 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 [2019-11-20 01:55:40,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-11-20 01:55:40,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2019-11-20 01:55:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2019-11-20 01:55:40,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1772 transitions. [2019-11-20 01:55:40,233 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1772 transitions. Word has length 206 [2019-11-20 01:55:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:40,234 INFO L462 AbstractCegarLoop]: Abstraction has 1199 states and 1772 transitions. [2019-11-20 01:55:40,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:55:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1772 transitions. [2019-11-20 01:55:40,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-20 01:55:40,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:40,239 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:40,239 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:40,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:40,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1351692763, now seen corresponding path program 1 times [2019-11-20 01:55:40,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:40,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376939659] [2019-11-20 01:55:40,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-11-20 01:55:40,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376939659] [2019-11-20 01:55:40,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:40,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:55:40,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540267436] [2019-11-20 01:55:40,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:55:40,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:40,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:55:40,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:55:40,369 INFO L87 Difference]: Start difference. First operand 1199 states and 1772 transitions. Second operand 3 states. [2019-11-20 01:55:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:40,488 INFO L93 Difference]: Finished difference Result 2616 states and 3882 transitions. [2019-11-20 01:55:40,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:55:40,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-11-20 01:55:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:40,498 INFO L225 Difference]: With dead ends: 2616 [2019-11-20 01:55:40,498 INFO L226 Difference]: Without dead ends: 1436 [2019-11-20 01:55:40,500 INFO L630 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 [2019-11-20 01:55:40,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2019-11-20 01:55:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1436. [2019-11-20 01:55:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2019-11-20 01:55:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2125 transitions. [2019-11-20 01:55:40,592 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2125 transitions. Word has length 248 [2019-11-20 01:55:40,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:40,594 INFO L462 AbstractCegarLoop]: Abstraction has 1436 states and 2125 transitions. [2019-11-20 01:55:40,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:55:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2125 transitions. [2019-11-20 01:55:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-20 01:55:40,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:40,599 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:40,600 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:40,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:40,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2051139709, now seen corresponding path program 1 times [2019-11-20 01:55:40,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:40,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019609836] [2019-11-20 01:55:40,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-11-20 01:55:40,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019609836] [2019-11-20 01:55:40,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:40,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:40,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772355311] [2019-11-20 01:55:40,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:40,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:40,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:40,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:40,794 INFO L87 Difference]: Start difference. First operand 1436 states and 2125 transitions. Second operand 4 states. [2019-11-20 01:55:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:41,491 INFO L93 Difference]: Finished difference Result 3480 states and 5177 transitions. [2019-11-20 01:55:41,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:41,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 292 [2019-11-20 01:55:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:41,504 INFO L225 Difference]: With dead ends: 3480 [2019-11-20 01:55:41,504 INFO L226 Difference]: Without dead ends: 2063 [2019-11-20 01:55:41,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:41,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2019-11-20 01:55:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 1682. [2019-11-20 01:55:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2019-11-20 01:55:41,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2575 transitions. [2019-11-20 01:55:41,562 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2575 transitions. Word has length 292 [2019-11-20 01:55:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:41,564 INFO L462 AbstractCegarLoop]: Abstraction has 1682 states and 2575 transitions. [2019-11-20 01:55:41,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2575 transitions. [2019-11-20 01:55:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-20 01:55:41,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:41,574 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:41,574 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:41,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:41,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1659055937, now seen corresponding path program 1 times [2019-11-20 01:55:41,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:41,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146459573] [2019-11-20 01:55:41,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-11-20 01:55:41,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146459573] [2019-11-20 01:55:41,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:41,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:55:41,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362971562] [2019-11-20 01:55:41,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:55:41,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:41,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:55:41,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:55:41,750 INFO L87 Difference]: Start difference. First operand 1682 states and 2575 transitions. Second operand 3 states. [2019-11-20 01:55:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:41,901 INFO L93 Difference]: Finished difference Result 3617 states and 5554 transitions. [2019-11-20 01:55:41,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:55:41,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-11-20 01:55:41,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:41,914 INFO L225 Difference]: With dead ends: 3617 [2019-11-20 01:55:41,914 INFO L226 Difference]: Without dead ends: 1954 [2019-11-20 01:55:41,917 INFO L630 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 [2019-11-20 01:55:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-11-20 01:55:41,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1954. [2019-11-20 01:55:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-11-20 01:55:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2989 transitions. [2019-11-20 01:55:41,970 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2989 transitions. Word has length 292 [2019-11-20 01:55:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:41,971 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 2989 transitions. [2019-11-20 01:55:41,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:55:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2989 transitions. [2019-11-20 01:55:41,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-20 01:55:41,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:41,978 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:41,978 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:41,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:41,978 INFO L82 PathProgramCache]: Analyzing trace with hash 305516341, now seen corresponding path program 1 times [2019-11-20 01:55:41,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:41,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075106654] [2019-11-20 01:55:41,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-11-20 01:55:42,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075106654] [2019-11-20 01:55:42,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:42,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:55:42,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078166941] [2019-11-20 01:55:42,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:55:42,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:42,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:55:42,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:55:42,261 INFO L87 Difference]: Start difference. First operand 1954 states and 2989 transitions. Second operand 3 states. [2019-11-20 01:55:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:42,407 INFO L93 Difference]: Finished difference Result 4167 states and 6391 transitions. [2019-11-20 01:55:42,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:55:42,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-20 01:55:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:42,421 INFO L225 Difference]: With dead ends: 4167 [2019-11-20 01:55:42,421 INFO L226 Difference]: Without dead ends: 2232 [2019-11-20 01:55:42,423 INFO L630 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 [2019-11-20 01:55:42,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2019-11-20 01:55:42,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2232. [2019-11-20 01:55:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2232 states. [2019-11-20 01:55:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 3419 transitions. [2019-11-20 01:55:42,487 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 3419 transitions. Word has length 332 [2019-11-20 01:55:42,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:42,488 INFO L462 AbstractCegarLoop]: Abstraction has 2232 states and 3419 transitions. [2019-11-20 01:55:42,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:55:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 3419 transitions. [2019-11-20 01:55:42,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-11-20 01:55:42,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:42,494 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:42,494 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:42,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:42,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1358098452, now seen corresponding path program 1 times [2019-11-20 01:55:42,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:42,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324582810] [2019-11-20 01:55:42,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2019-11-20 01:55:42,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324582810] [2019-11-20 01:55:42,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:42,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:55:42,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298069636] [2019-11-20 01:55:42,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:55:42,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:42,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:55:42,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:55:42,718 INFO L87 Difference]: Start difference. First operand 2232 states and 3419 transitions. Second operand 3 states. [2019-11-20 01:55:42,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:42,855 INFO L93 Difference]: Finished difference Result 4723 states and 7251 transitions. [2019-11-20 01:55:42,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:55:42,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-11-20 01:55:42,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:42,869 INFO L225 Difference]: With dead ends: 4723 [2019-11-20 01:55:42,869 INFO L226 Difference]: Without dead ends: 2510 [2019-11-20 01:55:42,871 INFO L630 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 [2019-11-20 01:55:42,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2019-11-20 01:55:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2510. [2019-11-20 01:55:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2510 states. [2019-11-20 01:55:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 3850 transitions. [2019-11-20 01:55:42,942 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 3850 transitions. Word has length 375 [2019-11-20 01:55:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:42,943 INFO L462 AbstractCegarLoop]: Abstraction has 2510 states and 3850 transitions. [2019-11-20 01:55:42,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:55:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 3850 transitions. [2019-11-20 01:55:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-11-20 01:55:42,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:42,950 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:42,950 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:42,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:42,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2117366755, now seen corresponding path program 1 times [2019-11-20 01:55:42,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:42,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23990087] [2019-11-20 01:55:42,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:43,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1565 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2019-11-20 01:55:43,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23990087] [2019-11-20 01:55:43,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:43,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:55:43,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863867904] [2019-11-20 01:55:43,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:55:43,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:43,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:55:43,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:55:43,273 INFO L87 Difference]: Start difference. First operand 2510 states and 3850 transitions. Second operand 3 states. [2019-11-20 01:55:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:43,433 INFO L93 Difference]: Finished difference Result 5274 states and 8106 transitions. [2019-11-20 01:55:43,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:55:43,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2019-11-20 01:55:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:43,453 INFO L225 Difference]: With dead ends: 5274 [2019-11-20 01:55:43,459 INFO L226 Difference]: Without dead ends: 2783 [2019-11-20 01:55:43,462 INFO L630 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 [2019-11-20 01:55:43,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2783 states. [2019-11-20 01:55:43,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2783 to 2783. [2019-11-20 01:55:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2783 states. [2019-11-20 01:55:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 4265 transitions. [2019-11-20 01:55:43,535 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 4265 transitions. Word has length 420 [2019-11-20 01:55:43,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:43,536 INFO L462 AbstractCegarLoop]: Abstraction has 2783 states and 4265 transitions. [2019-11-20 01:55:43,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:55:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 4265 transitions. [2019-11-20 01:55:43,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-11-20 01:55:43,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:43,545 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:43,545 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:43,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:43,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1441569685, now seen corresponding path program 1 times [2019-11-20 01:55:43,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:43,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367476397] [2019-11-20 01:55:43,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1914 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 1565 trivial. 0 not checked. [2019-11-20 01:55:43,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367476397] [2019-11-20 01:55:43,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:43,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:55:43,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985044978] [2019-11-20 01:55:43,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:55:43,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:43,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:55:43,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:55:43,831 INFO L87 Difference]: Start difference. First operand 2783 states and 4265 transitions. Second operand 3 states. [2019-11-20 01:55:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:43,969 INFO L93 Difference]: Finished difference Result 5825 states and 8943 transitions. [2019-11-20 01:55:43,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:55:43,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 461 [2019-11-20 01:55:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:43,991 INFO L225 Difference]: With dead ends: 5825 [2019-11-20 01:55:43,991 INFO L226 Difference]: Without dead ends: 3061 [2019-11-20 01:55:43,995 INFO L630 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 [2019-11-20 01:55:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2019-11-20 01:55:44,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 3061. [2019-11-20 01:55:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3061 states. [2019-11-20 01:55:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 4698 transitions. [2019-11-20 01:55:44,082 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 4698 transitions. Word has length 461 [2019-11-20 01:55:44,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:44,088 INFO L462 AbstractCegarLoop]: Abstraction has 3061 states and 4698 transitions. [2019-11-20 01:55:44,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:55:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 4698 transitions. [2019-11-20 01:55:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-11-20 01:55:44,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:44,100 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:44,101 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:44,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:44,101 INFO L82 PathProgramCache]: Analyzing trace with hash 626733859, now seen corresponding path program 1 times [2019-11-20 01:55:44,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:44,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442430615] [2019-11-20 01:55:44,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 1929 trivial. 0 not checked. [2019-11-20 01:55:44,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442430615] [2019-11-20 01:55:44,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:44,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:55:44,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674962045] [2019-11-20 01:55:44,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:55:44,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:44,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:55:44,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:55:44,545 INFO L87 Difference]: Start difference. First operand 3061 states and 4698 transitions. Second operand 3 states. [2019-11-20 01:55:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:44,673 INFO L93 Difference]: Finished difference Result 3341 states and 5134 transitions. [2019-11-20 01:55:44,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:55:44,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 505 [2019-11-20 01:55:44,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:44,681 INFO L225 Difference]: With dead ends: 3341 [2019-11-20 01:55:44,682 INFO L226 Difference]: Without dead ends: 3339 [2019-11-20 01:55:44,683 INFO L630 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 [2019-11-20 01:55:44,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2019-11-20 01:55:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3339. [2019-11-20 01:55:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3339 states. [2019-11-20 01:55:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 3339 states and 5132 transitions. [2019-11-20 01:55:44,761 INFO L78 Accepts]: Start accepts. Automaton has 3339 states and 5132 transitions. Word has length 505 [2019-11-20 01:55:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:44,762 INFO L462 AbstractCegarLoop]: Abstraction has 3339 states and 5132 transitions. [2019-11-20 01:55:44,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:55:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 5132 transitions. [2019-11-20 01:55:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2019-11-20 01:55:44,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:44,771 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:44,772 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:44,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:44,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2042840060, now seen corresponding path program 1 times [2019-11-20 01:55:44,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:44,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358702109] [2019-11-20 01:55:44,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 1336 proven. 0 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2019-11-20 01:55:45,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358702109] [2019-11-20 01:55:45,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:45,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 01:55:45,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531836973] [2019-11-20 01:55:45,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 01:55:45,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:45,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 01:55:45,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 01:55:45,427 INFO L87 Difference]: Start difference. First operand 3339 states and 5132 transitions. Second operand 7 states. [2019-11-20 01:55:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:46,876 INFO L93 Difference]: Finished difference Result 10738 states and 16549 transitions. [2019-11-20 01:55:46,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 01:55:46,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 551 [2019-11-20 01:55:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:46,894 INFO L225 Difference]: With dead ends: 10738 [2019-11-20 01:55:46,894 INFO L226 Difference]: Without dead ends: 7418 [2019-11-20 01:55:46,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-11-20 01:55:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7418 states. [2019-11-20 01:55:47,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7418 to 6696. [2019-11-20 01:55:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6696 states. [2019-11-20 01:55:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6696 states to 6696 states and 10487 transitions. [2019-11-20 01:55:47,068 INFO L78 Accepts]: Start accepts. Automaton has 6696 states and 10487 transitions. Word has length 551 [2019-11-20 01:55:47,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:47,069 INFO L462 AbstractCegarLoop]: Abstraction has 6696 states and 10487 transitions. [2019-11-20 01:55:47,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 01:55:47,070 INFO L276 IsEmpty]: Start isEmpty. Operand 6696 states and 10487 transitions. [2019-11-20 01:55:47,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2019-11-20 01:55:47,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:47,085 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:47,085 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:47,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:47,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1267419074, now seen corresponding path program 1 times [2019-11-20 01:55:47,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:47,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726450441] [2019-11-20 01:55:47,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 1396 proven. 48 refuted. 0 times theorem prover too weak. 1308 trivial. 0 not checked. [2019-11-20 01:55:47,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726450441] [2019-11-20 01:55:47,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926722749] [2019-11-20 01:55:47,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:55:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:48,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 1756 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:55:48,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:55:48,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-20 01:55:48,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:55:48,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:55:48,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:55:48,476 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-20 01:55:48,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 01:55:48,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:55:48,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:55:48,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:55:48,497 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-20 01:55:48,525 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.base_158|], 2=[|v_#memory_int_179|]} [2019-11-20 01:55:48,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-20 01:55:48,534 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:55:48,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:55:48,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-20 01:55:48,643 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:55:48,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:55:48,689 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:55:48,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-11-20 01:55:48,690 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:55:48,736 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-20 01:55:48,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:55:48,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 01:55:48,743 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-20 01:55:48,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:55:48,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:55:48,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:55:48,854 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:55:48,855 INFO L377 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 2 case distinctions, treesize of input 32 treesize of output 84 [2019-11-20 01:55:48,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:55:48,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:55:48,872 INFO L377 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 23 treesize of output 22 [2019-11-20 01:55:48,873 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:55:48,960 INFO L567 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-11-20 01:55:48,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 01:55:48,961 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-20 01:55:49,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:55:49,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:55:49,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 01:55:49,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:55:49,061 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 01:55:49,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 01:55:49,062 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:55:49,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:55:49,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 01:55:49,069 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-11-20 01:55:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 1696 proven. 24 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2019-11-20 01:55:49,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:55:49,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2019-11-20 01:55:49,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479392000] [2019-11-20 01:55:49,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 01:55:49,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:49,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:55:49,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:55:49,346 INFO L87 Difference]: Start difference. First operand 6696 states and 10487 transitions. Second operand 12 states. [2019-11-20 01:55:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:54,488 INFO L93 Difference]: Finished difference Result 26527 states and 41065 transitions. [2019-11-20 01:55:54,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-20 01:55:54,489 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 551 [2019-11-20 01:55:54,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:54,526 INFO L225 Difference]: With dead ends: 26527 [2019-11-20 01:55:54,526 INFO L226 Difference]: Without dead ends: 19850 [2019-11-20 01:55:54,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 556 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2019-11-20 01:55:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19850 states. [2019-11-20 01:55:54,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19850 to 9420. [2019-11-20 01:55:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9420 states. [2019-11-20 01:55:54,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9420 states to 9420 states and 15335 transitions. [2019-11-20 01:55:54,916 INFO L78 Accepts]: Start accepts. Automaton has 9420 states and 15335 transitions. Word has length 551 [2019-11-20 01:55:54,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:54,917 INFO L462 AbstractCegarLoop]: Abstraction has 9420 states and 15335 transitions. [2019-11-20 01:55:54,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 01:55:54,917 INFO L276 IsEmpty]: Start isEmpty. Operand 9420 states and 15335 transitions. [2019-11-20 01:55:54,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2019-11-20 01:55:54,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:54,940 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:55,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:55:55,148 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:55,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:55,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2130443706, now seen corresponding path program 1 times [2019-11-20 01:55:55,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:55,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503467108] [2019-11-20 01:55:55,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2767 backedges. 1532 proven. 0 refuted. 0 times theorem prover too weak. 1235 trivial. 0 not checked. [2019-11-20 01:55:55,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503467108] [2019-11-20 01:55:55,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:55:55,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:55:55,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880883130] [2019-11-20 01:55:55,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:55:55,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:55,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:55:55,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:55:55,596 INFO L87 Difference]: Start difference. First operand 9420 states and 15335 transitions. Second operand 4 states. [2019-11-20 01:55:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:55:56,384 INFO L93 Difference]: Finished difference Result 20119 states and 32350 transitions. [2019-11-20 01:55:56,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:55:56,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 554 [2019-11-20 01:55:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:55:56,408 INFO L225 Difference]: With dead ends: 20119 [2019-11-20 01:55:56,408 INFO L226 Difference]: Without dead ends: 10718 [2019-11-20 01:55:56,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:55:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10718 states. [2019-11-20 01:55:56,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10718 to 9444. [2019-11-20 01:55:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9444 states. [2019-11-20 01:55:56,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9444 states to 9444 states and 15359 transitions. [2019-11-20 01:55:56,766 INFO L78 Accepts]: Start accepts. Automaton has 9444 states and 15359 transitions. Word has length 554 [2019-11-20 01:55:56,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:55:56,766 INFO L462 AbstractCegarLoop]: Abstraction has 9444 states and 15359 transitions. [2019-11-20 01:55:56,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:55:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 9444 states and 15359 transitions. [2019-11-20 01:55:56,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2019-11-20 01:55:56,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:55:56,783 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:55:56,783 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:55:56,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:55:56,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1861417636, now seen corresponding path program 1 times [2019-11-20 01:55:56,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:55:56,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936116720] [2019-11-20 01:55:56,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:55:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:57,474 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-11-20 01:55:57,603 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-11-20 01:55:58,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2779 backedges. 1333 proven. 71 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2019-11-20 01:55:58,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936116720] [2019-11-20 01:55:58,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270370272] [2019-11-20 01:55:58,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:55:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:55:58,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 1765 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 01:55:58,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:55:58,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-20 01:55:58,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:55:58,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:55:58,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:55:58,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-20 01:55:58,961 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 01:55:58,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:55:58,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:55:58,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:55:58,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-20 01:55:58,982 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_182|]} [2019-11-20 01:55:58,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-20 01:55:58,987 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:55:58,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:55:58,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2019-11-20 01:55:58,998 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:55:59,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:55:59,039 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:55:59,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-11-20 01:55:59,041 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:55:59,067 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-20 01:55:59,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:55:59,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 01:55:59,069 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-20 01:55:59,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:55:59,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:55:59,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:55:59,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:55:59,142 INFO L377 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 2 case distinctions, treesize of input 32 treesize of output 84 [2019-11-20 01:55:59,143 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:55:59,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:55:59,153 INFO L377 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 23 treesize of output 22 [2019-11-20 01:55:59,154 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:55:59,209 INFO L567 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-11-20 01:55:59,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 01:55:59,210 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-20 01:55:59,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:55:59,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:55:59,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 01:55:59,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:55:59,277 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 01:55:59,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-11-20 01:55:59,277 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:55:59,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:55:59,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 01:55:59,282 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-11-20 01:55:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2779 backedges. 1716 proven. 27 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2019-11-20 01:55:59,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:55:59,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-20 01:55:59,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546558881] [2019-11-20 01:55:59,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 01:55:59,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:55:59,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 01:55:59,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-11-20 01:55:59,588 INFO L87 Difference]: Start difference. First operand 9444 states and 15359 transitions. Second operand 18 states. [2019-11-20 01:56:11,104 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-11-20 01:56:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:56:13,531 INFO L93 Difference]: Finished difference Result 63421 states and 99031 transitions. [2019-11-20 01:56:13,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-11-20 01:56:13,531 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 554 [2019-11-20 01:56:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:56:13,633 INFO L225 Difference]: With dead ends: 63421 [2019-11-20 01:56:13,633 INFO L226 Difference]: Without dead ends: 53996 [2019-11-20 01:56:13,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 570 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3258 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1288, Invalid=8612, Unknown=0, NotChecked=0, Total=9900 [2019-11-20 01:56:13,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53996 states. [2019-11-20 01:56:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53996 to 18099. [2019-11-20 01:56:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18099 states. [2019-11-20 01:56:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 29828 transitions. [2019-11-20 01:56:14,744 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 29828 transitions. Word has length 554 [2019-11-20 01:56:14,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:56:14,745 INFO L462 AbstractCegarLoop]: Abstraction has 18099 states and 29828 transitions. [2019-11-20 01:56:14,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 01:56:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 29828 transitions. [2019-11-20 01:56:14,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2019-11-20 01:56:14,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:56:14,766 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:56:14,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:56:14,968 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:56:14,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:56:14,969 INFO L82 PathProgramCache]: Analyzing trace with hash 652835212, now seen corresponding path program 1 times [2019-11-20 01:56:14,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:56:14,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614375636] [2019-11-20 01:56:14,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:56:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:56:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3082 backedges. 1415 proven. 0 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2019-11-20 01:56:15,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614375636] [2019-11-20 01:56:15,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:56:15,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:56:15,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429632856] [2019-11-20 01:56:15,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:56:15,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:56:15,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:56:15,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:56:15,343 INFO L87 Difference]: Start difference. First operand 18099 states and 29828 transitions. Second operand 4 states. [2019-11-20 01:56:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:56:16,276 INFO L93 Difference]: Finished difference Result 38315 states and 62402 transitions. [2019-11-20 01:56:16,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:56:16,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 596 [2019-11-20 01:56:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:56:16,317 INFO L225 Difference]: With dead ends: 38315 [2019-11-20 01:56:16,317 INFO L226 Difference]: Without dead ends: 20235 [2019-11-20 01:56:16,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:56:16,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20235 states. [2019-11-20 01:56:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20235 to 18099. [2019-11-20 01:56:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18099 states. [2019-11-20 01:56:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 29780 transitions. [2019-11-20 01:56:16,870 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 29780 transitions. Word has length 596 [2019-11-20 01:56:16,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:56:16,871 INFO L462 AbstractCegarLoop]: Abstraction has 18099 states and 29780 transitions. [2019-11-20 01:56:16,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:56:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 29780 transitions. [2019-11-20 01:56:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2019-11-20 01:56:16,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:56:16,887 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:56:16,887 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:56:16,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:56:16,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1511565327, now seen corresponding path program 1 times [2019-11-20 01:56:16,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:56:16,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400696893] [2019-11-20 01:56:16,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:56:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:56:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3127 backedges. 1441 proven. 0 refuted. 0 times theorem prover too weak. 1686 trivial. 0 not checked. [2019-11-20 01:56:17,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400696893] [2019-11-20 01:56:17,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:56:17,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 01:56:17,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177874462] [2019-11-20 01:56:17,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:56:17,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:56:17,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:56:17,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:56:17,590 INFO L87 Difference]: Start difference. First operand 18099 states and 29780 transitions. Second operand 4 states. [2019-11-20 01:56:18,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:56:18,608 INFO L93 Difference]: Finished difference Result 38315 states and 62306 transitions. [2019-11-20 01:56:18,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:56:18,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 599 [2019-11-20 01:56:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:56:18,626 INFO L225 Difference]: With dead ends: 38315 [2019-11-20 01:56:18,626 INFO L226 Difference]: Without dead ends: 20235 [2019-11-20 01:56:18,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 01:56:18,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20235 states. [2019-11-20 01:56:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20235 to 18099. [2019-11-20 01:56:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18099 states. [2019-11-20 01:56:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 29732 transitions. [2019-11-20 01:56:19,163 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 29732 transitions. Word has length 599 [2019-11-20 01:56:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:56:19,164 INFO L462 AbstractCegarLoop]: Abstraction has 18099 states and 29732 transitions. [2019-11-20 01:56:19,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:56:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 29732 transitions. [2019-11-20 01:56:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2019-11-20 01:56:19,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:56:19,182 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:56:19,182 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:56:19,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:56:19,183 INFO L82 PathProgramCache]: Analyzing trace with hash -608382878, now seen corresponding path program 1 times [2019-11-20 01:56:19,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:56:19,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492278052] [2019-11-20 01:56:19,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:56:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:56:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3109 backedges. 1234 proven. 271 refuted. 0 times theorem prover too weak. 1604 trivial. 0 not checked. [2019-11-20 01:56:19,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492278052] [2019-11-20 01:56:19,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508428981] [2019-11-20 01:56:19,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:56:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:56:20,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 1906 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 01:56:20,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:56:20,765 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-20 01:56:20,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:56:20,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:20,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:56:20,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-20 01:56:20,787 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|, |v_#memory_$Pointer$.base_160|], 5=[|v_#memory_int_184|]} [2019-11-20 01:56:20,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2019-11-20 01:56:20,792 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:56:20,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:20,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2019-11-20 01:56:20,797 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:56:20,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:20,844 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:20,845 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-20 01:56:20,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:20,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:20,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:20,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:20,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:20,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:20,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:20,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:21,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:56:21,101 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 01:56:21,105 INFO L168 Benchmark]: Toolchain (without parser) took 65626.78 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 944.7 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 248.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:56:21,105 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:56:21,106 INFO L168 Benchmark]: CACSL2BoogieTranslator took 904.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-20 01:56:21,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:56:21,107 INFO L168 Benchmark]: Boogie Preprocessor took 104.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:56:21,107 INFO L168 Benchmark]: RCFGBuilder took 1469.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 983.3 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:56:21,107 INFO L168 Benchmark]: TraceAbstraction took 63061.92 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 983.3 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 166.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:56:21,110 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 904.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 104.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1469.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 983.3 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63061.92 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 983.3 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 166.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 01:56:23,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:56:23,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:56:23,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:56:23,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:56:23,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:56:23,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:56:23,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:56:23,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:56:23,148 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:56:23,149 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:56:23,151 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:56:23,151 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:56:23,152 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:56:23,153 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:56:23,154 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:56:23,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:56:23,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:56:23,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:56:23,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:56:23,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:56:23,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:56:23,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:56:23,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:56:23,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:56:23,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:56:23,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:56:23,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:56:23,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:56:23,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:56:23,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:56:23,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:56:23,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:56:23,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:56:23,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:56:23,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:56:23,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:56:23,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:56:23,197 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:56:23,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:56:23,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:56:23,201 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 01:56:23,214 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:56:23,214 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:56:23,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:56:23,216 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:56:23,216 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:56:23,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:56:23,217 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:56:23,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:56:23,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:56:23,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:56:23,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:56:23,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:56:23,218 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 01:56:23,219 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 01:56:23,219 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:56:23,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:56:23,219 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:56:23,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:56:23,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:56:23,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:56:23,221 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:56:23,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 01:56:23,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 01:56:23,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:56:23,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:56:23,222 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:56:23,222 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 01:56:23,223 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 01:56:23,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:56:23,223 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 01:56:23,223 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/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 -> e2cfc7f3e461f5ecb57edb2b49f889b2b38a58c8 [2019-11-20 01:56:23,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:56:23,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:56:23,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:56:23,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:56:23,545 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:56:23,546 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-2.c [2019-11-20 01:56:23,605 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/data/451a82f8f/b7c06a2c72f246939e486e200e926f1a/FLAGfdaf164e3 [2019-11-20 01:56:24,194 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:56:24,195 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-2.c [2019-11-20 01:56:24,221 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/data/451a82f8f/b7c06a2c72f246939e486e200e926f1a/FLAGfdaf164e3 [2019-11-20 01:56:24,449 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/data/451a82f8f/b7c06a2c72f246939e486e200e926f1a [2019-11-20 01:56:24,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:56:24,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:56:24,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:56:24,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:56:24,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:56:24,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:56:24" (1/1) ... [2019-11-20 01:56:24,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2574741d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:56:24, skipping insertion in model container [2019-11-20 01:56:24,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:56:24" (1/1) ... [2019-11-20 01:56:24,471 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:56:24,561 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:56:25,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:56:25,187 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:56:25,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:56:25,399 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:56:25,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:56:25 WrapperNode [2019-11-20 01:56:25,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:56:25,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:56:25,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:56:25,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:56:25,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:56:25" (1/1) ... [2019-11-20 01:56:25,440 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:56:25" (1/1) ... [2019-11-20 01:56:25,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:56:25,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:56:25,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:56:25,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:56:25,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:56:25" (1/1) ... [2019-11-20 01:56:25,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:56:25" (1/1) ... [2019-11-20 01:56:25,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:56:25" (1/1) ... [2019-11-20 01:56:25,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:56:25" (1/1) ... [2019-11-20 01:56:25,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:56:25" (1/1) ... [2019-11-20 01:56:25,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:56:25" (1/1) ... [2019-11-20 01:56:25,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:56:25" (1/1) ... [2019-11-20 01:56:25,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:56:25,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:56:25,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:56:25,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:56:25,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:56:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/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 [2019-11-20 01:56:25,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 01:56:25,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:56:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 01:56:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 01:56:25,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 01:56:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:56:25,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:56:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 01:56:26,008 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 01:56:30,141 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 01:56:30,141 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 01:56:30,142 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:56:30,144 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 01:56:30,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:56:30 BoogieIcfgContainer [2019-11-20 01:56:30,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:56:30,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 01:56:30,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 01:56:30,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 01:56:30,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:56:24" (1/3) ... [2019-11-20 01:56:30,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec5b1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:56:30, skipping insertion in model container [2019-11-20 01:56:30,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:56:25" (2/3) ... [2019-11-20 01:56:30,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec5b1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:56:30, skipping insertion in model container [2019-11-20 01:56:30,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:56:30" (3/3) ... [2019-11-20 01:56:30,154 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-2.c [2019-11-20 01:56:30,165 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 01:56:30,172 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 01:56:30,185 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 01:56:30,208 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 01:56:30,208 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 01:56:30,209 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 01:56:30,209 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:56:30,209 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:56:30,210 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 01:56:30,210 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:56:30,210 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 01:56:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-20 01:56:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 01:56:30,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:56:30,237 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:56:30,238 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:56:30,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:56:30,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1923572963, now seen corresponding path program 1 times [2019-11-20 01:56:30,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:56:30,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [231818858] [2019-11-20 01:56:30,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:56:30,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:56:30,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:56:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:56:30,563 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:56:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:56:30,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [231818858] [2019-11-20 01:56:30,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:56:30,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 01:56:30,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493455309] [2019-11-20 01:56:30,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:56:30,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:56:30,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:56:30,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:56:30,623 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2019-11-20 01:56:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:56:30,982 INFO L93 Difference]: Finished difference Result 576 states and 989 transitions. [2019-11-20 01:56:30,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:56:30,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-20 01:56:30,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:56:31,019 INFO L225 Difference]: With dead ends: 576 [2019-11-20 01:56:31,020 INFO L226 Difference]: Without dead ends: 393 [2019-11-20 01:56:31,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:56:31,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-11-20 01:56:31,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2019-11-20 01:56:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-11-20 01:56:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 601 transitions. [2019-11-20 01:56:31,122 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 601 transitions. Word has length 44 [2019-11-20 01:56:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:56:31,123 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 601 transitions. [2019-11-20 01:56:31,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:56:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 601 transitions. [2019-11-20 01:56:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 01:56:31,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:56:31,131 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:56:31,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:31,339 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:56:31,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:56:31,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1030792906, now seen corresponding path program 1 times [2019-11-20 01:56:31,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:56:31,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [470261762] [2019-11-20 01:56:31,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:56:31,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:56:31,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:56:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:56:31,662 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:56:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:56:31,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [470261762] [2019-11-20 01:56:31,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:56:31,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 01:56:31,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946829257] [2019-11-20 01:56:31,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:56:31,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:56:31,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:56:31,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:56:31,714 INFO L87 Difference]: Start difference. First operand 393 states and 601 transitions. Second operand 4 states. [2019-11-20 01:56:33,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:56:33,678 INFO L93 Difference]: Finished difference Result 902 states and 1399 transitions. [2019-11-20 01:56:33,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:56:33,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-20 01:56:33,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:56:33,684 INFO L225 Difference]: With dead ends: 902 [2019-11-20 01:56:33,685 INFO L226 Difference]: Without dead ends: 645 [2019-11-20 01:56:33,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:56:33,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-11-20 01:56:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2019-11-20 01:56:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-11-20 01:56:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 982 transitions. [2019-11-20 01:56:33,767 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 982 transitions. Word has length 107 [2019-11-20 01:56:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:56:33,770 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 982 transitions. [2019-11-20 01:56:33,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:56:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 982 transitions. [2019-11-20 01:56:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-20 01:56:33,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:56:33,784 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:56:33,991 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:33,991 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:56:33,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:56:33,992 INFO L82 PathProgramCache]: Analyzing trace with hash -488998158, now seen corresponding path program 1 times [2019-11-20 01:56:33,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:56:33,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [583455391] [2019-11-20 01:56:33,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:56:34,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:56:34,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:56:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-20 01:56:34,405 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:56:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-20 01:56:34,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [583455391] [2019-11-20 01:56:34,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:56:34,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 01:56:34,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183884956] [2019-11-20 01:56:34,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:56:34,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:56:34,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:56:34,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:56:34,444 INFO L87 Difference]: Start difference. First operand 645 states and 982 transitions. Second operand 3 states. [2019-11-20 01:56:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:56:35,408 INFO L93 Difference]: Finished difference Result 1278 states and 1958 transitions. [2019-11-20 01:56:35,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:56:35,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-20 01:56:35,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:56:35,416 INFO L225 Difference]: With dead ends: 1278 [2019-11-20 01:56:35,416 INFO L226 Difference]: Without dead ends: 769 [2019-11-20 01:56:35,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:56:35,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-11-20 01:56:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2019-11-20 01:56:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-11-20 01:56:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1166 transitions. [2019-11-20 01:56:35,459 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1166 transitions. Word has length 173 [2019-11-20 01:56:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:56:35,461 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1166 transitions. [2019-11-20 01:56:35,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:56:35,462 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1166 transitions. [2019-11-20 01:56:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-20 01:56:35,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:56:35,466 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:56:35,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:35,677 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:56:35,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:56:35,677 INFO L82 PathProgramCache]: Analyzing trace with hash -142799614, now seen corresponding path program 1 times [2019-11-20 01:56:35,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:56:35,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [681013061] [2019-11-20 01:56:35,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:56:36,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:56:36,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:56:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 01:56:36,113 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:56:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 01:56:36,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [681013061] [2019-11-20 01:56:36,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:56:36,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 01:56:36,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680791653] [2019-11-20 01:56:36,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:56:36,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:56:36,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:56:36,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:56:36,189 INFO L87 Difference]: Start difference. First operand 769 states and 1166 transitions. Second operand 4 states. [2019-11-20 01:56:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:56:37,671 INFO L93 Difference]: Finished difference Result 1652 states and 2524 transitions. [2019-11-20 01:56:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:56:37,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-11-20 01:56:37,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:56:37,681 INFO L225 Difference]: With dead ends: 1652 [2019-11-20 01:56:37,681 INFO L226 Difference]: Without dead ends: 1019 [2019-11-20 01:56:37,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:56:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-11-20 01:56:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1019. [2019-11-20 01:56:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-11-20 01:56:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1544 transitions. [2019-11-20 01:56:37,771 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1544 transitions. Word has length 214 [2019-11-20 01:56:37,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:56:37,771 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 1544 transitions. [2019-11-20 01:56:37,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:56:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1544 transitions. [2019-11-20 01:56:37,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-20 01:56:37,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:56:37,782 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:56:37,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:37,984 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:56:37,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:56:37,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1706576766, now seen corresponding path program 1 times [2019-11-20 01:56:37,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:56:37,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1916449755] [2019-11-20 01:56:37,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:56:38,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:56:38,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:56:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-11-20 01:56:38,508 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:56:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-11-20 01:56:38,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1916449755] [2019-11-20 01:56:38,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:56:38,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 01:56:38,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296069386] [2019-11-20 01:56:38,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:56:38,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:56:38,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:56:38,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:56:38,585 INFO L87 Difference]: Start difference. First operand 1019 states and 1544 transitions. Second operand 3 states. [2019-11-20 01:56:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:56:39,440 INFO L93 Difference]: Finished difference Result 2025 states and 3080 transitions. [2019-11-20 01:56:39,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:56:39,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-11-20 01:56:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:56:39,450 INFO L225 Difference]: With dead ends: 2025 [2019-11-20 01:56:39,450 INFO L226 Difference]: Without dead ends: 1142 [2019-11-20 01:56:39,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:56:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-11-20 01:56:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2019-11-20 01:56:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2019-11-20 01:56:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1726 transitions. [2019-11-20 01:56:39,515 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1726 transitions. Word has length 298 [2019-11-20 01:56:39,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:56:39,516 INFO L462 AbstractCegarLoop]: Abstraction has 1142 states and 1726 transitions. [2019-11-20 01:56:39,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:56:39,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1726 transitions. [2019-11-20 01:56:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-11-20 01:56:39,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:56:39,526 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:56:39,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:39,728 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:56:39,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:56:39,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2071774241, now seen corresponding path program 1 times [2019-11-20 01:56:39,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:56:39,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2132445226] [2019-11-20 01:56:39,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:56:40,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:56:40,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:56:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-20 01:56:40,341 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:56:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-20 01:56:40,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2132445226] [2019-11-20 01:56:40,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:56:40,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 01:56:40,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062113798] [2019-11-20 01:56:40,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:56:40,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:56:40,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:56:40,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:56:40,452 INFO L87 Difference]: Start difference. First operand 1142 states and 1726 transitions. Second operand 4 states. [2019-11-20 01:56:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:56:42,411 INFO L93 Difference]: Finished difference Result 2398 states and 3643 transitions. [2019-11-20 01:56:42,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:56:42,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 337 [2019-11-20 01:56:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:56:42,421 INFO L225 Difference]: With dead ends: 2398 [2019-11-20 01:56:42,421 INFO L226 Difference]: Without dead ends: 1392 [2019-11-20 01:56:42,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 670 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:56:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-11-20 01:56:42,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1392. [2019-11-20 01:56:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2019-11-20 01:56:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2102 transitions. [2019-11-20 01:56:42,475 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2102 transitions. Word has length 337 [2019-11-20 01:56:42,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:56:42,476 INFO L462 AbstractCegarLoop]: Abstraction has 1392 states and 2102 transitions. [2019-11-20 01:56:42,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:56:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2102 transitions. [2019-11-20 01:56:42,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-11-20 01:56:42,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:56:42,481 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:56:42,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:42,686 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:56:42,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:56:42,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1726301007, now seen corresponding path program 1 times [2019-11-20 01:56:42,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:56:42,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [383486082] [2019-11-20 01:56:42,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:56:43,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:56:43,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:56:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 1017 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-11-20 01:56:43,274 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:56:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 1017 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2019-11-20 01:56:43,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [383486082] [2019-11-20 01:56:43,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:56:43,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 01:56:43,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471837687] [2019-11-20 01:56:43,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 01:56:43,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:56:43,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:56:43,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:56:43,388 INFO L87 Difference]: Start difference. First operand 1392 states and 2102 transitions. Second operand 3 states. [2019-11-20 01:56:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:56:44,054 INFO L93 Difference]: Finished difference Result 2772 states and 4197 transitions. [2019-11-20 01:56:44,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:56:44,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 424 [2019-11-20 01:56:44,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:56:44,063 INFO L225 Difference]: With dead ends: 2772 [2019-11-20 01:56:44,063 INFO L226 Difference]: Without dead ends: 1516 [2019-11-20 01:56:44,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 845 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:56:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2019-11-20 01:56:44,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1516. [2019-11-20 01:56:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2019-11-20 01:56:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2285 transitions. [2019-11-20 01:56:44,122 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2285 transitions. Word has length 424 [2019-11-20 01:56:44,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:56:44,123 INFO L462 AbstractCegarLoop]: Abstraction has 1516 states and 2285 transitions. [2019-11-20 01:56:44,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 01:56:44,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2285 transitions. [2019-11-20 01:56:44,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2019-11-20 01:56:44,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:56:44,130 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:56:44,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:44,333 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:56:44,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:56:44,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1651587245, now seen corresponding path program 1 times [2019-11-20 01:56:44,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:56:44,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1453857637] [2019-11-20 01:56:44,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:56:44,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:56:44,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:56:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 1211 proven. 0 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2019-11-20 01:56:44,993 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:56:45,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 1211 proven. 0 refuted. 0 times theorem prover too weak. 725 trivial. 0 not checked. [2019-11-20 01:56:45,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1453857637] [2019-11-20 01:56:45,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:56:45,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 01:56:45,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266338429] [2019-11-20 01:56:45,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 01:56:45,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:56:45,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:56:45,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:56:45,144 INFO L87 Difference]: Start difference. First operand 1516 states and 2285 transitions. Second operand 4 states. [2019-11-20 01:56:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:56:45,685 INFO L93 Difference]: Finished difference Result 3145 states and 4758 transitions. [2019-11-20 01:56:45,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:56:45,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 468 [2019-11-20 01:56:45,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:56:45,696 INFO L225 Difference]: With dead ends: 3145 [2019-11-20 01:56:45,697 INFO L226 Difference]: Without dead ends: 1765 [2019-11-20 01:56:45,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 934 GetRequests, 932 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 01:56:45,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-11-20 01:56:45,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1765. [2019-11-20 01:56:45,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-11-20 01:56:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2657 transitions. [2019-11-20 01:56:45,767 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2657 transitions. Word has length 468 [2019-11-20 01:56:45,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:56:45,768 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 2657 transitions. [2019-11-20 01:56:45,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 01:56:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2657 transitions. [2019-11-20 01:56:45,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2019-11-20 01:56:45,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 01:56:45,776 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:56:45,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:45,980 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 01:56:45,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:56:45,981 INFO L82 PathProgramCache]: Analyzing trace with hash 381854906, now seen corresponding path program 1 times [2019-11-20 01:56:45,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 01:56:45,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [100744530] [2019-11-20 01:56:45,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 01:56:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:56:51,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 1145 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-20 01:56:51,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:56:51,551 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:51,551 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 01:56:51,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:56:51,966 WARN L191 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 01:56:51,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:51,971 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_224|], 2=[|v_#memory_$Pointer$.base_221|, |v_#memory_$Pointer$.base_220|]} [2019-11-20 01:56:51,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:51,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 01:56:52,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:56:52,301 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 01:56:52,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:52,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,338 INFO L377 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 01:56:52,339 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 01:56:52,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:52,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,441 INFO L377 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 01:56:52,442 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 01:56:52,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:52,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:56:52,500 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-20 01:56:52,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,568 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:52,569 INFO L377 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 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 01:56:52,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:56:52,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:52,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:56:52,604 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 01:56:52,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,636 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:52,637 INFO L377 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 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 01:56:52,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:56:52,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:52,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:56:52,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 01:56:52,677 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_222|], 12=[|v_#memory_$Pointer$.base_227|]} [2019-11-20 01:56:52,684 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:56:52,821 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 01:56:52,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:52,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:52,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 01:56:52,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:56:52,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:52,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:56:52,897 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-20 01:56:52,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,917 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:52,918 INFO L377 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 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 01:56:52,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:56:52,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:52,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:56:52,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 01:56:52,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:52,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:52,966 INFO L377 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 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 01:56:52,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:56:53,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:53,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:56:53,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 01:56:53,014 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_220|], 20=[|v_#memory_$Pointer$.base_230|]} [2019-11-20 01:56:53,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:53,024 INFO L377 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 49 treesize of output 37 [2019-11-20 01:56:53,024 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 01:56:53,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:53,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:53,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:53,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:53,708 WARN L191 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-20 01:56:53,708 INFO L343 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-20 01:56:53,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-20 01:56:53,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:56:53,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:56:53,964 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:56:54,148 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2019-11-20 01:56:54,148 INFO L567 ElimStorePlain]: treesize reduction 198, result has 27.2 percent of original size [2019-11-20 01:56:54,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 01:56:54,150 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:83 [2019-11-20 01:56:54,247 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_223|], 30=[|v_#memory_$Pointer$.base_231|]} [2019-11-20 01:56:54,258 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:56:54,403 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 01:56:54,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:56:54,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:54,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:54,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:54,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:54,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:54,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:54,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:54,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:54,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:56:54,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:57:27,546 WARN L191 SmtUtils]: Spent 33.13 s on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-20 01:57:27,546 INFO L343 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-20 01:57:27,547 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 104 treesize of output 338 [2019-11-20 01:57:27,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:27,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:27,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:27,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:27,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:27,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:27,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:27,559 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:57:27,926 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 40 [2019-11-20 01:57:27,926 INFO L567 ElimStorePlain]: treesize reduction 11799, result has 0.8 percent of original size [2019-11-20 01:57:27,927 INFO L496 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. [2019-11-20 01:57:27,927 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-20 01:57:27,975 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_240|], 30=[|v_#memory_$Pointer$.base_232|]} [2019-11-20 01:57:27,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 01:57:27,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:57:28,125 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 01:57:28,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:57:28,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:57:28,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:57:28,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:57:28,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:57:28,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:57:28,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:57:44,581 WARN L191 SmtUtils]: Spent 16.44 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-20 01:57:44,582 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:57:44,582 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 263 [2019-11-20 01:57:44,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:57:44,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:44,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:44,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:44,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:44,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:44,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:57:44,592 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:57:44,914 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 42 [2019-11-20 01:57:44,915 INFO L567 ElimStorePlain]: treesize reduction 5264, result has 1.7 percent of original size [2019-11-20 01:57:44,915 INFO L496 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. [2019-11-20 01:57:44,916 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-20 01:57:45,020 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_221|], 2=[|v_#memory_int_241|], 20=[|v_#memory_$Pointer$.base_233|]} [2019-11-20 01:57:45,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-20 01:57:45,043 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:57:45,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:57:45,139 INFO L377 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 35 treesize of output 28 [2019-11-20 01:57:45,140 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 01:57:45,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:57:45,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:57:45,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:57:45,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:57:45,334 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 01:57:45,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:57:45,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-11-20 01:57:45,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:57:45,543 INFO L496 ElimStorePlain]: Start of recursive call 4: 118 dim-0 vars, End of recursive call: 118 dim-0 vars, and 16 xjuncts. [2019-11-20 01:58:03,420 WARN L191 SmtUtils]: Spent 17.87 s on a formula simplification that was a NOOP. DAG size: 973 [2019-11-20 01:58:03,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:58:03,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 01:58:03,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:58:03,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-11-20 01:58:03,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 01:58:03,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:58:03,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:58:03,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 01:58:03,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 01:58:03,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:58:03,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:58:03,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 01:58:03,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:58:03,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:58:03,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 01:58:03,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 01:58:03,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:58:03,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 01:58:03,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:58:03,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 236 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:03,517 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:1666 [2019-11-20 01:58:04,870 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 1195 DAG size of output: 24 [2019-11-20 01:58:04,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 01:58:04,876 INFO L377 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 32 treesize of output 34 [2019-11-20 01:58:04,877 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:58:04,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:58:04,895 INFO L496 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. [2019-11-20 01:58:04,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-20 01:58:04,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-20 01:58:04,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:58:04,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:58:04,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 01:58:04,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-20 01:58:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 1294 proven. 96 refuted. 0 times theorem prover too weak. 1362 trivial. 0 not checked. [2019-11-20 01:58:05,893 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 01:58:05,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-20 01:58:05,989 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:05,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:58:05,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:05,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-20 01:58:06,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 01:58:06,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:58:06,071 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:06,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:58:06,082 INFO L496 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. [2019-11-20 01:58:06,082 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2019-11-20 01:58:06,123 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_258|], 2=[|v_#memory_$Pointer$.base_223|]} [2019-11-20 01:58:06,127 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:06,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:58:06,152 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:06,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:58:06,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:06,159 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:25 [2019-11-20 01:58:06,206 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 01:58:06,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2019-11-20 01:58:06,207 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:06,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:58:06,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:06,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:49 [2019-11-20 01:58:06,314 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:06,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:58:06,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:06,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 01:58:06,481 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:06,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:58:06,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:06,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 01:58:06,687 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_222|], 20=[|v_#memory_$Pointer$.base_262|]} [2019-11-20 01:58:06,696 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:06,768 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:58:06,769 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:06,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:58:06,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:06,786 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:90, output treesize:124 [2019-11-20 01:58:07,159 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:07,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:58:07,176 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:07,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 01:58:07,417 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:07,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 01:58:07,429 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 01:58:07,429 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 01:58:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 1230 proven. 160 refuted. 0 times theorem prover too weak. 1362 trivial. 0 not checked. [2019-11-20 01:58:09,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [100744530] [2019-11-20 01:58:09,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:58:09,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-20 01:58:09,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586933452] [2019-11-20 01:58:09,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 01:58:09,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 01:58:09,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 01:58:09,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-20 01:58:09,250 INFO L87 Difference]: Start difference. First operand 1765 states and 2657 transitions. Second operand 13 states. [2019-11-20 01:59:09,554 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-20 01:59:54,360 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-20 01:59:55,393 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-20 01:59:57,805 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-20 02:01:35,046 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-20 02:01:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:01:53,761 INFO L93 Difference]: Finished difference Result 8039 states and 12103 transitions. [2019-11-20 02:01:53,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 02:01:53,765 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 551 [2019-11-20 02:01:53,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:01:53,803 INFO L225 Difference]: With dead ends: 8039 [2019-11-20 02:01:53,804 INFO L226 Difference]: Without dead ends: 6282 [2019-11-20 02:01:53,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1111 GetRequests, 1082 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=154, Invalid=397, Unknown=1, NotChecked=0, Total=552 [2019-11-20 02:01:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6282 states. [2019-11-20 02:01:54,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6282 to 4019. [2019-11-20 02:01:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4019 states. [2019-11-20 02:01:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4019 states to 4019 states and 6461 transitions. [2019-11-20 02:01:54,013 INFO L78 Accepts]: Start accepts. Automaton has 4019 states and 6461 transitions. Word has length 551 [2019-11-20 02:01:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:01:54,014 INFO L462 AbstractCegarLoop]: Abstraction has 4019 states and 6461 transitions. [2019-11-20 02:01:54,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 02:01:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 4019 states and 6461 transitions. [2019-11-20 02:01:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2019-11-20 02:01:54,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:01:54,027 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:01:54,240 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:01:54,240 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:01:54,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:01:54,241 INFO L82 PathProgramCache]: Analyzing trace with hash 961803688, now seen corresponding path program 1 times [2019-11-20 02:01:54,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:01:54,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1280860103] [2019-11-20 02:01:54,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:01:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:01:59,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-20 02:01:59,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:01:59,568 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:01:59,568 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 02:01:59,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:01:59,946 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 02:01:59,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:01:59,949 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_270|], 2=[|v_#memory_$Pointer$.base_267|, |v_#memory_$Pointer$.base_266|]} [2019-11-20 02:01:59,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:01:59,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:01:59,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:01:59,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:01:59,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:01:59,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 02:02:00,061 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:02:00,246 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 02:02:00,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:02:00,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,276 INFO L377 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:02:00,277 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:02:00,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:02:00,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,364 INFO L377 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:02:00,365 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:02:00,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:02:00,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:02:00,399 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-20 02:02:00,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,442 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:02:00,442 INFO L377 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 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:02:00,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:02:00,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:02:00,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:02:00,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 02:02:00,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,493 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:02:00,494 INFO L377 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 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:02:00,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:02:00,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:02:00,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:02:00,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 02:02:00,532 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_268|], 12=[|v_#memory_$Pointer$.base_273|]} [2019-11-20 02:02:00,537 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:02:00,691 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 02:02:00,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:02:00,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,706 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:02:00,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 02:02:00,707 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:02:00,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:02:00,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:02:00,731 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-20 02:02:00,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,745 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:02:00,745 INFO L377 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 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:02:00,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:02:00,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:02:00,764 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:02:00,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 02:02:00,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,777 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:02:00,777 INFO L377 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 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:02:00,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:02:00,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:02:00,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:02:00,799 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 02:02:00,804 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_254|], 20=[|v_#memory_$Pointer$.base_276|]} [2019-11-20 02:02:00,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,812 INFO L377 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 49 treesize of output 37 [2019-11-20 02:02:00,812 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:02:00,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:02:00,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:00,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:02:01,405 WARN L191 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-20 02:02:01,405 INFO L343 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-20 02:02:01,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-20 02:02:01,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:02:01,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:02:01,867 INFO L496 ElimStorePlain]: Start of recursive call 3: 136 dim-0 vars, End of recursive call: 136 dim-0 vars, and 29 xjuncts. [2019-11-20 02:03:00,059 WARN L191 SmtUtils]: Spent 58.19 s on a formula simplification. DAG size of input: 1613 DAG size of output: 871 [2019-11-20 02:03:00,060 INFO L567 ElimStorePlain]: treesize reduction 16479, result has 30.1 percent of original size [2019-11-20 02:03:00,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:03:00,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:00,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:03:00,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 02:03:00,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:00,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:00,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 02:03:00,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 02:03:00,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:00,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:00,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-11-20 02:03:00,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 02:03:00,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:00,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:00,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:03:00,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:03:00,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 02:03:00,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 02:03:00,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:00,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:00,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:00,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 148 dim-0 vars, and 1 xjuncts. [2019-11-20 02:03:00,136 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:8153 [2019-11-20 02:03:06,814 WARN L191 SmtUtils]: Spent 6.38 s on a formula simplification. DAG size of input: 1220 DAG size of output: 37 [2019-11-20 02:03:06,818 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_269|], 30=[|v_#memory_$Pointer$.base_277|]} [2019-11-20 02:03:06,828 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:03:06,958 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 02:03:06,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:03:06,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:06,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:06,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:06,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:06,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:06,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:06,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:06,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:06,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:06,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:40,079 WARN L191 SmtUtils]: Spent 33.09 s on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-20 02:03:40,080 INFO L343 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-20 02:03:40,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 104 treesize of output 338 [2019-11-20 02:03:40,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:40,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:40,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:40,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:40,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:40,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:40,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:40,087 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:03:40,457 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 40 [2019-11-20 02:03:40,457 INFO L567 ElimStorePlain]: treesize reduction 9959, result has 0.9 percent of original size [2019-11-20 02:03:40,458 INFO L496 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. [2019-11-20 02:03:40,458 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-20 02:03:40,499 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_275|], 30=[|v_#memory_$Pointer$.base_278|]} [2019-11-20 02:03:40,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 02:03:40,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:03:40,650 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 02:03:40,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:03:40,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:40,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:40,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:40,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:40,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:40,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:57,095 WARN L191 SmtUtils]: Spent 16.43 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-20 02:03:57,095 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:03:57,095 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 263 [2019-11-20 02:03:57,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:03:57,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:03:57,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,102 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:03:57,381 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 42 [2019-11-20 02:03:57,381 INFO L567 ElimStorePlain]: treesize reduction 4323, result has 2.1 percent of original size [2019-11-20 02:03:57,382 INFO L496 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. [2019-11-20 02:03:57,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-20 02:03:57,438 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_255|], 2=[|v_#memory_int_276|], 20=[|v_#memory_$Pointer$.base_279|]} [2019-11-20 02:03:57,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-20 02:03:57,457 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:03:57,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:03:57,538 INFO L377 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 35 treesize of output 28 [2019-11-20 02:03:57,539 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:03:57,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:03:57,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:57,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:57,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:03:57,743 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 02:03:57,744 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:03:57,744 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-11-20 02:03:57,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:03:57,876 INFO L496 ElimStorePlain]: Start of recursive call 4: 153 dim-0 vars, End of recursive call: 153 dim-0 vars, and 21 xjuncts. [2019-11-20 02:04:54,074 WARN L191 SmtUtils]: Spent 56.20 s on a formula simplification. DAG size of input: 1214 DAG size of output: 1208 [2019-11-20 02:04:54,074 INFO L567 ElimStorePlain]: treesize reduction 32, result has 99.0 percent of original size [2019-11-20 02:04:54,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-11-20 02:04:54,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 02:04:54,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:04:54,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 02:04:54,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 02:04:54,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 02:04:54,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 02:04:54,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 02:04:54,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-11-20 02:04:54,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-11-20 02:04:54,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 02:04:54,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 02:04:54,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 02:04:54,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:04:54,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 02:04:54,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 02:04:54,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 02:04:54,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 02:04:54,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:04:54,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 302 dim-0 vars, and 1 xjuncts. [2019-11-20 02:04:54,133 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:2128 [2019-11-20 02:04:55,905 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 1659 DAG size of output: 25 [2019-11-20 02:04:55,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:04:55,911 INFO L377 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 34 treesize of output 36 [2019-11-20 02:04:55,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:04:55,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:04:55,925 INFO L496 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. [2019-11-20 02:04:55,925 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:35 [2019-11-20 02:04:55,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-20 02:04:55,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:04:55,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:04:55,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:04:55,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-20 02:04:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 1300 proven. 98 refuted. 0 times theorem prover too weak. 1362 trivial. 0 not checked. [2019-11-20 02:04:56,764 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:04:56,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-20 02:04:56,860 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:04:56,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:04:56,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:04:56,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-20 02:04:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2760 backedges. 1334 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2019-11-20 02:04:57,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1280860103] [2019-11-20 02:04:57,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:04:57,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-20 02:04:57,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830444150] [2019-11-20 02:04:57,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:04:57,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:04:57,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:04:57,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:04:57,039 INFO L87 Difference]: Start difference. First operand 4019 states and 6461 transitions. Second operand 4 states. [2019-11-20 02:05:00,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:00,291 INFO L93 Difference]: Finished difference Result 9088 states and 14347 transitions. [2019-11-20 02:05:00,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:00,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 552 [2019-11-20 02:05:00,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:00,317 INFO L225 Difference]: With dead ends: 9088 [2019-11-20 02:05:00,317 INFO L226 Difference]: Without dead ends: 6161 [2019-11-20 02:05:00,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 1092 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-20 02:05:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6161 states. [2019-11-20 02:05:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6161 to 4774. [2019-11-20 02:05:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4774 states. [2019-11-20 02:05:00,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4774 states to 4774 states and 7846 transitions. [2019-11-20 02:05:00,499 INFO L78 Accepts]: Start accepts. Automaton has 4774 states and 7846 transitions. Word has length 552 [2019-11-20 02:05:00,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:00,499 INFO L462 AbstractCegarLoop]: Abstraction has 4774 states and 7846 transitions. [2019-11-20 02:05:00,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:00,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4774 states and 7846 transitions. [2019-11-20 02:05:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2019-11-20 02:05:00,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:00,511 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:00,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:05:00,723 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:00,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:00,724 INFO L82 PathProgramCache]: Analyzing trace with hash 391974632, now seen corresponding path program 1 times [2019-11-20 02:05:00,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:05:00,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1577090124] [2019-11-20 02:05:00,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:05:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:03,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-20 02:05:03,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:05:03,985 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 02:05:03,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:04,882 WARN L191 SmtUtils]: Spent 896.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 02:05:04,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:04,884 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_307|, |v_#memory_$Pointer$.offset_283|], 2=[|v_#memory_$Pointer$.offset_280|, |v_#memory_$Pointer$.base_305|, |v_#memory_$Pointer$.offset_281|, |v_#memory_$Pointer$.base_304|]} [2019-11-20 02:05:05,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:05,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:05,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:05,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:05,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:05,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:05,169 INFO L237 Elim1Store]: Index analysis took 197 ms [2019-11-20 02:05:05,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 02:05:05,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:06,328 WARN L191 SmtUtils]: Spent 937.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 02:05:06,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:06,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:06,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:06,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:06,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:06,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:06,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:06,549 INFO L237 Elim1Store]: Index analysis took 163 ms [2019-11-20 02:05:06,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 02:05:06,749 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:07,329 WARN L191 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-20 02:05:07,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:07,342 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:07,686 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 02:05:07,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:07,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:07,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:07,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:07,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:07,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:07,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:07,814 INFO L377 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:05:07,814 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,036 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 02:05:08,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-20 02:05:08,063 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,137 INFO L377 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:05:08,137 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,168 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:156, output treesize:23 [2019-11-20 02:05:08,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,182 INFO L377 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 30 treesize of output 14 [2019-11-20 02:05:08,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,200 INFO L377 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 29 treesize of output 13 [2019-11-20 02:05:08,200 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,207 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 02:05:08,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,214 INFO L377 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 30 treesize of output 14 [2019-11-20 02:05:08,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,231 INFO L377 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 29 treesize of output 13 [2019-11-20 02:05:08,231 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,238 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,238 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 02:05:08,247 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:08,349 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 02:05:08,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,352 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:08,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 34 treesize of output 22 [2019-11-20 02:05:08,459 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,521 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 23 [2019-11-20 02:05:08,521 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,545 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-20 02:05:08,615 INFO L377 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 36 treesize of output 35 [2019-11-20 02:05:08,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 30 [2019-11-20 02:05:08,704 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2019-11-20 02:05:08,754 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,780 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:96, output treesize:46 [2019-11-20 02:05:08,830 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_312|, |v_#memory_$Pointer$.offset_288|], 6=[|v_#memory_int_303|]} [2019-11-20 02:05:08,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,851 INFO L377 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 44 treesize of output 22 [2019-11-20 02:05:08,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,951 INFO L377 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 29 treesize of output 13 [2019-11-20 02:05:08,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:08,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:08,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:08,989 INFO L377 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 37 treesize of output 39 [2019-11-20 02:05:08,989 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:09,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:09,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:09,005 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:97, output treesize:55 [2019-11-20 02:05:09,034 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 6=[|#memory_int|]} [2019-11-20 02:05:09,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2019-11-20 02:05:09,037 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:09,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-20 02:05:09,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:09,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:09,067 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 02:05:09,068 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:09,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:09,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:09,072 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:59, output treesize:4 [2019-11-20 02:05:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 368 proven. 1 refuted. 0 times theorem prover too weak. 2383 trivial. 0 not checked. [2019-11-20 02:05:09,339 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:05:09,364 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:09,381 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:09,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,386 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:42 [2019-11-20 02:05:09,409 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:09,430 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:09,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,436 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:57 [2019-11-20 02:05:09,571 INFO L343 Elim1Store]: treesize reduction 55, result has 6.8 percent of original size [2019-11-20 02:05:09,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 216 [2019-11-20 02:05:09,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:09,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:05:09,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-20 02:05:09,634 INFO L567 ElimStorePlain]: treesize reduction 113, result has 28.5 percent of original size [2019-11-20 02:05:09,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:45 [2019-11-20 02:05:09,687 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_318|, |v_#memory_$Pointer$.base_342|], 2=[|v_#memory_$Pointer$.base_306|, |v_#memory_$Pointer$.offset_282|]} [2019-11-20 02:05:09,698 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:09,797 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:09,829 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:09,848 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:09,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,857 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:123, output treesize:63 [2019-11-20 02:05:09,895 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:09,928 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:09,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:09,945 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:83, output treesize:53 [2019-11-20 02:05:10,019 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:10,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:10,055 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:10,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:10,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:10,068 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:83, output treesize:53 [2019-11-20 02:05:10,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 367 proven. 2 refuted. 0 times theorem prover too weak. 2383 trivial. 0 not checked. [2019-11-20 02:05:10,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1577090124] [2019-11-20 02:05:10,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:05:10,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-20 02:05:10,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880926751] [2019-11-20 02:05:10,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 02:05:10,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:05:10,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 02:05:10,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-20 02:05:10,538 INFO L87 Difference]: Start difference. First operand 4774 states and 7846 transitions. Second operand 13 states. [2019-11-20 02:05:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:27,894 INFO L93 Difference]: Finished difference Result 12888 states and 21065 transitions. [2019-11-20 02:05:27,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 02:05:27,896 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 555 [2019-11-20 02:05:27,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:27,924 INFO L225 Difference]: With dead ends: 12888 [2019-11-20 02:05:27,924 INFO L226 Difference]: Without dead ends: 8122 [2019-11-20 02:05:27,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1110 GetRequests, 1094 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-11-20 02:05:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8122 states. [2019-11-20 02:05:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8122 to 7315. [2019-11-20 02:05:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7315 states. [2019-11-20 02:05:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7315 states to 7315 states and 12010 transitions. [2019-11-20 02:05:28,184 INFO L78 Accepts]: Start accepts. Automaton has 7315 states and 12010 transitions. Word has length 555 [2019-11-20 02:05:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:28,184 INFO L462 AbstractCegarLoop]: Abstraction has 7315 states and 12010 transitions. [2019-11-20 02:05:28,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 02:05:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 7315 states and 12010 transitions. [2019-11-20 02:05:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2019-11-20 02:05:28,199 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:28,199 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:28,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:05:28,414 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:28,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:28,414 INFO L82 PathProgramCache]: Analyzing trace with hash -815086488, now seen corresponding path program 2 times [2019-11-20 02:05:28,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:05:28,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [990373283] [2019-11-20 02:05:28,416 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:05:29,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 02:05:29,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 02:05:29,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 02:05:29,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:05:30,022 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 02:05:30,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:30,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:30,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:30,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 02:05:30,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:30,049 INFO L377 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 23 treesize of output 22 [2019-11-20 02:05:30,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:30,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:30,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:30,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 02:05:30,081 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:30,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 02:05:30,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:30,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:30,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:30,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:5 [2019-11-20 02:05:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 1522 proven. 2 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2019-11-20 02:05:30,471 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:05:30,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 1524 proven. 0 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2019-11-20 02:05:30,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [990373283] [2019-11-20 02:05:30,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:05:30,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-20 02:05:30,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322315966] [2019-11-20 02:05:30,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:05:30,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:05:30,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:05:30,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:05:30,788 INFO L87 Difference]: Start difference. First operand 7315 states and 12010 transitions. Second operand 4 states. [2019-11-20 02:05:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:33,194 INFO L93 Difference]: Finished difference Result 16127 states and 25976 transitions. [2019-11-20 02:05:33,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:05:33,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 555 [2019-11-20 02:05:33,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:33,215 INFO L225 Difference]: With dead ends: 16127 [2019-11-20 02:05:33,215 INFO L226 Difference]: Without dead ends: 11361 [2019-11-20 02:05:33,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1109 GetRequests, 1101 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-20 02:05:33,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11361 states. [2019-11-20 02:05:33,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11361 to 8976. [2019-11-20 02:05:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8976 states. [2019-11-20 02:05:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8976 states to 8976 states and 14938 transitions. [2019-11-20 02:05:33,512 INFO L78 Accepts]: Start accepts. Automaton has 8976 states and 14938 transitions. Word has length 555 [2019-11-20 02:05:33,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:33,512 INFO L462 AbstractCegarLoop]: Abstraction has 8976 states and 14938 transitions. [2019-11-20 02:05:33,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:05:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 8976 states and 14938 transitions. [2019-11-20 02:05:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2019-11-20 02:05:33,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:33,528 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:33,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:05:33,730 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:33,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:33,731 INFO L82 PathProgramCache]: Analyzing trace with hash 845898666, now seen corresponding path program 1 times [2019-11-20 02:05:33,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:05:33,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2068319003] [2019-11-20 02:05:33,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:05:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:05:36,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-20 02:05:36,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:05:36,847 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 02:05:36,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:37,697 WARN L191 SmtUtils]: Spent 849.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 02:05:37,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:37,699 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_371|, |v_#memory_$Pointer$.offset_347|], 2=[|v_#memory_$Pointer$.base_368|, |v_#memory_$Pointer$.base_367|, |v_#memory_$Pointer$.offset_343|, |v_#memory_$Pointer$.offset_344|]} [2019-11-20 02:05:37,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:37,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:37,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:37,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:37,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:37,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:38,040 INFO L237 Elim1Store]: Index analysis took 275 ms [2019-11-20 02:05:38,265 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 02:05:38,265 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:39,019 WARN L191 SmtUtils]: Spent 753.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 02:05:39,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:39,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:39,286 INFO L237 Elim1Store]: Index analysis took 207 ms [2019-11-20 02:05:39,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 02:05:39,458 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:40,027 WARN L191 SmtUtils]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-20 02:05:40,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:40,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,209 INFO L377 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:05:40,210 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:40,510 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 02:05:40,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:40,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,556 INFO L377 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:05:40,556 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:40,712 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 02:05:40,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:40,715 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:40,829 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 02:05:40,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:40,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-20 02:05:40,843 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:40,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:40,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:40,935 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:156, output treesize:23 [2019-11-20 02:05:40,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,949 INFO L377 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 30 treesize of output 14 [2019-11-20 02:05:40,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:40,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:40,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,969 INFO L377 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 29 treesize of output 13 [2019-11-20 02:05:40,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:40,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:40,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:40,976 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 02:05:40,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:40,984 INFO L377 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 29 treesize of output 13 [2019-11-20 02:05:40,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:40,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:41,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:41,001 INFO L377 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 30 treesize of output 14 [2019-11-20 02:05:41,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:41,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 02:05:41,014 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:41,115 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 02:05:41,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:41,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:41,138 INFO L377 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 29 treesize of output 13 [2019-11-20 02:05:41,138 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:41,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:41,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:41,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:41,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 35 treesize of output 23 [2019-11-20 02:05:41,209 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:41,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:41,231 INFO L377 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 29 treesize of output 13 [2019-11-20 02:05:41,231 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:41,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,242 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-20 02:05:41,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,564 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 02:05:41,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:41,569 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,711 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 02:05:41,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:41,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:41,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2019-11-20 02:05:41,728 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:41,800 INFO L377 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 35 treesize of output 34 [2019-11-20 02:05:41,800 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:41,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:41,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2019-11-20 02:05:41,841 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:41,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,864 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:133, output treesize:44 [2019-11-20 02:05:41,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:41,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2019-11-20 02:05:41,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:41,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:41,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2019-11-20 02:05:41,917 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:41,936 INFO L377 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 35 treesize of output 34 [2019-11-20 02:05:41,936 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:41,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:41,967 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:95, output treesize:53 [2019-11-20 02:05:41,991 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_377|, |v_#memory_$Pointer$.offset_353|], 6=[|v_#memory_int_362|]} [2019-11-20 02:05:42,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:42,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2019-11-20 02:05:42,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:42,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:42,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:42,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 28 [2019-11-20 02:05:42,052 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:42,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:42,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:05:42,076 INFO L377 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 36 treesize of output 38 [2019-11-20 02:05:42,077 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:42,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:42,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:42,093 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:104, output treesize:54 [2019-11-20 02:05:42,126 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 6=[|#memory_int|]} [2019-11-20 02:05:42,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2019-11-20 02:05:42,129 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:42,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:42,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-20 02:05:42,153 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:42,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:42,165 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 02:05:42,165 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:42,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:42,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:05:42,170 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:58, output treesize:3 [2019-11-20 02:05:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 368 proven. 1 refuted. 0 times theorem prover too weak. 2383 trivial. 0 not checked. [2019-11-20 02:05:42,410 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:05:42,457 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:42,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:42,492 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:42,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:42,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:42,502 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:41 [2019-11-20 02:05:42,531 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:42,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:42,550 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:42,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:42,556 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:42,556 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:87, output treesize:56 [2019-11-20 02:05:42,595 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_406|, |v_#memory_$Pointer$.offset_382|], 2=[|v_#memory_$Pointer$.offset_346|, |v_#memory_$Pointer$.base_370|]} [2019-11-20 02:05:42,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:42,748 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 02:05:42,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:42,752 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:42,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:42,787 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:42,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:42,807 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:42,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:42,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:42,813 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:137, output treesize:56 [2019-11-20 02:05:42,860 INFO L343 Elim1Store]: treesize reduction 55, result has 6.8 percent of original size [2019-11-20 02:05:42,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 214 [2019-11-20 02:05:42,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:05:42,894 INFO L567 ElimStorePlain]: treesize reduction 156, result has 22.4 percent of original size [2019-11-20 02:05:42,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:42,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:45 [2019-11-20 02:05:42,926 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_407|, |v_#memory_$Pointer$.offset_383|], 2=[|v_#memory_$Pointer$.base_369|, |v_#memory_$Pointer$.offset_345|]} [2019-11-20 02:05:42,940 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:43,052 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 02:05:43,052 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:43,057 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:43,109 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:43,113 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:43,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:43,147 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:43,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:43,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:43,169 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:123, output treesize:63 [2019-11-20 02:05:43,220 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:43,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:43,238 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:43,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:43,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:43,246 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:83, output treesize:53 [2019-11-20 02:05:43,288 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:43,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:43,306 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:43,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:05:43,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-20 02:05:43,315 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:83, output treesize:53 [2019-11-20 02:05:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 367 proven. 2 refuted. 0 times theorem prover too weak. 2383 trivial. 0 not checked. [2019-11-20 02:05:43,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2068319003] [2019-11-20 02:05:43,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:05:43,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-20 02:05:43,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960572339] [2019-11-20 02:05:43,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 02:05:43,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:05:43,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 02:05:43,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-11-20 02:05:43,733 INFO L87 Difference]: Start difference. First operand 8976 states and 14938 transitions. Second operand 13 states. [2019-11-20 02:05:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:05:59,117 INFO L93 Difference]: Finished difference Result 16978 states and 28047 transitions. [2019-11-20 02:05:59,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 02:05:59,119 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 555 [2019-11-20 02:05:59,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:05:59,132 INFO L225 Difference]: With dead ends: 16978 [2019-11-20 02:05:59,132 INFO L226 Difference]: Without dead ends: 9673 [2019-11-20 02:05:59,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1110 GetRequests, 1094 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-11-20 02:05:59,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9673 states. [2019-11-20 02:05:59,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9673 to 9088. [2019-11-20 02:05:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9088 states. [2019-11-20 02:05:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9088 states to 9088 states and 15077 transitions. [2019-11-20 02:05:59,505 INFO L78 Accepts]: Start accepts. Automaton has 9088 states and 15077 transitions. Word has length 555 [2019-11-20 02:05:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:05:59,506 INFO L462 AbstractCegarLoop]: Abstraction has 9088 states and 15077 transitions. [2019-11-20 02:05:59,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 02:05:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 9088 states and 15077 transitions. [2019-11-20 02:05:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2019-11-20 02:05:59,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:05:59,522 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:05:59,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:05:59,738 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:05:59,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:05:59,739 INFO L82 PathProgramCache]: Analyzing trace with hash 817270966, now seen corresponding path program 1 times [2019-11-20 02:05:59,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:05:59,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1491974306] [2019-11-20 02:05:59,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:06:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:00,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 1158 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:06:00,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:06:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2019-11-20 02:06:00,269 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:06:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2019-11-20 02:06:00,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1491974306] [2019-11-20 02:06:00,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:00,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 02:06:00,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006218630] [2019-11-20 02:06:00,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:06:00,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:06:00,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:06:00,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:06:00,482 INFO L87 Difference]: Start difference. First operand 9088 states and 15077 transitions. Second operand 3 states. [2019-11-20 02:06:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:00,817 INFO L93 Difference]: Finished difference Result 16771 states and 27769 transitions. [2019-11-20 02:06:00,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:06:00,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 556 [2019-11-20 02:06:00,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:00,830 INFO L225 Difference]: With dead ends: 16771 [2019-11-20 02:06:00,830 INFO L226 Difference]: Without dead ends: 9321 [2019-11-20 02:06:00,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1110 GetRequests, 1109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:06:00,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9321 states. [2019-11-20 02:06:01,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9321 to 9248. [2019-11-20 02:06:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9248 states. [2019-11-20 02:06:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9248 states to 9248 states and 15172 transitions. [2019-11-20 02:06:01,123 INFO L78 Accepts]: Start accepts. Automaton has 9248 states and 15172 transitions. Word has length 556 [2019-11-20 02:06:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:01,124 INFO L462 AbstractCegarLoop]: Abstraction has 9248 states and 15172 transitions. [2019-11-20 02:06:01,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:06:01,124 INFO L276 IsEmpty]: Start isEmpty. Operand 9248 states and 15172 transitions. [2019-11-20 02:06:01,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2019-11-20 02:06:01,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:01,134 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:06:01,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:06:01,335 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:01,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:01,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1990001251, now seen corresponding path program 1 times [2019-11-20 02:06:01,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:06:01,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [873897508] [2019-11-20 02:06:01,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:06:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:06:01,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:06:01,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:06:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2755 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 2383 trivial. 0 not checked. [2019-11-20 02:06:01,962 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:06:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2755 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 2383 trivial. 0 not checked. [2019-11-20 02:06:02,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [873897508] [2019-11-20 02:06:02,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:02,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 02:06:02,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785041225] [2019-11-20 02:06:02,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:06:02,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:06:02,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:06:02,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:06:02,122 INFO L87 Difference]: Start difference. First operand 9248 states and 15172 transitions. Second operand 3 states. [2019-11-20 02:06:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:02,604 INFO L93 Difference]: Finished difference Result 24330 states and 39890 transitions. [2019-11-20 02:06:02,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:06:02,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 558 [2019-11-20 02:06:02,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:02,621 INFO L225 Difference]: With dead ends: 24330 [2019-11-20 02:06:02,621 INFO L226 Difference]: Without dead ends: 16726 [2019-11-20 02:06:02,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1114 GetRequests, 1113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:06:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16726 states. [2019-11-20 02:06:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16726 to 16724. [2019-11-20 02:06:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16724 states. [2019-11-20 02:06:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16724 states to 16724 states and 27264 transitions. [2019-11-20 02:06:03,145 INFO L78 Accepts]: Start accepts. Automaton has 16724 states and 27264 transitions. Word has length 558 [2019-11-20 02:06:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:03,146 INFO L462 AbstractCegarLoop]: Abstraction has 16724 states and 27264 transitions. [2019-11-20 02:06:03,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:06:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 16724 states and 27264 transitions. [2019-11-20 02:06:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2019-11-20 02:06:03,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:03,166 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:06:03,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:06:03,366 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:03,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1540755497, now seen corresponding path program 2 times [2019-11-20 02:06:03,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:06:03,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1795194848] [2019-11-20 02:06:03,368 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:06:03,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 02:06:03,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 02:06:04,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 1161 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:06:04,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:06:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2755 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 2383 trivial. 0 not checked. [2019-11-20 02:06:04,171 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:06:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2755 backedges. 372 proven. 0 refuted. 0 times theorem prover too weak. 2383 trivial. 0 not checked. [2019-11-20 02:06:04,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1795194848] [2019-11-20 02:06:04,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:06:04,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 02:06:04,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236342696] [2019-11-20 02:06:04,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:06:04,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:06:04,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:06:04,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:06:04,416 INFO L87 Difference]: Start difference. First operand 16724 states and 27264 transitions. Second operand 3 states. [2019-11-20 02:06:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:06:04,828 INFO L93 Difference]: Finished difference Result 31891 states and 51998 transitions. [2019-11-20 02:06:04,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:06:04,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 558 [2019-11-20 02:06:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:06:04,847 INFO L225 Difference]: With dead ends: 31891 [2019-11-20 02:06:04,847 INFO L226 Difference]: Without dead ends: 24287 [2019-11-20 02:06:04,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1114 GetRequests, 1113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:06:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24287 states. [2019-11-20 02:06:05,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24287 to 24285. [2019-11-20 02:06:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24285 states. [2019-11-20 02:06:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24285 states to 24285 states and 39512 transitions. [2019-11-20 02:06:05,410 INFO L78 Accepts]: Start accepts. Automaton has 24285 states and 39512 transitions. Word has length 558 [2019-11-20 02:06:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:06:05,410 INFO L462 AbstractCegarLoop]: Abstraction has 24285 states and 39512 transitions. [2019-11-20 02:06:05,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:06:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 24285 states and 39512 transitions. [2019-11-20 02:06:05,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2019-11-20 02:06:05,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:06:05,427 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:06:05,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:06:05,627 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:06:05,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:06:05,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1567770328, now seen corresponding path program 2 times [2019-11-20 02:06:05,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:06:05,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1877051709] [2019-11-20 02:06:05,629 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:06:07,256 ERROR L271 FreeRefinementEngine]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2019-11-20 02:06:07,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1131765091] [2019-11-20 02:06:07,256 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a569c3e2-5447-48b0-9c9c-dd7a11437fab/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:06:08,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 02:06:08,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 02:06:08,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-20 02:06:08,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:06:08,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 02:06:08,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:06:08,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:08,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:06:08,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 02:06:08,399 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_478|, |v_#memory_$Pointer$.base_503|], 6=[|v_#memory_int_488|]} [2019-11-20 02:06:08,403 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-20 02:06:08,403 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:06:08,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:08,437 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-20 02:06:08,438 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:06:08,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:08,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:06:08,571 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:08,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 103 [2019-11-20 02:06:08,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:06:08,572 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:06:08,668 INFO L567 ElimStorePlain]: treesize reduction 56, result has 44.0 percent of original size [2019-11-20 02:06:08,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:06:08,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:06:08,669 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:54, output treesize:44 [2019-11-20 02:06:08,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:06:08,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:06:08,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:06:08,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:06:08,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:06:08,794 INFO L377 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 36 treesize of output 38 [2019-11-20 02:06:08,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:06:08,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:06:08,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:06:08,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:06:08,859 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:08,860 INFO L377 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 3 case distinctions, treesize of input 47 treesize of output 118 [2019-11-20 02:06:08,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:06:08,966 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-11-20 02:06:08,966 INFO L567 ElimStorePlain]: treesize reduction 66, result has 56.6 percent of original size [2019-11-20 02:06:08,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 02:06:08,967 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:65 [2019-11-20 02:06:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 1392 proven. 0 refuted. 0 times theorem prover too weak. 1364 trivial. 0 not checked. [2019-11-20 02:06:09,479 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:06:09,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-20 02:06:09,580 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:06:09,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:09,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:06:09,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:36 [2019-11-20 02:06:09,634 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:06:09,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:09,656 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:06:09,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:77 [2019-11-20 02:06:09,732 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_508|], 2=[|v_#memory_$Pointer$.base_502|]} [2019-11-20 02:06:09,735 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:06:09,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:09,780 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:06:09,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:06:09,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 02:06:09,803 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:147, output treesize:127 [2019-11-20 02:06:10,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:06:10,067 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 02:06:10,071 INFO L168 Benchmark]: Toolchain (without parser) took 585617.90 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -213.5 MB). Peak memory consumption was 884.9 MB. Max. memory is 11.5 GB. [2019-11-20 02:06:10,071 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:06:10,071 INFO L168 Benchmark]: CACSL2BoogieTranslator took 945.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-11-20 02:06:10,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.10 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:06:10,072 INFO L168 Benchmark]: Boogie Preprocessor took 158.99 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:06:10,072 INFO L168 Benchmark]: RCFGBuilder took 4501.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.5 MB). Peak memory consumption was 95.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:06:10,072 INFO L168 Benchmark]: TraceAbstraction took 579922.64 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 932.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -133.6 MB). Peak memory consumption was 799.1 MB. Max. memory is 11.5 GB. [2019-11-20 02:06:10,074 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 945.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -188.4 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.10 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 158.99 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4501.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.5 MB). Peak memory consumption was 95.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 579922.64 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 932.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -133.6 MB). Peak memory consumption was 799.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...