./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/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 cc19bcc101ef1dd198c78f620192eb69b4a92f44 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/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 cc19bcc101ef1dd198c78f620192eb69b4a92f44 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:54:36,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:54:36,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:54:36,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:54:36,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:54:36,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:54:36,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:54:36,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:54:36,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:54:36,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:54:36,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:54:36,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:54:36,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:54:36,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:54:36,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:54:36,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:54:36,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:54:36,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:54:36,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:54:36,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:54:36,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:54:36,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:54:36,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:54:36,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:54:36,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:54:36,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:54:36,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:54:36,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:54:36,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:54:36,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:54:36,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:54:36,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:54:36,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:54:36,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:54:36,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:54:36,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:54:36,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:54:36,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:54:36,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:54:36,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:54:36,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:54:36,610 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:54:36,620 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:54:36,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:54:36,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:54:36,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:54:36,621 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:54:36,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:54:36,621 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:54:36,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:54:36,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:54:36,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:54:36,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:54:36,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:54:36,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:54:36,622 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:54:36,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:54:36,622 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:54:36,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:54:36,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:54:36,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:54:36,623 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:54:36,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:54:36,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:54:36,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:54:36,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:54:36,624 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:54:36,624 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:54:36,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:54:36,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:54:36,624 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:54:36,624 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_27bd20e1-786a-40c7-9bea-05fb44e2fe40/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 -> cc19bcc101ef1dd198c78f620192eb69b4a92f44 [2019-12-07 14:54:36,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:54:36,731 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:54:36,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:54:36,735 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:54:36,735 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:54:36,735 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-2.c [2019-12-07 14:54:36,777 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/data/a8db0831d/80f93aeb3c4c4b65bf79212bd5acf775/FLAGaa3466408 [2019-12-07 14:54:37,258 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:54:37,259 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-2.c [2019-12-07 14:54:37,271 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/data/a8db0831d/80f93aeb3c4c4b65bf79212bd5acf775/FLAGaa3466408 [2019-12-07 14:54:37,279 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/data/a8db0831d/80f93aeb3c4c4b65bf79212bd5acf775 [2019-12-07 14:54:37,281 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:54:37,282 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:54:37,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:54:37,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:54:37,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:54:37,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:54:37" (1/1) ... [2019-12-07 14:54:37,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2474919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:54:37, skipping insertion in model container [2019-12-07 14:54:37,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:54:37" (1/1) ... [2019-12-07 14:54:37,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:54:37,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:54:37,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:54:37,668 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:54:37,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:54:37,772 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:54:37,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:54:37 WrapperNode [2019-12-07 14:54:37,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:54:37,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:54:37,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:54:37,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:54:37,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:54:37" (1/1) ... [2019-12-07 14:54:37,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:54:37" (1/1) ... [2019-12-07 14:54:37,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:54:37,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:54:37,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:54:37,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:54:37,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:54:37" (1/1) ... [2019-12-07 14:54:37,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:54:37" (1/1) ... [2019-12-07 14:54:37,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:54:37" (1/1) ... [2019-12-07 14:54:37,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:54:37" (1/1) ... [2019-12-07 14:54:37,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:54:37" (1/1) ... [2019-12-07 14:54:37,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:54:37" (1/1) ... [2019-12-07 14:54:37,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:54:37" (1/1) ... [2019-12-07 14:54:37,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:54:37,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:54:37,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:54:37,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:54:37,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:54:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/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-12-07 14:54:37,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:54:37,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:54:37,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:54:37,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 14:54:37,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:54:37,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:54:37,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:54:37,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:54:38,080 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:54:38,548 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 14:54:38,548 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 14:54:38,549 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:54:38,549 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 14:54:38,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:54:38 BoogieIcfgContainer [2019-12-07 14:54:38,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:54:38,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:54:38,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:54:38,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:54:38,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:54:37" (1/3) ... [2019-12-07 14:54:38,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198f405e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:54:38, skipping insertion in model container [2019-12-07 14:54:38,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:54:37" (2/3) ... [2019-12-07 14:54:38,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198f405e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:54:38, skipping insertion in model container [2019-12-07 14:54:38,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:54:38" (3/3) ... [2019-12-07 14:54:38,555 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-2.c [2019-12-07 14:54:38,562 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:54:38,567 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:54:38,574 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:54:38,590 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:54:38,590 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:54:38,590 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:54:38,590 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:54:38,590 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:54:38,591 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:54:38,591 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:54:38,591 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:54:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-12-07 14:54:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 14:54:38,610 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:38,611 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, 1] [2019-12-07 14:54:38,611 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:38,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:38,615 INFO L82 PathProgramCache]: Analyzing trace with hash -635828374, now seen corresponding path program 1 times [2019-12-07 14:54:38,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:38,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269795478] [2019-12-07 14:54:38,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:38,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269795478] [2019-12-07 14:54:38,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:38,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:38,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580443088] [2019-12-07 14:54:38,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:38,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:38,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:38,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:38,836 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2019-12-07 14:54:39,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:39,150 INFO L93 Difference]: Finished difference Result 347 states and 595 transitions. [2019-12-07 14:54:39,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:39,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 14:54:39,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:39,160 INFO L225 Difference]: With dead ends: 347 [2019-12-07 14:54:39,161 INFO L226 Difference]: Without dead ends: 175 [2019-12-07 14:54:39,164 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-12-07 14:54:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-07 14:54:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 158. [2019-12-07 14:54:39,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 14:54:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 250 transitions. [2019-12-07 14:54:39,202 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 250 transitions. Word has length 45 [2019-12-07 14:54:39,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:39,202 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 250 transitions. [2019-12-07 14:54:39,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:39,203 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 250 transitions. [2019-12-07 14:54:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 14:54:39,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:39,205 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, 1] [2019-12-07 14:54:39,205 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:39,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:39,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1657614453, now seen corresponding path program 1 times [2019-12-07 14:54:39,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:39,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026989620] [2019-12-07 14:54:39,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:39,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026989620] [2019-12-07 14:54:39,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:39,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:39,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523559792] [2019-12-07 14:54:39,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:39,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:39,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:39,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:39,288 INFO L87 Difference]: Start difference. First operand 158 states and 250 transitions. Second operand 4 states. [2019-12-07 14:54:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:39,526 INFO L93 Difference]: Finished difference Result 314 states and 491 transitions. [2019-12-07 14:54:39,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:39,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 14:54:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:39,528 INFO L225 Difference]: With dead ends: 314 [2019-12-07 14:54:39,528 INFO L226 Difference]: Without dead ends: 175 [2019-12-07 14:54:39,529 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-12-07 14:54:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-07 14:54:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 158. [2019-12-07 14:54:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 14:54:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 249 transitions. [2019-12-07 14:54:39,538 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 249 transitions. Word has length 58 [2019-12-07 14:54:39,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:39,538 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 249 transitions. [2019-12-07 14:54:39,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 249 transitions. [2019-12-07 14:54:39,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 14:54:39,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:39,541 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, 1] [2019-12-07 14:54:39,541 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:39,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:39,541 INFO L82 PathProgramCache]: Analyzing trace with hash 228250247, now seen corresponding path program 1 times [2019-12-07 14:54:39,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:39,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129804856] [2019-12-07 14:54:39,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:39,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129804856] [2019-12-07 14:54:39,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:39,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:39,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925587821] [2019-12-07 14:54:39,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:39,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:39,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:39,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:39,596 INFO L87 Difference]: Start difference. First operand 158 states and 249 transitions. Second operand 4 states. [2019-12-07 14:54:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:39,816 INFO L93 Difference]: Finished difference Result 313 states and 489 transitions. [2019-12-07 14:54:39,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:39,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 14:54:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:39,819 INFO L225 Difference]: With dead ends: 313 [2019-12-07 14:54:39,819 INFO L226 Difference]: Without dead ends: 174 [2019-12-07 14:54:39,820 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-12-07 14:54:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-07 14:54:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2019-12-07 14:54:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 14:54:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 248 transitions. [2019-12-07 14:54:39,830 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 248 transitions. Word has length 59 [2019-12-07 14:54:39,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:39,830 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 248 transitions. [2019-12-07 14:54:39,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 248 transitions. [2019-12-07 14:54:39,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 14:54:39,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:39,832 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, 1] [2019-12-07 14:54:39,832 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:39,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:39,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1571443698, now seen corresponding path program 1 times [2019-12-07 14:54:39,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:39,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666720766] [2019-12-07 14:54:39,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:39,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:39,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666720766] [2019-12-07 14:54:39,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:39,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:39,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751086485] [2019-12-07 14:54:39,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:39,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:39,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:39,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:39,895 INFO L87 Difference]: Start difference. First operand 158 states and 248 transitions. Second operand 4 states. [2019-12-07 14:54:40,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:40,096 INFO L93 Difference]: Finished difference Result 311 states and 486 transitions. [2019-12-07 14:54:40,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:40,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 14:54:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:40,098 INFO L225 Difference]: With dead ends: 311 [2019-12-07 14:54:40,098 INFO L226 Difference]: Without dead ends: 172 [2019-12-07 14:54:40,098 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-12-07 14:54:40,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-07 14:54:40,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2019-12-07 14:54:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 14:54:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 247 transitions. [2019-12-07 14:54:40,104 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 247 transitions. Word has length 59 [2019-12-07 14:54:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:40,104 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 247 transitions. [2019-12-07 14:54:40,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 247 transitions. [2019-12-07 14:54:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 14:54:40,105 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:40,105 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, 1] [2019-12-07 14:54:40,105 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:40,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:40,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1774175438, now seen corresponding path program 1 times [2019-12-07 14:54:40,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:40,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340467699] [2019-12-07 14:54:40,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:40,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:40,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340467699] [2019-12-07 14:54:40,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:40,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:40,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68714073] [2019-12-07 14:54:40,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:40,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:40,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:40,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:40,147 INFO L87 Difference]: Start difference. First operand 158 states and 247 transitions. Second operand 4 states. [2019-12-07 14:54:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:40,338 INFO L93 Difference]: Finished difference Result 310 states and 484 transitions. [2019-12-07 14:54:40,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:40,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 14:54:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:40,340 INFO L225 Difference]: With dead ends: 310 [2019-12-07 14:54:40,340 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 14:54:40,340 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-12-07 14:54:40,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 14:54:40,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2019-12-07 14:54:40,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 14:54:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 246 transitions. [2019-12-07 14:54:40,345 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 246 transitions. Word has length 59 [2019-12-07 14:54:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:40,345 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 246 transitions. [2019-12-07 14:54:40,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 246 transitions. [2019-12-07 14:54:40,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 14:54:40,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:40,346 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, 1] [2019-12-07 14:54:40,346 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:40,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:40,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1066261019, now seen corresponding path program 1 times [2019-12-07 14:54:40,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:40,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792345206] [2019-12-07 14:54:40,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:40,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:40,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792345206] [2019-12-07 14:54:40,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:40,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:40,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174236108] [2019-12-07 14:54:40,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:40,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:40,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:40,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:40,385 INFO L87 Difference]: Start difference. First operand 158 states and 246 transitions. Second operand 4 states. [2019-12-07 14:54:40,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:40,588 INFO L93 Difference]: Finished difference Result 310 states and 483 transitions. [2019-12-07 14:54:40,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:40,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 14:54:40,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:40,590 INFO L225 Difference]: With dead ends: 310 [2019-12-07 14:54:40,590 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 14:54:40,590 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-12-07 14:54:40,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 14:54:40,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2019-12-07 14:54:40,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 14:54:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 245 transitions. [2019-12-07 14:54:40,593 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 245 transitions. Word has length 59 [2019-12-07 14:54:40,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:40,594 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 245 transitions. [2019-12-07 14:54:40,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 245 transitions. [2019-12-07 14:54:40,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 14:54:40,594 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:40,594 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, 1] [2019-12-07 14:54:40,594 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:40,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:40,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1887195906, now seen corresponding path program 1 times [2019-12-07 14:54:40,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:40,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169053332] [2019-12-07 14:54:40,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:40,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169053332] [2019-12-07 14:54:40,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:40,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:40,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826921300] [2019-12-07 14:54:40,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:40,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:40,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:40,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:40,630 INFO L87 Difference]: Start difference. First operand 158 states and 245 transitions. Second operand 4 states. [2019-12-07 14:54:40,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:40,819 INFO L93 Difference]: Finished difference Result 310 states and 482 transitions. [2019-12-07 14:54:40,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:40,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 14:54:40,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:40,820 INFO L225 Difference]: With dead ends: 310 [2019-12-07 14:54:40,820 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 14:54:40,821 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-12-07 14:54:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 14:54:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2019-12-07 14:54:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 14:54:40,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 244 transitions. [2019-12-07 14:54:40,826 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 244 transitions. Word has length 60 [2019-12-07 14:54:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:40,826 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 244 transitions. [2019-12-07 14:54:40,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 244 transitions. [2019-12-07 14:54:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 14:54:40,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:40,827 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, 1] [2019-12-07 14:54:40,828 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:40,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1006123136, now seen corresponding path program 1 times [2019-12-07 14:54:40,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:40,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860865490] [2019-12-07 14:54:40,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:40,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860865490] [2019-12-07 14:54:40,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:40,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:40,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160587090] [2019-12-07 14:54:40,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:40,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:40,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:40,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:40,880 INFO L87 Difference]: Start difference. First operand 158 states and 244 transitions. Second operand 4 states. [2019-12-07 14:54:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:41,048 INFO L93 Difference]: Finished difference Result 310 states and 481 transitions. [2019-12-07 14:54:41,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:41,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-07 14:54:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:41,050 INFO L225 Difference]: With dead ends: 310 [2019-12-07 14:54:41,050 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 14:54:41,050 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-12-07 14:54:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 14:54:41,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 158. [2019-12-07 14:54:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 14:54:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 243 transitions. [2019-12-07 14:54:41,054 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 243 transitions. Word has length 61 [2019-12-07 14:54:41,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:41,054 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 243 transitions. [2019-12-07 14:54:41,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 243 transitions. [2019-12-07 14:54:41,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 14:54:41,055 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:41,055 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, 1] [2019-12-07 14:54:41,055 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:41,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:41,056 INFO L82 PathProgramCache]: Analyzing trace with hash 465903427, now seen corresponding path program 1 times [2019-12-07 14:54:41,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:41,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716068157] [2019-12-07 14:54:41,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:41,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716068157] [2019-12-07 14:54:41,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:41,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:41,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679087341] [2019-12-07 14:54:41,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:41,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:41,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:41,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:41,090 INFO L87 Difference]: Start difference. First operand 158 states and 243 transitions. Second operand 4 states. [2019-12-07 14:54:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:41,259 INFO L93 Difference]: Finished difference Result 300 states and 467 transitions. [2019-12-07 14:54:41,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:41,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 14:54:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:41,260 INFO L225 Difference]: With dead ends: 300 [2019-12-07 14:54:41,260 INFO L226 Difference]: Without dead ends: 161 [2019-12-07 14:54:41,261 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-12-07 14:54:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-12-07 14:54:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2019-12-07 14:54:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-07 14:54:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 242 transitions. [2019-12-07 14:54:41,264 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 242 transitions. Word has length 62 [2019-12-07 14:54:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:41,264 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 242 transitions. [2019-12-07 14:54:41,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 242 transitions. [2019-12-07 14:54:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 14:54:41,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:41,265 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, 1] [2019-12-07 14:54:41,265 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:41,265 INFO L82 PathProgramCache]: Analyzing trace with hash 866054827, now seen corresponding path program 1 times [2019-12-07 14:54:41,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:41,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099333138] [2019-12-07 14:54:41,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:41,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099333138] [2019-12-07 14:54:41,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:41,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:41,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382648578] [2019-12-07 14:54:41,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:41,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:41,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:41,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:41,298 INFO L87 Difference]: Start difference. First operand 158 states and 242 transitions. Second operand 4 states. [2019-12-07 14:54:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:41,516 INFO L93 Difference]: Finished difference Result 340 states and 528 transitions. [2019-12-07 14:54:41,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:41,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 14:54:41,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:41,518 INFO L225 Difference]: With dead ends: 340 [2019-12-07 14:54:41,518 INFO L226 Difference]: Without dead ends: 201 [2019-12-07 14:54:41,519 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-12-07 14:54:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-07 14:54:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 180. [2019-12-07 14:54:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 14:54:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 280 transitions. [2019-12-07 14:54:41,525 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 280 transitions. Word has length 62 [2019-12-07 14:54:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:41,525 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 280 transitions. [2019-12-07 14:54:41,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 280 transitions. [2019-12-07 14:54:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:54:41,526 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:41,526 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, 1] [2019-12-07 14:54:41,526 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:41,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1859234092, now seen corresponding path program 1 times [2019-12-07 14:54:41,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:41,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829251937] [2019-12-07 14:54:41,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:41,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829251937] [2019-12-07 14:54:41,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:41,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:41,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311868605] [2019-12-07 14:54:41,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:41,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:41,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:41,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:41,573 INFO L87 Difference]: Start difference. First operand 180 states and 280 transitions. Second operand 4 states. [2019-12-07 14:54:41,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:41,786 INFO L93 Difference]: Finished difference Result 362 states and 565 transitions. [2019-12-07 14:54:41,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:41,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 14:54:41,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:41,788 INFO L225 Difference]: With dead ends: 362 [2019-12-07 14:54:41,788 INFO L226 Difference]: Without dead ends: 201 [2019-12-07 14:54:41,788 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-12-07 14:54:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-07 14:54:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 180. [2019-12-07 14:54:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 14:54:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 279 transitions. [2019-12-07 14:54:41,792 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 279 transitions. Word has length 75 [2019-12-07 14:54:41,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:41,792 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 279 transitions. [2019-12-07 14:54:41,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 279 transitions. [2019-12-07 14:54:41,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 14:54:41,793 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:41,793 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, 1] [2019-12-07 14:54:41,793 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:41,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:41,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1419872248, now seen corresponding path program 1 times [2019-12-07 14:54:41,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:41,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323635068] [2019-12-07 14:54:41,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:41,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323635068] [2019-12-07 14:54:41,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:41,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:41,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079685109] [2019-12-07 14:54:41,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:41,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:41,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:41,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:41,828 INFO L87 Difference]: Start difference. First operand 180 states and 279 transitions. Second operand 4 states. [2019-12-07 14:54:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:42,072 INFO L93 Difference]: Finished difference Result 361 states and 562 transitions. [2019-12-07 14:54:42,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:42,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 14:54:42,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:42,074 INFO L225 Difference]: With dead ends: 361 [2019-12-07 14:54:42,074 INFO L226 Difference]: Without dead ends: 200 [2019-12-07 14:54:42,074 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-12-07 14:54:42,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-12-07 14:54:42,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2019-12-07 14:54:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 14:54:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 278 transitions. [2019-12-07 14:54:42,078 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 278 transitions. Word has length 76 [2019-12-07 14:54:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:42,078 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 278 transitions. [2019-12-07 14:54:42,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 278 transitions. [2019-12-07 14:54:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 14:54:42,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:42,079 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, 1] [2019-12-07 14:54:42,079 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:42,079 INFO L82 PathProgramCache]: Analyzing trace with hash -76678797, now seen corresponding path program 1 times [2019-12-07 14:54:42,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:42,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495856252] [2019-12-07 14:54:42,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:42,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495856252] [2019-12-07 14:54:42,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:42,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:42,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476809410] [2019-12-07 14:54:42,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:42,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:42,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:42,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:42,110 INFO L87 Difference]: Start difference. First operand 180 states and 278 transitions. Second operand 4 states. [2019-12-07 14:54:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:42,362 INFO L93 Difference]: Finished difference Result 359 states and 558 transitions. [2019-12-07 14:54:42,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:42,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 14:54:42,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:42,364 INFO L225 Difference]: With dead ends: 359 [2019-12-07 14:54:42,364 INFO L226 Difference]: Without dead ends: 198 [2019-12-07 14:54:42,364 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-12-07 14:54:42,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-12-07 14:54:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 180. [2019-12-07 14:54:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 14:54:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 277 transitions. [2019-12-07 14:54:42,369 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 277 transitions. Word has length 76 [2019-12-07 14:54:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:42,370 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 277 transitions. [2019-12-07 14:54:42,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 277 transitions. [2019-12-07 14:54:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 14:54:42,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:42,371 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, 1] [2019-12-07 14:54:42,371 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:42,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:42,372 INFO L82 PathProgramCache]: Analyzing trace with hash 872669363, now seen corresponding path program 1 times [2019-12-07 14:54:42,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:42,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938405465] [2019-12-07 14:54:42,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:42,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938405465] [2019-12-07 14:54:42,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:42,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:42,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466969961] [2019-12-07 14:54:42,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:42,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:42,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:42,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:42,416 INFO L87 Difference]: Start difference. First operand 180 states and 277 transitions. Second operand 4 states. [2019-12-07 14:54:42,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:42,654 INFO L93 Difference]: Finished difference Result 358 states and 555 transitions. [2019-12-07 14:54:42,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:42,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 14:54:42,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:42,655 INFO L225 Difference]: With dead ends: 358 [2019-12-07 14:54:42,655 INFO L226 Difference]: Without dead ends: 197 [2019-12-07 14:54:42,656 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-12-07 14:54:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-07 14:54:42,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2019-12-07 14:54:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 14:54:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 276 transitions. [2019-12-07 14:54:42,660 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 276 transitions. Word has length 76 [2019-12-07 14:54:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:42,660 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 276 transitions. [2019-12-07 14:54:42,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 276 transitions. [2019-12-07 14:54:42,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 14:54:42,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:42,661 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, 1] [2019-12-07 14:54:42,661 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:42,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash -581861476, now seen corresponding path program 1 times [2019-12-07 14:54:42,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:42,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865708797] [2019-12-07 14:54:42,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:42,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865708797] [2019-12-07 14:54:42,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:42,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:42,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169957431] [2019-12-07 14:54:42,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:42,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:42,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:42,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:42,700 INFO L87 Difference]: Start difference. First operand 180 states and 276 transitions. Second operand 4 states. [2019-12-07 14:54:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:42,913 INFO L93 Difference]: Finished difference Result 358 states and 553 transitions. [2019-12-07 14:54:42,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:42,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 14:54:42,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:42,914 INFO L225 Difference]: With dead ends: 358 [2019-12-07 14:54:42,914 INFO L226 Difference]: Without dead ends: 197 [2019-12-07 14:54:42,914 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-12-07 14:54:42,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-07 14:54:42,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2019-12-07 14:54:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 14:54:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 275 transitions. [2019-12-07 14:54:42,918 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 275 transitions. Word has length 76 [2019-12-07 14:54:42,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:42,918 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 275 transitions. [2019-12-07 14:54:42,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 275 transitions. [2019-12-07 14:54:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 14:54:42,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:42,919 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, 1] [2019-12-07 14:54:42,919 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:42,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:42,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1439385699, now seen corresponding path program 1 times [2019-12-07 14:54:42,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:42,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893767972] [2019-12-07 14:54:42,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:42,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893767972] [2019-12-07 14:54:42,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:42,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:42,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332279554] [2019-12-07 14:54:42,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:42,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:42,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:42,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:42,946 INFO L87 Difference]: Start difference. First operand 180 states and 275 transitions. Second operand 4 states. [2019-12-07 14:54:43,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:43,149 INFO L93 Difference]: Finished difference Result 358 states and 551 transitions. [2019-12-07 14:54:43,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:43,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 14:54:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:43,151 INFO L225 Difference]: With dead ends: 358 [2019-12-07 14:54:43,151 INFO L226 Difference]: Without dead ends: 197 [2019-12-07 14:54:43,152 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-12-07 14:54:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-07 14:54:43,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2019-12-07 14:54:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 14:54:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 274 transitions. [2019-12-07 14:54:43,156 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 274 transitions. Word has length 77 [2019-12-07 14:54:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:43,156 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 274 transitions. [2019-12-07 14:54:43,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 274 transitions. [2019-12-07 14:54:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 14:54:43,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:43,157 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, 1] [2019-12-07 14:54:43,158 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:43,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:43,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2003337665, now seen corresponding path program 1 times [2019-12-07 14:54:43,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:43,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307277643] [2019-12-07 14:54:43,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:43,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307277643] [2019-12-07 14:54:43,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:43,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:43,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244362107] [2019-12-07 14:54:43,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:43,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:43,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:43,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:43,192 INFO L87 Difference]: Start difference. First operand 180 states and 274 transitions. Second operand 4 states. [2019-12-07 14:54:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:43,414 INFO L93 Difference]: Finished difference Result 358 states and 549 transitions. [2019-12-07 14:54:43,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:43,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-07 14:54:43,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:43,415 INFO L225 Difference]: With dead ends: 358 [2019-12-07 14:54:43,415 INFO L226 Difference]: Without dead ends: 197 [2019-12-07 14:54:43,416 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-12-07 14:54:43,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-07 14:54:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2019-12-07 14:54:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 14:54:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 273 transitions. [2019-12-07 14:54:43,420 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 273 transitions. Word has length 78 [2019-12-07 14:54:43,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:43,421 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 273 transitions. [2019-12-07 14:54:43,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 273 transitions. [2019-12-07 14:54:43,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 14:54:43,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:43,422 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, 1] [2019-12-07 14:54:43,422 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:43,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:43,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1314782754, now seen corresponding path program 1 times [2019-12-07 14:54:43,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:43,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027921964] [2019-12-07 14:54:43,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:54:43,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027921964] [2019-12-07 14:54:43,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:43,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:43,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629143303] [2019-12-07 14:54:43,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:43,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:43,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:43,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:43,459 INFO L87 Difference]: Start difference. First operand 180 states and 273 transitions. Second operand 4 states. [2019-12-07 14:54:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:43,653 INFO L93 Difference]: Finished difference Result 348 states and 534 transitions. [2019-12-07 14:54:43,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:43,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-07 14:54:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:43,654 INFO L225 Difference]: With dead ends: 348 [2019-12-07 14:54:43,654 INFO L226 Difference]: Without dead ends: 187 [2019-12-07 14:54:43,655 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-12-07 14:54:43,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-12-07 14:54:43,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 180. [2019-12-07 14:54:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 14:54:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 272 transitions. [2019-12-07 14:54:43,658 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 272 transitions. Word has length 79 [2019-12-07 14:54:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:43,658 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 272 transitions. [2019-12-07 14:54:43,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 272 transitions. [2019-12-07 14:54:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 14:54:43,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:43,659 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-12-07 14:54:43,659 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:43,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:43,659 INFO L82 PathProgramCache]: Analyzing trace with hash 988243362, now seen corresponding path program 1 times [2019-12-07 14:54:43,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:43,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486700062] [2019-12-07 14:54:43,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:43,699 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:43,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486700062] [2019-12-07 14:54:43,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:43,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:43,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112502757] [2019-12-07 14:54:43,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:43,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:43,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:43,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:43,700 INFO L87 Difference]: Start difference. First operand 180 states and 272 transitions. Second operand 4 states. [2019-12-07 14:54:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:43,997 INFO L93 Difference]: Finished difference Result 457 states and 705 transitions. [2019-12-07 14:54:43,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:43,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 14:54:43,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:43,999 INFO L225 Difference]: With dead ends: 457 [2019-12-07 14:54:43,999 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 14:54:43,999 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-12-07 14:54:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 14:54:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 221. [2019-12-07 14:54:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-07 14:54:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 346 transitions. [2019-12-07 14:54:44,003 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 346 transitions. Word has length 84 [2019-12-07 14:54:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:44,004 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 346 transitions. [2019-12-07 14:54:44,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 346 transitions. [2019-12-07 14:54:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 14:54:44,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:44,005 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-12-07 14:54:44,005 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:44,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:44,005 INFO L82 PathProgramCache]: Analyzing trace with hash 90850084, now seen corresponding path program 1 times [2019-12-07 14:54:44,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:44,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109682857] [2019-12-07 14:54:44,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:44,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109682857] [2019-12-07 14:54:44,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:44,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:44,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363354524] [2019-12-07 14:54:44,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:44,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:44,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:44,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:44,058 INFO L87 Difference]: Start difference. First operand 221 states and 346 transitions. Second operand 4 states. [2019-12-07 14:54:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:44,312 INFO L93 Difference]: Finished difference Result 473 states and 747 transitions. [2019-12-07 14:54:44,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:44,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 14:54:44,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:44,314 INFO L225 Difference]: With dead ends: 473 [2019-12-07 14:54:44,314 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 14:54:44,314 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-12-07 14:54:44,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 14:54:44,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 245. [2019-12-07 14:54:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-12-07 14:54:44,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 388 transitions. [2019-12-07 14:54:44,319 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 388 transitions. Word has length 84 [2019-12-07 14:54:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:44,319 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 388 transitions. [2019-12-07 14:54:44,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:44,319 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 388 transitions. [2019-12-07 14:54:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 14:54:44,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:44,320 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, 1] [2019-12-07 14:54:44,320 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:44,321 INFO L82 PathProgramCache]: Analyzing trace with hash 673338576, now seen corresponding path program 1 times [2019-12-07 14:54:44,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:44,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490851866] [2019-12-07 14:54:44,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:44,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490851866] [2019-12-07 14:54:44,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:44,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:44,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090435276] [2019-12-07 14:54:44,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:44,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:44,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:44,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:44,367 INFO L87 Difference]: Start difference. First operand 245 states and 388 transitions. Second operand 4 states. [2019-12-07 14:54:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:44,664 INFO L93 Difference]: Finished difference Result 536 states and 847 transitions. [2019-12-07 14:54:44,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:44,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-12-07 14:54:44,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:44,667 INFO L225 Difference]: With dead ends: 536 [2019-12-07 14:54:44,667 INFO L226 Difference]: Without dead ends: 310 [2019-12-07 14:54:44,667 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-12-07 14:54:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-12-07 14:54:44,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 246. [2019-12-07 14:54:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-07 14:54:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 389 transitions. [2019-12-07 14:54:44,671 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 389 transitions. Word has length 85 [2019-12-07 14:54:44,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:44,671 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 389 transitions. [2019-12-07 14:54:44,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 389 transitions. [2019-12-07 14:54:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 14:54:44,672 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:44,672 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, 1] [2019-12-07 14:54:44,672 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:44,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:44,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1336716605, now seen corresponding path program 1 times [2019-12-07 14:54:44,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:44,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214215007] [2019-12-07 14:54:44,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:44,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214215007] [2019-12-07 14:54:44,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:44,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:44,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24494819] [2019-12-07 14:54:44,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:44,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:44,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:44,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:44,713 INFO L87 Difference]: Start difference. First operand 246 states and 389 transitions. Second operand 4 states. [2019-12-07 14:54:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:45,007 INFO L93 Difference]: Finished difference Result 537 states and 847 transitions. [2019-12-07 14:54:45,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:45,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 14:54:45,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:45,009 INFO L225 Difference]: With dead ends: 537 [2019-12-07 14:54:45,009 INFO L226 Difference]: Without dead ends: 310 [2019-12-07 14:54:45,009 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-12-07 14:54:45,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-12-07 14:54:45,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 246. [2019-12-07 14:54:45,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-07 14:54:45,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 388 transitions. [2019-12-07 14:54:45,013 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 388 transitions. Word has length 97 [2019-12-07 14:54:45,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:45,013 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 388 transitions. [2019-12-07 14:54:45,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 388 transitions. [2019-12-07 14:54:45,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 14:54:45,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:45,014 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, 1] [2019-12-07 14:54:45,014 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:45,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:45,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1377391355, now seen corresponding path program 1 times [2019-12-07 14:54:45,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:45,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893393281] [2019-12-07 14:54:45,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:45,048 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:45,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893393281] [2019-12-07 14:54:45,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:45,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:45,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392304356] [2019-12-07 14:54:45,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:45,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:45,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:45,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:45,049 INFO L87 Difference]: Start difference. First operand 246 states and 388 transitions. Second operand 4 states. [2019-12-07 14:54:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:45,275 INFO L93 Difference]: Finished difference Result 499 states and 788 transitions. [2019-12-07 14:54:45,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:45,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 14:54:45,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:45,277 INFO L225 Difference]: With dead ends: 499 [2019-12-07 14:54:45,277 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 14:54:45,278 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-12-07 14:54:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 14:54:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 246. [2019-12-07 14:54:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-07 14:54:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 387 transitions. [2019-12-07 14:54:45,283 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 387 transitions. Word has length 97 [2019-12-07 14:54:45,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:45,283 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 387 transitions. [2019-12-07 14:54:45,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 387 transitions. [2019-12-07 14:54:45,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 14:54:45,284 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:45,284 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, 1] [2019-12-07 14:54:45,284 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:45,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:45,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1129648449, now seen corresponding path program 1 times [2019-12-07 14:54:45,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:45,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152344104] [2019-12-07 14:54:45,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:45,324 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:45,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152344104] [2019-12-07 14:54:45,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:45,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:45,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280362779] [2019-12-07 14:54:45,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:45,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:45,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:45,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:45,325 INFO L87 Difference]: Start difference. First operand 246 states and 387 transitions. Second operand 4 states. [2019-12-07 14:54:45,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:45,714 INFO L93 Difference]: Finished difference Result 536 states and 842 transitions. [2019-12-07 14:54:45,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:45,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 14:54:45,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:45,717 INFO L225 Difference]: With dead ends: 536 [2019-12-07 14:54:45,717 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 14:54:45,718 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-12-07 14:54:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 14:54:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 246. [2019-12-07 14:54:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-07 14:54:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 386 transitions. [2019-12-07 14:54:45,726 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 386 transitions. Word has length 98 [2019-12-07 14:54:45,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:45,726 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 386 transitions. [2019-12-07 14:54:45,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 386 transitions. [2019-12-07 14:54:45,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 14:54:45,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:45,727 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, 1] [2019-12-07 14:54:45,728 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:45,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:45,728 INFO L82 PathProgramCache]: Analyzing trace with hash 213545002, now seen corresponding path program 1 times [2019-12-07 14:54:45,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:45,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125042224] [2019-12-07 14:54:45,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:45,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125042224] [2019-12-07 14:54:45,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:45,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:45,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689511323] [2019-12-07 14:54:45,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:45,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:45,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:45,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:45,781 INFO L87 Difference]: Start difference. First operand 246 states and 386 transitions. Second operand 4 states. [2019-12-07 14:54:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:46,140 INFO L93 Difference]: Finished difference Result 534 states and 838 transitions. [2019-12-07 14:54:46,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:46,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 14:54:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:46,141 INFO L225 Difference]: With dead ends: 534 [2019-12-07 14:54:46,141 INFO L226 Difference]: Without dead ends: 307 [2019-12-07 14:54:46,142 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-12-07 14:54:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-07 14:54:46,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 246. [2019-12-07 14:54:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-07 14:54:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 385 transitions. [2019-12-07 14:54:46,146 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 385 transitions. Word has length 98 [2019-12-07 14:54:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:46,146 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 385 transitions. [2019-12-07 14:54:46,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 385 transitions. [2019-12-07 14:54:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 14:54:46,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:46,148 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, 1] [2019-12-07 14:54:46,148 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:46,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:46,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1162893162, now seen corresponding path program 1 times [2019-12-07 14:54:46,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:46,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146565842] [2019-12-07 14:54:46,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:46,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146565842] [2019-12-07 14:54:46,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:46,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:46,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132943883] [2019-12-07 14:54:46,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:46,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:46,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:46,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:46,188 INFO L87 Difference]: Start difference. First operand 246 states and 385 transitions. Second operand 4 states. [2019-12-07 14:54:46,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:46,489 INFO L93 Difference]: Finished difference Result 533 states and 835 transitions. [2019-12-07 14:54:46,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:46,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 14:54:46,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:46,490 INFO L225 Difference]: With dead ends: 533 [2019-12-07 14:54:46,490 INFO L226 Difference]: Without dead ends: 306 [2019-12-07 14:54:46,491 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-12-07 14:54:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-12-07 14:54:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 246. [2019-12-07 14:54:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-07 14:54:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 384 transitions. [2019-12-07 14:54:46,494 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 384 transitions. Word has length 98 [2019-12-07 14:54:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:46,495 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 384 transitions. [2019-12-07 14:54:46,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 384 transitions. [2019-12-07 14:54:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 14:54:46,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:46,495 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-12-07 14:54:46,495 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:46,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:46,496 INFO L82 PathProgramCache]: Analyzing trace with hash -291637677, now seen corresponding path program 1 times [2019-12-07 14:54:46,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:46,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915308394] [2019-12-07 14:54:46,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 14:54:46,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915308394] [2019-12-07 14:54:46,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:46,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:54:46,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047437580] [2019-12-07 14:54:46,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:54:46,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:46,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:54:46,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:54:46,537 INFO L87 Difference]: Start difference. First operand 246 states and 384 transitions. Second operand 5 states. [2019-12-07 14:54:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:46,857 INFO L93 Difference]: Finished difference Result 494 states and 776 transitions. [2019-12-07 14:54:46,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:54:46,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-07 14:54:46,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:46,858 INFO L225 Difference]: With dead ends: 494 [2019-12-07 14:54:46,858 INFO L226 Difference]: Without dead ends: 267 [2019-12-07 14:54:46,859 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-12-07 14:54:46,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-12-07 14:54:46,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2019-12-07 14:54:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 14:54:46,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 410 transitions. [2019-12-07 14:54:46,863 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 410 transitions. Word has length 98 [2019-12-07 14:54:46,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:46,863 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 410 transitions. [2019-12-07 14:54:46,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:54:46,863 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 410 transitions. [2019-12-07 14:54:46,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 14:54:46,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:46,864 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, 1] [2019-12-07 14:54:46,864 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:46,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:46,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1474462252, now seen corresponding path program 1 times [2019-12-07 14:54:46,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:46,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601089903] [2019-12-07 14:54:46,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:46,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601089903] [2019-12-07 14:54:46,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:46,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:46,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265062534] [2019-12-07 14:54:46,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:46,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:46,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:46,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:46,900 INFO L87 Difference]: Start difference. First operand 266 states and 410 transitions. Second operand 4 states. [2019-12-07 14:54:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:47,122 INFO L93 Difference]: Finished difference Result 536 states and 828 transitions. [2019-12-07 14:54:47,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:47,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 14:54:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:47,123 INFO L225 Difference]: With dead ends: 536 [2019-12-07 14:54:47,123 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 14:54:47,124 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-12-07 14:54:47,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 14:54:47,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 266. [2019-12-07 14:54:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 14:54:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 409 transitions. [2019-12-07 14:54:47,128 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 409 transitions. Word has length 98 [2019-12-07 14:54:47,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:47,128 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 409 transitions. [2019-12-07 14:54:47,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 409 transitions. [2019-12-07 14:54:47,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 14:54:47,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:47,128 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, 1] [2019-12-07 14:54:47,129 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:47,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:47,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1871156884, now seen corresponding path program 1 times [2019-12-07 14:54:47,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:47,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548452726] [2019-12-07 14:54:47,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:47,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548452726] [2019-12-07 14:54:47,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:47,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:47,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278097646] [2019-12-07 14:54:47,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:47,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:47,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:47,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:47,165 INFO L87 Difference]: Start difference. First operand 266 states and 409 transitions. Second operand 4 states. [2019-12-07 14:54:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:47,394 INFO L93 Difference]: Finished difference Result 535 states and 825 transitions. [2019-12-07 14:54:47,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:47,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 14:54:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:47,395 INFO L225 Difference]: With dead ends: 535 [2019-12-07 14:54:47,396 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 14:54:47,396 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-12-07 14:54:47,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 14:54:47,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-12-07 14:54:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 14:54:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 408 transitions. [2019-12-07 14:54:47,400 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 408 transitions. Word has length 98 [2019-12-07 14:54:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:47,400 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 408 transitions. [2019-12-07 14:54:47,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:47,400 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 408 transitions. [2019-12-07 14:54:47,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 14:54:47,401 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:47,401 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, 1] [2019-12-07 14:54:47,401 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:47,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:47,401 INFO L82 PathProgramCache]: Analyzing trace with hash -160086855, now seen corresponding path program 1 times [2019-12-07 14:54:47,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:47,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165436337] [2019-12-07 14:54:47,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:47,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165436337] [2019-12-07 14:54:47,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:47,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:47,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067563188] [2019-12-07 14:54:47,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:47,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:47,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:47,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:47,434 INFO L87 Difference]: Start difference. First operand 266 states and 408 transitions. Second operand 4 states. [2019-12-07 14:54:47,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:47,736 INFO L93 Difference]: Finished difference Result 573 states and 880 transitions. [2019-12-07 14:54:47,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:47,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 14:54:47,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:47,738 INFO L225 Difference]: With dead ends: 573 [2019-12-07 14:54:47,738 INFO L226 Difference]: Without dead ends: 326 [2019-12-07 14:54:47,738 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-12-07 14:54:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-07 14:54:47,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 266. [2019-12-07 14:54:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 14:54:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 407 transitions. [2019-12-07 14:54:47,743 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 407 transitions. Word has length 99 [2019-12-07 14:54:47,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:47,744 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 407 transitions. [2019-12-07 14:54:47,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 407 transitions. [2019-12-07 14:54:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 14:54:47,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:47,745 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, 1] [2019-12-07 14:54:47,745 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:47,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:47,745 INFO L82 PathProgramCache]: Analyzing trace with hash 273642231, now seen corresponding path program 1 times [2019-12-07 14:54:47,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:47,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139669004] [2019-12-07 14:54:47,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:47,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-12-07 14:54:47,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139669004] [2019-12-07 14:54:47,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:47,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:47,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659773189] [2019-12-07 14:54:47,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:47,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:47,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:47,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:47,787 INFO L87 Difference]: Start difference. First operand 266 states and 407 transitions. Second operand 4 states. [2019-12-07 14:54:48,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:48,021 INFO L93 Difference]: Finished difference Result 535 states and 821 transitions. [2019-12-07 14:54:48,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:48,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 14:54:48,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:48,023 INFO L225 Difference]: With dead ends: 535 [2019-12-07 14:54:48,023 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 14:54:48,023 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-12-07 14:54:48,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 14:54:48,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-12-07 14:54:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 14:54:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 406 transitions. [2019-12-07 14:54:48,027 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 406 transitions. Word has length 99 [2019-12-07 14:54:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:48,027 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 406 transitions. [2019-12-07 14:54:48,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 406 transitions. [2019-12-07 14:54:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 14:54:48,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:48,028 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, 1] [2019-12-07 14:54:48,028 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:48,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:48,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1648340570, now seen corresponding path program 1 times [2019-12-07 14:54:48,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:48,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892838261] [2019-12-07 14:54:48,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:48,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892838261] [2019-12-07 14:54:48,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:48,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:48,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997374783] [2019-12-07 14:54:48,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:48,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:48,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:48,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:48,061 INFO L87 Difference]: Start difference. First operand 266 states and 406 transitions. Second operand 4 states. [2019-12-07 14:54:48,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:48,343 INFO L93 Difference]: Finished difference Result 573 states and 876 transitions. [2019-12-07 14:54:48,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:48,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 14:54:48,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:48,345 INFO L225 Difference]: With dead ends: 573 [2019-12-07 14:54:48,345 INFO L226 Difference]: Without dead ends: 326 [2019-12-07 14:54:48,346 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-12-07 14:54:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-07 14:54:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 266. [2019-12-07 14:54:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 14:54:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 405 transitions. [2019-12-07 14:54:48,350 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 405 transitions. Word has length 100 [2019-12-07 14:54:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:48,350 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 405 transitions. [2019-12-07 14:54:48,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 405 transitions. [2019-12-07 14:54:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 14:54:48,351 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:48,351 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, 1] [2019-12-07 14:54:48,351 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:48,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:48,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1087640792, now seen corresponding path program 1 times [2019-12-07 14:54:48,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:48,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319429648] [2019-12-07 14:54:48,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:48,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319429648] [2019-12-07 14:54:48,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:48,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:48,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201129414] [2019-12-07 14:54:48,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:48,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:48,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:48,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:48,383 INFO L87 Difference]: Start difference. First operand 266 states and 405 transitions. Second operand 4 states. [2019-12-07 14:54:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:48,611 INFO L93 Difference]: Finished difference Result 535 states and 817 transitions. [2019-12-07 14:54:48,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:48,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 14:54:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:48,613 INFO L225 Difference]: With dead ends: 535 [2019-12-07 14:54:48,613 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 14:54:48,613 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-12-07 14:54:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 14:54:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-12-07 14:54:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 14:54:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 404 transitions. [2019-12-07 14:54:48,618 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 404 transitions. Word has length 100 [2019-12-07 14:54:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:48,618 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 404 transitions. [2019-12-07 14:54:48,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:48,618 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 404 transitions. [2019-12-07 14:54:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 14:54:48,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:48,619 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, 1] [2019-12-07 14:54:48,619 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:48,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:48,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1742266124, now seen corresponding path program 1 times [2019-12-07 14:54:48,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:48,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4158824] [2019-12-07 14:54:48,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:48,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4158824] [2019-12-07 14:54:48,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:48,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:48,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905796109] [2019-12-07 14:54:48,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:48,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:48,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:48,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:48,654 INFO L87 Difference]: Start difference. First operand 266 states and 404 transitions. Second operand 4 states. [2019-12-07 14:54:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:48,933 INFO L93 Difference]: Finished difference Result 573 states and 872 transitions. [2019-12-07 14:54:48,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:48,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 14:54:48,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:48,934 INFO L225 Difference]: With dead ends: 573 [2019-12-07 14:54:48,934 INFO L226 Difference]: Without dead ends: 326 [2019-12-07 14:54:48,934 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-12-07 14:54:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-07 14:54:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 266. [2019-12-07 14:54:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 14:54:48,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 403 transitions. [2019-12-07 14:54:48,939 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 403 transitions. Word has length 101 [2019-12-07 14:54:48,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:48,939 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 403 transitions. [2019-12-07 14:54:48,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 403 transitions. [2019-12-07 14:54:48,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 14:54:48,940 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:48,940 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, 1] [2019-12-07 14:54:48,940 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:48,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:48,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1540442190, now seen corresponding path program 1 times [2019-12-07 14:54:48,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:48,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220821396] [2019-12-07 14:54:48,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:48,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220821396] [2019-12-07 14:54:48,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:48,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:48,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360420740] [2019-12-07 14:54:48,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:48,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:48,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:48,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:48,974 INFO L87 Difference]: Start difference. First operand 266 states and 403 transitions. Second operand 4 states. [2019-12-07 14:54:49,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:49,203 INFO L93 Difference]: Finished difference Result 535 states and 813 transitions. [2019-12-07 14:54:49,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:49,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 14:54:49,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:49,205 INFO L225 Difference]: With dead ends: 535 [2019-12-07 14:54:49,205 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 14:54:49,205 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-12-07 14:54:49,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 14:54:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2019-12-07 14:54:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 14:54:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 402 transitions. [2019-12-07 14:54:49,210 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 402 transitions. Word has length 101 [2019-12-07 14:54:49,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:49,210 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 402 transitions. [2019-12-07 14:54:49,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:49,210 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 402 transitions. [2019-12-07 14:54:49,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 14:54:49,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:49,210 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, 1] [2019-12-07 14:54:49,211 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:49,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:49,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1561691647, now seen corresponding path program 1 times [2019-12-07 14:54:49,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:49,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438799391] [2019-12-07 14:54:49,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:49,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438799391] [2019-12-07 14:54:49,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:49,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:49,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499374180] [2019-12-07 14:54:49,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:49,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:49,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:49,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:49,245 INFO L87 Difference]: Start difference. First operand 266 states and 402 transitions. Second operand 4 states. [2019-12-07 14:54:49,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:49,561 INFO L93 Difference]: Finished difference Result 563 states and 856 transitions. [2019-12-07 14:54:49,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:49,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 14:54:49,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:49,563 INFO L225 Difference]: With dead ends: 563 [2019-12-07 14:54:49,563 INFO L226 Difference]: Without dead ends: 316 [2019-12-07 14:54:49,563 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-12-07 14:54:49,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-12-07 14:54:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 266. [2019-12-07 14:54:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 14:54:49,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 401 transitions. [2019-12-07 14:54:49,569 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 401 transitions. Word has length 102 [2019-12-07 14:54:49,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:49,569 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 401 transitions. [2019-12-07 14:54:49,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 401 transitions. [2019-12-07 14:54:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 14:54:49,570 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:49,570 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, 1] [2019-12-07 14:54:49,571 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:49,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:49,571 INFO L82 PathProgramCache]: Analyzing trace with hash 399883011, now seen corresponding path program 1 times [2019-12-07 14:54:49,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:49,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374484776] [2019-12-07 14:54:49,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:49,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374484776] [2019-12-07 14:54:49,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:49,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:49,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837426395] [2019-12-07 14:54:49,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:49,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:49,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:49,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:49,622 INFO L87 Difference]: Start difference. First operand 266 states and 401 transitions. Second operand 4 states. [2019-12-07 14:54:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:49,831 INFO L93 Difference]: Finished difference Result 525 states and 797 transitions. [2019-12-07 14:54:49,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:49,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 14:54:49,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:49,833 INFO L225 Difference]: With dead ends: 525 [2019-12-07 14:54:49,833 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 14:54:49,834 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-12-07 14:54:49,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 14:54:49,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 266. [2019-12-07 14:54:49,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 14:54:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 400 transitions. [2019-12-07 14:54:49,838 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 400 transitions. Word has length 102 [2019-12-07 14:54:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:49,838 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 400 transitions. [2019-12-07 14:54:49,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 400 transitions. [2019-12-07 14:54:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 14:54:49,838 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:49,839 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, 1] [2019-12-07 14:54:49,839 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:49,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:49,839 INFO L82 PathProgramCache]: Analyzing trace with hash 325122695, now seen corresponding path program 1 times [2019-12-07 14:54:49,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:49,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869493851] [2019-12-07 14:54:49,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:54:49,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869493851] [2019-12-07 14:54:49,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:49,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:49,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128155884] [2019-12-07 14:54:49,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:49,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:49,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:49,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:49,874 INFO L87 Difference]: Start difference. First operand 266 states and 400 transitions. Second operand 4 states. [2019-12-07 14:54:50,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:50,132 INFO L93 Difference]: Finished difference Result 563 states and 852 transitions. [2019-12-07 14:54:50,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:50,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-12-07 14:54:50,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:50,134 INFO L225 Difference]: With dead ends: 563 [2019-12-07 14:54:50,134 INFO L226 Difference]: Without dead ends: 316 [2019-12-07 14:54:50,134 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-12-07 14:54:50,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-12-07 14:54:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 266. [2019-12-07 14:54:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-07 14:54:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 399 transitions. [2019-12-07 14:54:50,139 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 399 transitions. Word has length 106 [2019-12-07 14:54:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:50,139 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 399 transitions. [2019-12-07 14:54:50,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 399 transitions. [2019-12-07 14:54:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 14:54:50,140 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:50,140 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, 1] [2019-12-07 14:54:50,140 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:50,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:50,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1361057143, now seen corresponding path program 1 times [2019-12-07 14:54:50,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:50,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266699576] [2019-12-07 14:54:50,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:50,174 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 14:54:50,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266699576] [2019-12-07 14:54:50,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:50,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:50,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940154625] [2019-12-07 14:54:50,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:50,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:50,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:50,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:50,175 INFO L87 Difference]: Start difference. First operand 266 states and 399 transitions. Second operand 3 states. [2019-12-07 14:54:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:50,240 INFO L93 Difference]: Finished difference Result 758 states and 1152 transitions. [2019-12-07 14:54:50,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:50,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-12-07 14:54:50,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:50,242 INFO L225 Difference]: With dead ends: 758 [2019-12-07 14:54:50,242 INFO L226 Difference]: Without dead ends: 511 [2019-12-07 14:54:50,243 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-12-07 14:54:50,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-12-07 14:54:50,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2019-12-07 14:54:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-12-07 14:54:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 756 transitions. [2019-12-07 14:54:50,251 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 756 transitions. Word has length 106 [2019-12-07 14:54:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:50,251 INFO L462 AbstractCegarLoop]: Abstraction has 511 states and 756 transitions. [2019-12-07 14:54:50,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 756 transitions. [2019-12-07 14:54:50,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-07 14:54:50,252 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:50,252 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, 1, 1, 1] [2019-12-07 14:54:50,252 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:50,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:50,252 INFO L82 PathProgramCache]: Analyzing trace with hash 506499155, now seen corresponding path program 1 times [2019-12-07 14:54:50,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:50,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950900691] [2019-12-07 14:54:50,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:54:50,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950900691] [2019-12-07 14:54:50,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:50,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:50,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826716169] [2019-12-07 14:54:50,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:50,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:50,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:50,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:50,284 INFO L87 Difference]: Start difference. First operand 511 states and 756 transitions. Second operand 3 states. [2019-12-07 14:54:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:50,343 INFO L93 Difference]: Finished difference Result 1248 states and 1866 transitions. [2019-12-07 14:54:50,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:50,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-12-07 14:54:50,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:50,346 INFO L225 Difference]: With dead ends: 1248 [2019-12-07 14:54:50,346 INFO L226 Difference]: Without dead ends: 756 [2019-12-07 14:54:50,347 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-12-07 14:54:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2019-12-07 14:54:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2019-12-07 14:54:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2019-12-07 14:54:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1114 transitions. [2019-12-07 14:54:50,357 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1114 transitions. Word has length 108 [2019-12-07 14:54:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:50,358 INFO L462 AbstractCegarLoop]: Abstraction has 756 states and 1114 transitions. [2019-12-07 14:54:50,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:50,358 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1114 transitions. [2019-12-07 14:54:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 14:54:50,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:50,359 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:50,359 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:50,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:50,359 INFO L82 PathProgramCache]: Analyzing trace with hash 151412293, now seen corresponding path program 1 times [2019-12-07 14:54:50,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:50,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052872759] [2019-12-07 14:54:50,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:54:50,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052872759] [2019-12-07 14:54:50,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:50,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:50,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507029738] [2019-12-07 14:54:50,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:50,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:50,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:50,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:50,419 INFO L87 Difference]: Start difference. First operand 756 states and 1114 transitions. Second operand 4 states. [2019-12-07 14:54:50,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:50,704 INFO L93 Difference]: Finished difference Result 1682 states and 2500 transitions. [2019-12-07 14:54:50,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:50,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-12-07 14:54:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:50,708 INFO L225 Difference]: With dead ends: 1682 [2019-12-07 14:54:50,708 INFO L226 Difference]: Without dead ends: 945 [2019-12-07 14:54:50,708 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-12-07 14:54:50,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-12-07 14:54:50,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 840. [2019-12-07 14:54:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-07 14:54:50,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1261 transitions. [2019-12-07 14:54:50,720 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1261 transitions. Word has length 137 [2019-12-07 14:54:50,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:50,721 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1261 transitions. [2019-12-07 14:54:50,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:50,721 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1261 transitions. [2019-12-07 14:54:50,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 14:54:50,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:50,722 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:50,722 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:50,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:50,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1915218566, now seen corresponding path program 1 times [2019-12-07 14:54:50,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:50,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785057451] [2019-12-07 14:54:50,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:50,765 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:54:50,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785057451] [2019-12-07 14:54:50,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:50,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:50,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13462704] [2019-12-07 14:54:50,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:50,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:50,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:50,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:50,766 INFO L87 Difference]: Start difference. First operand 840 states and 1261 transitions. Second operand 4 states. [2019-12-07 14:54:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:51,024 INFO L93 Difference]: Finished difference Result 1766 states and 2644 transitions. [2019-12-07 14:54:51,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:51,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 14:54:51,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:51,028 INFO L225 Difference]: With dead ends: 1766 [2019-12-07 14:54:51,028 INFO L226 Difference]: Without dead ends: 945 [2019-12-07 14:54:51,029 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-12-07 14:54:51,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-12-07 14:54:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 840. [2019-12-07 14:54:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-07 14:54:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1258 transitions. [2019-12-07 14:54:51,041 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1258 transitions. Word has length 150 [2019-12-07 14:54:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:51,041 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1258 transitions. [2019-12-07 14:54:51,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1258 transitions. [2019-12-07 14:54:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 14:54:51,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:51,043 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:51,043 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:51,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:51,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1812197491, now seen corresponding path program 1 times [2019-12-07 14:54:51,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:51,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233087011] [2019-12-07 14:54:51,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:54:51,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233087011] [2019-12-07 14:54:51,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:51,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:51,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867536638] [2019-12-07 14:54:51,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:51,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:51,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:51,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:51,098 INFO L87 Difference]: Start difference. First operand 840 states and 1258 transitions. Second operand 4 states. [2019-12-07 14:54:51,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:51,355 INFO L93 Difference]: Finished difference Result 1760 states and 2632 transitions. [2019-12-07 14:54:51,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:51,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 14:54:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:51,360 INFO L225 Difference]: With dead ends: 1760 [2019-12-07 14:54:51,360 INFO L226 Difference]: Without dead ends: 939 [2019-12-07 14:54:51,361 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-12-07 14:54:51,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-12-07 14:54:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 840. [2019-12-07 14:54:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-07 14:54:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1255 transitions. [2019-12-07 14:54:51,377 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1255 transitions. Word has length 151 [2019-12-07 14:54:51,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:51,377 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1255 transitions. [2019-12-07 14:54:51,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1255 transitions. [2019-12-07 14:54:51,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 14:54:51,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:51,379 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:51,380 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:51,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:51,380 INFO L82 PathProgramCache]: Analyzing trace with hash -862849331, now seen corresponding path program 1 times [2019-12-07 14:54:51,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:51,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174112545] [2019-12-07 14:54:51,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:54:51,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174112545] [2019-12-07 14:54:51,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:51,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:51,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583687307] [2019-12-07 14:54:51,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:51,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:51,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:51,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:51,431 INFO L87 Difference]: Start difference. First operand 840 states and 1255 transitions. Second operand 4 states. [2019-12-07 14:54:51,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:51,694 INFO L93 Difference]: Finished difference Result 1757 states and 2623 transitions. [2019-12-07 14:54:51,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:51,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 14:54:51,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:51,698 INFO L225 Difference]: With dead ends: 1757 [2019-12-07 14:54:51,698 INFO L226 Difference]: Without dead ends: 936 [2019-12-07 14:54:51,699 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-12-07 14:54:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-12-07 14:54:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 840. [2019-12-07 14:54:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-07 14:54:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1252 transitions. [2019-12-07 14:54:51,710 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1252 transitions. Word has length 151 [2019-12-07 14:54:51,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:51,710 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1252 transitions. [2019-12-07 14:54:51,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1252 transitions. [2019-12-07 14:54:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 14:54:51,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:51,711 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:51,712 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:51,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:51,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1466405302, now seen corresponding path program 1 times [2019-12-07 14:54:51,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:51,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408548129] [2019-12-07 14:54:51,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:54:51,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408548129] [2019-12-07 14:54:51,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:51,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:51,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916424661] [2019-12-07 14:54:51,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:51,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:51,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:51,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:51,757 INFO L87 Difference]: Start difference. First operand 840 states and 1252 transitions. Second operand 4 states. [2019-12-07 14:54:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:52,045 INFO L93 Difference]: Finished difference Result 1757 states and 2617 transitions. [2019-12-07 14:54:52,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:52,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 14:54:52,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:52,049 INFO L225 Difference]: With dead ends: 1757 [2019-12-07 14:54:52,049 INFO L226 Difference]: Without dead ends: 936 [2019-12-07 14:54:52,050 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-12-07 14:54:52,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-12-07 14:54:52,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 840. [2019-12-07 14:54:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-07 14:54:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1249 transitions. [2019-12-07 14:54:52,062 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1249 transitions. Word has length 152 [2019-12-07 14:54:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:52,062 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1249 transitions. [2019-12-07 14:54:52,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:52,063 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1249 transitions. [2019-12-07 14:54:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 14:54:52,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:52,064 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:52,064 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:52,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:52,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1528276041, now seen corresponding path program 1 times [2019-12-07 14:54:52,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:52,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993289316] [2019-12-07 14:54:52,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:54:52,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993289316] [2019-12-07 14:54:52,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:52,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:52,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383465797] [2019-12-07 14:54:52,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:52,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:52,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:52,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:52,113 INFO L87 Difference]: Start difference. First operand 840 states and 1249 transitions. Second operand 4 states. [2019-12-07 14:54:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:52,365 INFO L93 Difference]: Finished difference Result 1757 states and 2611 transitions. [2019-12-07 14:54:52,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:52,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-12-07 14:54:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:52,369 INFO L225 Difference]: With dead ends: 1757 [2019-12-07 14:54:52,369 INFO L226 Difference]: Without dead ends: 936 [2019-12-07 14:54:52,370 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-12-07 14:54:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-12-07 14:54:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 840. [2019-12-07 14:54:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-07 14:54:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1246 transitions. [2019-12-07 14:54:52,381 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1246 transitions. Word has length 153 [2019-12-07 14:54:52,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:52,382 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1246 transitions. [2019-12-07 14:54:52,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1246 transitions. [2019-12-07 14:54:52,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 14:54:52,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:52,383 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:52,383 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:52,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:52,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2051398991, now seen corresponding path program 1 times [2019-12-07 14:54:52,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:52,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620549042] [2019-12-07 14:54:52,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:54:52,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620549042] [2019-12-07 14:54:52,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:52,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:52,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202103987] [2019-12-07 14:54:52,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:52,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:52,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:52,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:52,425 INFO L87 Difference]: Start difference. First operand 840 states and 1246 transitions. Second operand 4 states. [2019-12-07 14:54:52,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:52,685 INFO L93 Difference]: Finished difference Result 1757 states and 2605 transitions. [2019-12-07 14:54:52,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:52,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-12-07 14:54:52,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:52,688 INFO L225 Difference]: With dead ends: 1757 [2019-12-07 14:54:52,688 INFO L226 Difference]: Without dead ends: 936 [2019-12-07 14:54:52,689 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-12-07 14:54:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-12-07 14:54:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 840. [2019-12-07 14:54:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-07 14:54:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1243 transitions. [2019-12-07 14:54:52,711 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1243 transitions. Word has length 154 [2019-12-07 14:54:52,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:52,711 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1243 transitions. [2019-12-07 14:54:52,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1243 transitions. [2019-12-07 14:54:52,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 14:54:52,712 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:52,712 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:52,712 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:52,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:52,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1740091364, now seen corresponding path program 1 times [2019-12-07 14:54:52,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:52,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889352729] [2019-12-07 14:54:52,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:54:52,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889352729] [2019-12-07 14:54:52,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:52,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:52,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451859580] [2019-12-07 14:54:52,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:52,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:52,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:52,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:52,761 INFO L87 Difference]: Start difference. First operand 840 states and 1243 transitions. Second operand 4 states. [2019-12-07 14:54:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:53,003 INFO L93 Difference]: Finished difference Result 1727 states and 2563 transitions. [2019-12-07 14:54:53,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:53,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-12-07 14:54:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:53,006 INFO L225 Difference]: With dead ends: 1727 [2019-12-07 14:54:53,007 INFO L226 Difference]: Without dead ends: 906 [2019-12-07 14:54:53,007 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-12-07 14:54:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-12-07 14:54:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 840. [2019-12-07 14:54:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-07 14:54:53,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1240 transitions. [2019-12-07 14:54:53,019 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1240 transitions. Word has length 155 [2019-12-07 14:54:53,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:53,019 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1240 transitions. [2019-12-07 14:54:53,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:53,019 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1240 transitions. [2019-12-07 14:54:53,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 14:54:53,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:53,021 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1] [2019-12-07 14:54:53,021 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:53,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:53,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1593145622, now seen corresponding path program 1 times [2019-12-07 14:54:53,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:53,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694421013] [2019-12-07 14:54:53,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:54:53,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694421013] [2019-12-07 14:54:53,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:53,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:53,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509919814] [2019-12-07 14:54:53,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:53,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:53,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:53,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:53,070 INFO L87 Difference]: Start difference. First operand 840 states and 1240 transitions. Second operand 4 states. [2019-12-07 14:54:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:53,309 INFO L93 Difference]: Finished difference Result 1727 states and 2557 transitions. [2019-12-07 14:54:53,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:53,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 14:54:53,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:53,313 INFO L225 Difference]: With dead ends: 1727 [2019-12-07 14:54:53,313 INFO L226 Difference]: Without dead ends: 906 [2019-12-07 14:54:53,313 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-12-07 14:54:53,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-12-07 14:54:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 840. [2019-12-07 14:54:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-07 14:54:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1237 transitions. [2019-12-07 14:54:53,325 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1237 transitions. Word has length 159 [2019-12-07 14:54:53,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:53,326 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1237 transitions. [2019-12-07 14:54:53,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1237 transitions. [2019-12-07 14:54:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 14:54:53,327 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:53,327 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1] [2019-12-07 14:54:53,327 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:53,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:53,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1443396425, now seen corresponding path program 1 times [2019-12-07 14:54:53,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:53,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289065584] [2019-12-07 14:54:53,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:54:53,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289065584] [2019-12-07 14:54:53,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:53,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:53,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49191230] [2019-12-07 14:54:53,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:53,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:53,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:53,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:53,372 INFO L87 Difference]: Start difference. First operand 840 states and 1237 transitions. Second operand 4 states. [2019-12-07 14:54:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:53,615 INFO L93 Difference]: Finished difference Result 1712 states and 2530 transitions. [2019-12-07 14:54:53,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:53,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-12-07 14:54:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:53,619 INFO L225 Difference]: With dead ends: 1712 [2019-12-07 14:54:53,619 INFO L226 Difference]: Without dead ends: 891 [2019-12-07 14:54:53,620 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-12-07 14:54:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-12-07 14:54:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 840. [2019-12-07 14:54:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-07 14:54:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1234 transitions. [2019-12-07 14:54:53,633 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1234 transitions. Word has length 160 [2019-12-07 14:54:53,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:53,633 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1234 transitions. [2019-12-07 14:54:53,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1234 transitions. [2019-12-07 14:54:53,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 14:54:53,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:53,635 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:53,635 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:53,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:53,635 INFO L82 PathProgramCache]: Analyzing trace with hash -536021289, now seen corresponding path program 1 times [2019-12-07 14:54:53,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:53,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292577031] [2019-12-07 14:54:53,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:54:53,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292577031] [2019-12-07 14:54:53,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:53,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:53,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080839351] [2019-12-07 14:54:53,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:53,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:53,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:53,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:53,691 INFO L87 Difference]: Start difference. First operand 840 states and 1234 transitions. Second operand 4 states. [2019-12-07 14:54:53,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:53,982 INFO L93 Difference]: Finished difference Result 1862 states and 2758 transitions. [2019-12-07 14:54:53,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:53,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-12-07 14:54:53,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:53,986 INFO L225 Difference]: With dead ends: 1862 [2019-12-07 14:54:53,987 INFO L226 Difference]: Without dead ends: 1041 [2019-12-07 14:54:53,987 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-12-07 14:54:53,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-12-07 14:54:53,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 930. [2019-12-07 14:54:53,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-12-07 14:54:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1393 transitions. [2019-12-07 14:54:54,000 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1393 transitions. Word has length 162 [2019-12-07 14:54:54,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:54,000 INFO L462 AbstractCegarLoop]: Abstraction has 930 states and 1393 transitions. [2019-12-07 14:54:54,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1393 transitions. [2019-12-07 14:54:54,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-07 14:54:54,001 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:54,001 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:54,002 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:54,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:54,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2052018546, now seen corresponding path program 1 times [2019-12-07 14:54:54,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:54,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427381601] [2019-12-07 14:54:54,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:54:54,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427381601] [2019-12-07 14:54:54,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:54,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:54,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790800817] [2019-12-07 14:54:54,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:54,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:54,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:54,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:54,047 INFO L87 Difference]: Start difference. First operand 930 states and 1393 transitions. Second operand 3 states. [2019-12-07 14:54:54,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:54,118 INFO L93 Difference]: Finished difference Result 2144 states and 3233 transitions. [2019-12-07 14:54:54,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:54,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-12-07 14:54:54,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:54,122 INFO L225 Difference]: With dead ends: 2144 [2019-12-07 14:54:54,123 INFO L226 Difference]: Without dead ends: 1233 [2019-12-07 14:54:54,123 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-12-07 14:54:54,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2019-12-07 14:54:54,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1233. [2019-12-07 14:54:54,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-12-07 14:54:54,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1846 transitions. [2019-12-07 14:54:54,140 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1846 transitions. Word has length 168 [2019-12-07 14:54:54,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:54,140 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 1846 transitions. [2019-12-07 14:54:54,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1846 transitions. [2019-12-07 14:54:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-07 14:54:54,142 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:54,142 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:54:54,142 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:54,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:54,142 INFO L82 PathProgramCache]: Analyzing trace with hash 595109725, now seen corresponding path program 1 times [2019-12-07 14:54:54,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:54,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370342999] [2019-12-07 14:54:54,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-12-07 14:54:54,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370342999] [2019-12-07 14:54:54,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:54,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:54,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249794268] [2019-12-07 14:54:54,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:54,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:54,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:54,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:54,197 INFO L87 Difference]: Start difference. First operand 1233 states and 1846 transitions. Second operand 4 states. [2019-12-07 14:54:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:54,429 INFO L93 Difference]: Finished difference Result 2515 states and 3774 transitions. [2019-12-07 14:54:54,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:54,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-12-07 14:54:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:54,433 INFO L225 Difference]: With dead ends: 2515 [2019-12-07 14:54:54,434 INFO L226 Difference]: Without dead ends: 1301 [2019-12-07 14:54:54,434 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-12-07 14:54:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2019-12-07 14:54:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1233. [2019-12-07 14:54:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-12-07 14:54:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1842 transitions. [2019-12-07 14:54:54,451 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1842 transitions. Word has length 191 [2019-12-07 14:54:54,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:54,451 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 1842 transitions. [2019-12-07 14:54:54,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1842 transitions. [2019-12-07 14:54:54,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-07 14:54:54,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:54,453 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1] [2019-12-07 14:54:54,453 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:54,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:54,453 INFO L82 PathProgramCache]: Analyzing trace with hash -169598838, now seen corresponding path program 1 times [2019-12-07 14:54:54,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:54,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541993647] [2019-12-07 14:54:54,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-12-07 14:54:54,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541993647] [2019-12-07 14:54:54,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:54,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:54:54,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715192222] [2019-12-07 14:54:54,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:54:54,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:54,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:54:54,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:54:54,513 INFO L87 Difference]: Start difference. First operand 1233 states and 1842 transitions. Second operand 4 states. [2019-12-07 14:54:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:54,744 INFO L93 Difference]: Finished difference Result 2499 states and 3742 transitions. [2019-12-07 14:54:54,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:54:54,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-12-07 14:54:54,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:54,749 INFO L225 Difference]: With dead ends: 2499 [2019-12-07 14:54:54,749 INFO L226 Difference]: Without dead ends: 1285 [2019-12-07 14:54:54,750 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-12-07 14:54:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2019-12-07 14:54:54,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1233. [2019-12-07 14:54:54,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-12-07 14:54:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1838 transitions. [2019-12-07 14:54:54,768 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1838 transitions. Word has length 192 [2019-12-07 14:54:54,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:54,768 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 1838 transitions. [2019-12-07 14:54:54,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:54:54,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1838 transitions. [2019-12-07 14:54:54,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-12-07 14:54:54,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:54,769 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:54,770 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:54,770 INFO L82 PathProgramCache]: Analyzing trace with hash -811867631, now seen corresponding path program 1 times [2019-12-07 14:54:54,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:54,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679456563] [2019-12-07 14:54:54,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 14:54:54,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679456563] [2019-12-07 14:54:54,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:54,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:54,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365357520] [2019-12-07 14:54:54,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:54,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:54,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:54,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:54,835 INFO L87 Difference]: Start difference. First operand 1233 states and 1838 transitions. Second operand 3 states. [2019-12-07 14:54:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:54,902 INFO L93 Difference]: Finished difference Result 2750 states and 4121 transitions. [2019-12-07 14:54:54,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:54,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-12-07 14:54:54,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:54,908 INFO L225 Difference]: With dead ends: 2750 [2019-12-07 14:54:54,908 INFO L226 Difference]: Without dead ends: 1536 [2019-12-07 14:54:54,909 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-12-07 14:54:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2019-12-07 14:54:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1536. [2019-12-07 14:54:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1536 states. [2019-12-07 14:54:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 2290 transitions. [2019-12-07 14:54:54,930 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 2290 transitions. Word has length 200 [2019-12-07 14:54:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:54,931 INFO L462 AbstractCegarLoop]: Abstraction has 1536 states and 2290 transitions. [2019-12-07 14:54:54,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2290 transitions. [2019-12-07 14:54:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-12-07 14:54:54,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:54,932 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:54,933 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:54,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:54,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1012697785, now seen corresponding path program 1 times [2019-12-07 14:54:54,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:54,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182833472] [2019-12-07 14:54:54,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 14:54:54,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182833472] [2019-12-07 14:54:54,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:54,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:54,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715503355] [2019-12-07 14:54:54,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:54,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:54,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:54,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:54,994 INFO L87 Difference]: Start difference. First operand 1536 states and 2290 transitions. Second operand 3 states. [2019-12-07 14:54:55,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:55,065 INFO L93 Difference]: Finished difference Result 3356 states and 5025 transitions. [2019-12-07 14:54:55,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:55,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-12-07 14:54:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:55,068 INFO L225 Difference]: With dead ends: 3356 [2019-12-07 14:54:55,068 INFO L226 Difference]: Without dead ends: 1839 [2019-12-07 14:54:55,069 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-12-07 14:54:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-12-07 14:54:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1839. [2019-12-07 14:54:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1839 states. [2019-12-07 14:54:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2743 transitions. [2019-12-07 14:54:55,097 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2743 transitions. Word has length 202 [2019-12-07 14:54:55,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:55,097 INFO L462 AbstractCegarLoop]: Abstraction has 1839 states and 2743 transitions. [2019-12-07 14:54:55,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2743 transitions. [2019-12-07 14:54:55,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-12-07 14:54:55,100 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:55,100 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:55,100 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:55,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:55,101 INFO L82 PathProgramCache]: Analyzing trace with hash 648546372, now seen corresponding path program 1 times [2019-12-07 14:54:55,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:55,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568162042] [2019-12-07 14:54:55,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-12-07 14:54:55,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568162042] [2019-12-07 14:54:55,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:55,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:55,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945339453] [2019-12-07 14:54:55,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:55,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:55,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:55,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:55,176 INFO L87 Difference]: Start difference. First operand 1839 states and 2743 transitions. Second operand 3 states. [2019-12-07 14:54:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:55,245 INFO L93 Difference]: Finished difference Result 3962 states and 5931 transitions. [2019-12-07 14:54:55,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:55,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-12-07 14:54:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:55,247 INFO L225 Difference]: With dead ends: 3962 [2019-12-07 14:54:55,247 INFO L226 Difference]: Without dead ends: 2142 [2019-12-07 14:54:55,249 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-12-07 14:54:55,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-12-07 14:54:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2142. [2019-12-07 14:54:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2019-12-07 14:54:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3197 transitions. [2019-12-07 14:54:55,278 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3197 transitions. Word has length 235 [2019-12-07 14:54:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:55,278 INFO L462 AbstractCegarLoop]: Abstraction has 2142 states and 3197 transitions. [2019-12-07 14:54:55,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3197 transitions. [2019-12-07 14:54:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-12-07 14:54:55,281 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:55,281 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:55,281 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:55,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:55,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2113453151, now seen corresponding path program 1 times [2019-12-07 14:54:55,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:55,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583743666] [2019-12-07 14:54:55,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-12-07 14:54:55,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583743666] [2019-12-07 14:54:55,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:55,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:55,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114471825] [2019-12-07 14:54:55,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:55,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:55,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:55,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:55,357 INFO L87 Difference]: Start difference. First operand 2142 states and 3197 transitions. Second operand 3 states. [2019-12-07 14:54:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:55,438 INFO L93 Difference]: Finished difference Result 4560 states and 6826 transitions. [2019-12-07 14:54:55,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:55,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-12-07 14:54:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:55,441 INFO L225 Difference]: With dead ends: 4560 [2019-12-07 14:54:55,441 INFO L226 Difference]: Without dead ends: 2437 [2019-12-07 14:54:55,443 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-12-07 14:54:55,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2019-12-07 14:54:55,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2437. [2019-12-07 14:54:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2437 states. [2019-12-07 14:54:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 3633 transitions. [2019-12-07 14:54:55,475 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 3633 transitions. Word has length 270 [2019-12-07 14:54:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:55,476 INFO L462 AbstractCegarLoop]: Abstraction has 2437 states and 3633 transitions. [2019-12-07 14:54:55,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 3633 transitions. [2019-12-07 14:54:55,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-12-07 14:54:55,479 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:55,479 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 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-12-07 14:54:55,479 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:55,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:55,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1676068964, now seen corresponding path program 1 times [2019-12-07 14:54:55,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:55,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567105059] [2019-12-07 14:54:55,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:55,576 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-12-07 14:54:55,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567105059] [2019-12-07 14:54:55,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:55,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:55,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566358155] [2019-12-07 14:54:55,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:55,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:55,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:55,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:55,577 INFO L87 Difference]: Start difference. First operand 2437 states and 3633 transitions. Second operand 3 states. [2019-12-07 14:54:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:55,655 INFO L93 Difference]: Finished difference Result 5158 states and 7711 transitions. [2019-12-07 14:54:55,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:55,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 309 [2019-12-07 14:54:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:55,660 INFO L225 Difference]: With dead ends: 5158 [2019-12-07 14:54:55,660 INFO L226 Difference]: Without dead ends: 2740 [2019-12-07 14:54:55,662 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-12-07 14:54:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2019-12-07 14:54:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 2740. [2019-12-07 14:54:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2740 states. [2019-12-07 14:54:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 4089 transitions. [2019-12-07 14:54:55,711 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 4089 transitions. Word has length 309 [2019-12-07 14:54:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:55,711 INFO L462 AbstractCegarLoop]: Abstraction has 2740 states and 4089 transitions. [2019-12-07 14:54:55,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 4089 transitions. [2019-12-07 14:54:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-12-07 14:54:55,714 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:55,715 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 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-12-07 14:54:55,715 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:55,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:55,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1032303954, now seen corresponding path program 1 times [2019-12-07 14:54:55,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:55,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285661167] [2019-12-07 14:54:55,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-12-07 14:54:55,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285661167] [2019-12-07 14:54:55,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:55,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:55,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314502086] [2019-12-07 14:54:55,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:55,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:55,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:55,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:55,826 INFO L87 Difference]: Start difference. First operand 2740 states and 4089 transitions. Second operand 3 states. [2019-12-07 14:54:55,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:55,912 INFO L93 Difference]: Finished difference Result 5764 states and 8623 transitions. [2019-12-07 14:54:55,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:55,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2019-12-07 14:54:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:55,915 INFO L225 Difference]: With dead ends: 5764 [2019-12-07 14:54:55,915 INFO L226 Difference]: Without dead ends: 3043 [2019-12-07 14:54:55,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-12-07 14:54:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2019-12-07 14:54:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 3043. [2019-12-07 14:54:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2019-12-07 14:54:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4546 transitions. [2019-12-07 14:54:55,957 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4546 transitions. Word has length 350 [2019-12-07 14:54:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:55,957 INFO L462 AbstractCegarLoop]: Abstraction has 3043 states and 4546 transitions. [2019-12-07 14:54:55,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4546 transitions. [2019-12-07 14:54:55,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-12-07 14:54:55,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:55,961 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:54:55,961 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:55,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:55,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1120451630, now seen corresponding path program 1 times [2019-12-07 14:54:55,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:55,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497603507] [2019-12-07 14:54:55,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-12-07 14:54:56,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497603507] [2019-12-07 14:54:56,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:56,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:56,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607930967] [2019-12-07 14:54:56,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:56,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:56,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:56,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:56,090 INFO L87 Difference]: Start difference. First operand 3043 states and 4546 transitions. Second operand 3 states. [2019-12-07 14:54:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:56,187 INFO L93 Difference]: Finished difference Result 6363 states and 9526 transitions. [2019-12-07 14:54:56,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:56,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-12-07 14:54:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:56,191 INFO L225 Difference]: With dead ends: 6363 [2019-12-07 14:54:56,191 INFO L226 Difference]: Without dead ends: 3339 [2019-12-07 14:54:56,193 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-12-07 14:54:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2019-12-07 14:54:56,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3339. [2019-12-07 14:54:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3339 states. [2019-12-07 14:54:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3339 states to 3339 states and 4983 transitions. [2019-12-07 14:54:56,244 INFO L78 Accepts]: Start accepts. Automaton has 3339 states and 4983 transitions. Word has length 393 [2019-12-07 14:54:56,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:56,244 INFO L462 AbstractCegarLoop]: Abstraction has 3339 states and 4983 transitions. [2019-12-07 14:54:56,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4983 transitions. [2019-12-07 14:54:56,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-12-07 14:54:56,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:56,250 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:54:56,250 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:56,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:56,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1115815448, now seen corresponding path program 1 times [2019-12-07 14:54:56,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:56,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11203248] [2019-12-07 14:54:56,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2019-12-07 14:54:56,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11203248] [2019-12-07 14:54:56,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:56,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:56,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446896225] [2019-12-07 14:54:56,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:56,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:56,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:56,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:56,433 INFO L87 Difference]: Start difference. First operand 3339 states and 4983 transitions. Second operand 3 states. [2019-12-07 14:54:56,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:56,523 INFO L93 Difference]: Finished difference Result 6962 states and 10411 transitions. [2019-12-07 14:54:56,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:56,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 433 [2019-12-07 14:54:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:56,526 INFO L225 Difference]: With dead ends: 6962 [2019-12-07 14:54:56,526 INFO L226 Difference]: Without dead ends: 3642 [2019-12-07 14:54:56,528 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-12-07 14:54:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3642 states. [2019-12-07 14:54:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3642 to 3642. [2019-12-07 14:54:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3642 states. [2019-12-07 14:54:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 5442 transitions. [2019-12-07 14:54:56,578 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 5442 transitions. Word has length 433 [2019-12-07 14:54:56,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:56,578 INFO L462 AbstractCegarLoop]: Abstraction has 3642 states and 5442 transitions. [2019-12-07 14:54:56,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 5442 transitions. [2019-12-07 14:54:56,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-12-07 14:54:56,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:56,583 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 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, 1, 1, 1, 1, 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-12-07 14:54:56,583 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:56,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:56,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1862736238, now seen corresponding path program 1 times [2019-12-07 14:54:56,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:56,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088878568] [2019-12-07 14:54:56,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2130 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 1772 trivial. 0 not checked. [2019-12-07 14:54:56,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088878568] [2019-12-07 14:54:56,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:56,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:56,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581880803] [2019-12-07 14:54:56,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:56,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:56,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:56,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:56,769 INFO L87 Difference]: Start difference. First operand 3642 states and 5442 transitions. Second operand 3 states. [2019-12-07 14:54:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:56,860 INFO L93 Difference]: Finished difference Result 7568 states and 11329 transitions. [2019-12-07 14:54:56,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:56,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 475 [2019-12-07 14:54:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:56,863 INFO L225 Difference]: With dead ends: 7568 [2019-12-07 14:54:56,863 INFO L226 Difference]: Without dead ends: 3945 [2019-12-07 14:54:56,866 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-12-07 14:54:56,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2019-12-07 14:54:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3945. [2019-12-07 14:54:56,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3945 states. [2019-12-07 14:54:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3945 states to 3945 states and 5902 transitions. [2019-12-07 14:54:56,917 INFO L78 Accepts]: Start accepts. Automaton has 3945 states and 5902 transitions. Word has length 475 [2019-12-07 14:54:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:56,917 INFO L462 AbstractCegarLoop]: Abstraction has 3945 states and 5902 transitions. [2019-12-07 14:54:56,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:56,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3945 states and 5902 transitions. [2019-12-07 14:54:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2019-12-07 14:54:56,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:56,922 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:54:56,923 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:56,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:56,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1206695999, now seen corresponding path program 1 times [2019-12-07 14:54:56,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:56,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895935889] [2019-12-07 14:54:56,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 2135 trivial. 0 not checked. [2019-12-07 14:54:57,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895935889] [2019-12-07 14:54:57,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:57,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:57,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223990422] [2019-12-07 14:54:57,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:57,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:57,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:57,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:57,122 INFO L87 Difference]: Start difference. First operand 3945 states and 5902 transitions. Second operand 3 states. [2019-12-07 14:54:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:57,224 INFO L93 Difference]: Finished difference Result 8168 states and 12240 transitions. [2019-12-07 14:54:57,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:57,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 519 [2019-12-07 14:54:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:57,227 INFO L225 Difference]: With dead ends: 8168 [2019-12-07 14:54:57,227 INFO L226 Difference]: Without dead ends: 4242 [2019-12-07 14:54:57,230 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-12-07 14:54:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4242 states. [2019-12-07 14:54:57,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4242 to 4242. [2019-12-07 14:54:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4242 states. [2019-12-07 14:54:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4242 states to 4242 states and 6340 transitions. [2019-12-07 14:54:57,285 INFO L78 Accepts]: Start accepts. Automaton has 4242 states and 6340 transitions. Word has length 519 [2019-12-07 14:54:57,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:57,285 INFO L462 AbstractCegarLoop]: Abstraction has 4242 states and 6340 transitions. [2019-12-07 14:54:57,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 4242 states and 6340 transitions. [2019-12-07 14:54:57,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2019-12-07 14:54:57,292 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:57,293 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:54:57,293 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:57,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:57,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1759013079, now seen corresponding path program 1 times [2019-12-07 14:54:57,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:57,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900579518] [2019-12-07 14:54:57,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2962 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 2528 trivial. 0 not checked. [2019-12-07 14:54:57,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900579518] [2019-12-07 14:54:57,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:57,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:57,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347049999] [2019-12-07 14:54:57,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:57,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:57,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:57,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:57,572 INFO L87 Difference]: Start difference. First operand 4242 states and 6340 transitions. Second operand 3 states. [2019-12-07 14:54:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:57,671 INFO L93 Difference]: Finished difference Result 8768 states and 13125 transitions. [2019-12-07 14:54:57,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:57,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 560 [2019-12-07 14:54:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:57,674 INFO L225 Difference]: With dead ends: 8768 [2019-12-07 14:54:57,674 INFO L226 Difference]: Without dead ends: 4545 [2019-12-07 14:54:57,676 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-12-07 14:54:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2019-12-07 14:54:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 4545. [2019-12-07 14:54:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4545 states. [2019-12-07 14:54:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4545 states to 4545 states and 6802 transitions. [2019-12-07 14:54:57,735 INFO L78 Accepts]: Start accepts. Automaton has 4545 states and 6802 transitions. Word has length 560 [2019-12-07 14:54:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:57,735 INFO L462 AbstractCegarLoop]: Abstraction has 4545 states and 6802 transitions. [2019-12-07 14:54:57,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 4545 states and 6802 transitions. [2019-12-07 14:54:57,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-12-07 14:54:57,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:57,742 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:54:57,742 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:57,742 INFO L82 PathProgramCache]: Analyzing trace with hash 904347464, now seen corresponding path program 1 times [2019-12-07 14:54:57,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:57,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241118794] [2019-12-07 14:54:57,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 2968 trivial. 0 not checked. [2019-12-07 14:54:58,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241118794] [2019-12-07 14:54:58,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:58,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:58,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352916923] [2019-12-07 14:54:58,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:58,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:58,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:58,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:58,006 INFO L87 Difference]: Start difference. First operand 4545 states and 6802 transitions. Second operand 3 states. [2019-12-07 14:54:58,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:58,129 INFO L93 Difference]: Finished difference Result 9374 states and 14049 transitions. [2019-12-07 14:54:58,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:58,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 603 [2019-12-07 14:54:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:58,132 INFO L225 Difference]: With dead ends: 9374 [2019-12-07 14:54:58,132 INFO L226 Difference]: Without dead ends: 4848 [2019-12-07 14:54:58,135 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-12-07 14:54:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4848 states. [2019-12-07 14:54:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4848 to 4848. [2019-12-07 14:54:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4848 states. [2019-12-07 14:54:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4848 states to 4848 states and 7265 transitions. [2019-12-07 14:54:58,199 INFO L78 Accepts]: Start accepts. Automaton has 4848 states and 7265 transitions. Word has length 603 [2019-12-07 14:54:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:58,199 INFO L462 AbstractCegarLoop]: Abstraction has 4848 states and 7265 transitions. [2019-12-07 14:54:58,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 4848 states and 7265 transitions. [2019-12-07 14:54:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2019-12-07 14:54:58,206 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:58,206 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:54:58,206 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:58,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:58,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1356957761, now seen corresponding path program 1 times [2019-12-07 14:54:58,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:58,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164985251] [2019-12-07 14:54:58,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-12-07 14:54:58,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164985251] [2019-12-07 14:54:58,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:58,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:58,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553062195] [2019-12-07 14:54:58,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:58,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:58,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:58,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:58,511 INFO L87 Difference]: Start difference. First operand 4848 states and 7265 transitions. Second operand 3 states. [2019-12-07 14:54:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:58,654 INFO L93 Difference]: Finished difference Result 9975 states and 14968 transitions. [2019-12-07 14:54:58,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:58,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 648 [2019-12-07 14:54:58,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:58,657 INFO L225 Difference]: With dead ends: 9975 [2019-12-07 14:54:58,657 INFO L226 Difference]: Without dead ends: 5146 [2019-12-07 14:54:58,660 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-12-07 14:54:58,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5146 states. [2019-12-07 14:54:58,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5146 to 5146. [2019-12-07 14:54:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5146 states. [2019-12-07 14:54:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5146 states to 5146 states and 7704 transitions. [2019-12-07 14:54:58,725 INFO L78 Accepts]: Start accepts. Automaton has 5146 states and 7704 transitions. Word has length 648 [2019-12-07 14:54:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:58,725 INFO L462 AbstractCegarLoop]: Abstraction has 5146 states and 7704 transitions. [2019-12-07 14:54:58,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 5146 states and 7704 transitions. [2019-12-07 14:54:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2019-12-07 14:54:58,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:58,732 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 6, 6, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:54:58,732 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:58,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:58,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1026783708, now seen corresponding path program 1 times [2019-12-07 14:54:58,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:58,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972436716] [2019-12-07 14:54:58,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4490 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 3946 trivial. 0 not checked. [2019-12-07 14:54:59,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972436716] [2019-12-07 14:54:59,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:59,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:59,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115120347] [2019-12-07 14:54:59,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:59,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:59,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:59,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:59,050 INFO L87 Difference]: Start difference. First operand 5146 states and 7704 transitions. Second operand 3 states. [2019-12-07 14:54:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:59,159 INFO L93 Difference]: Finished difference Result 10576 states and 15853 transitions. [2019-12-07 14:54:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:59,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 690 [2019-12-07 14:54:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:59,162 INFO L225 Difference]: With dead ends: 10576 [2019-12-07 14:54:59,162 INFO L226 Difference]: Without dead ends: 5449 [2019-12-07 14:54:59,165 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-12-07 14:54:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2019-12-07 14:54:59,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2019-12-07 14:54:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5449 states. [2019-12-07 14:54:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8169 transitions. [2019-12-07 14:54:59,236 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8169 transitions. Word has length 690 [2019-12-07 14:54:59,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:59,236 INFO L462 AbstractCegarLoop]: Abstraction has 5449 states and 8169 transitions. [2019-12-07 14:54:59,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:59,236 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8169 transitions. [2019-12-07 14:54:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2019-12-07 14:54:59,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:59,242 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 18, 18, 17, 17, 16, 16, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 7, 7, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:59,242 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:59,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:59,243 INFO L82 PathProgramCache]: Analyzing trace with hash -146753123, now seen corresponding path program 1 times [2019-12-07 14:54:59,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:59,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091282259] [2019-12-07 14:54:59,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:54:59,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 4500 trivial. 0 not checked. [2019-12-07 14:54:59,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091282259] [2019-12-07 14:54:59,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:54:59,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:54:59,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89104659] [2019-12-07 14:54:59,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:54:59,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:54:59,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:54:59,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:54:59,599 INFO L87 Difference]: Start difference. First operand 5449 states and 8169 transitions. Second operand 3 states. [2019-12-07 14:54:59,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:54:59,702 INFO L93 Difference]: Finished difference Result 5754 states and 8637 transitions. [2019-12-07 14:54:59,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:54:59,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 734 [2019-12-07 14:54:59,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:54:59,706 INFO L225 Difference]: With dead ends: 5754 [2019-12-07 14:54:59,706 INFO L226 Difference]: Without dead ends: 5752 [2019-12-07 14:54:59,707 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-12-07 14:54:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5752 states. [2019-12-07 14:54:59,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5752 to 5752. [2019-12-07 14:54:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5752 states. [2019-12-07 14:54:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5752 states to 5752 states and 8635 transitions. [2019-12-07 14:54:59,782 INFO L78 Accepts]: Start accepts. Automaton has 5752 states and 8635 transitions. Word has length 734 [2019-12-07 14:54:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:54:59,782 INFO L462 AbstractCegarLoop]: Abstraction has 5752 states and 8635 transitions. [2019-12-07 14:54:59,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:54:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 5752 states and 8635 transitions. [2019-12-07 14:54:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2019-12-07 14:54:59,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:54:59,788 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:54:59,788 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:54:59,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:54:59,789 INFO L82 PathProgramCache]: Analyzing trace with hash -727278029, now seen corresponding path program 1 times [2019-12-07 14:54:59,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:54:59,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040472347] [2019-12-07 14:54:59,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:54:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:00,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5702 backedges. 2297 proven. 243 refuted. 0 times theorem prover too weak. 3162 trivial. 0 not checked. [2019-12-07 14:55:00,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040472347] [2019-12-07 14:55:00,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686337552] [2019-12-07 14:55:00,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/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-12-07 14:55:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:00,868 INFO L264 TraceCheckSpWp]: Trace formula consists of 2475 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-07 14:55:00,894 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:55:00,964 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:00,964 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-12-07 14:55:00,965 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:00,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,000 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_164|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-12-07 14:55:01,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,032 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-12-07 14:55:01,032 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,056 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,068 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-12-07 14:55:01,068 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,080 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,101 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:55:01,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:55:01,102 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,112 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,112 INFO L534 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-12-07 14:55:01,113 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 14:55:01,149 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:55:01,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:55:01,150 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,155 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,156 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:55:01,184 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:55:01,184 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:55:01,185 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,190 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,190 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,190 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:55:01,193 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_167|]} [2019-12-07 14:55:01,196 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:55:01,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,241 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 14:55:01,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 14:55:01,242 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,248 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,249 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,249 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 14:55:01,276 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:55:01,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:55:01,277 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,284 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,284 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,284 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:55:01,307 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:55:01,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:55:01,308 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,313 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,313 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,313 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:55:01,318 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_170|]} [2019-12-07 14:55:01,319 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:55:01,329 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,368 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 14:55:01,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 14:55:01,369 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,376 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,376 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,377 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 14:55:01,383 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-12-07 14:55:01,385 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 49 treesize of output 37 [2019-12-07 14:55:01,385 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:55:01,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,463 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 14:55:01,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 14:55:01,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:55:01,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:55:01,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:55:01,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:55:01,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,484 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-12-07 14:55:01,572 INFO L614 ElimStorePlain]: treesize reduction 1116, result has 4.5 percent of original size [2019-12-07 14:55:01,572 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,572 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 14:55:01,575 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-12-07 14:55:01,577 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:55:01,589 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,624 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 14:55:01,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 14:55:01,625 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,631 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,632 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,632 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 14:55:01,636 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-12-07 14:55:01,639 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 49 treesize of output 37 [2019-12-07 14:55:01,639 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:55:01,648 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,716 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 14:55:01,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 14:55:01,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:01,719 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,742 INFO L614 ElimStorePlain]: treesize reduction 157, result has 25.2 percent of original size [2019-12-07 14:55:01,743 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,743 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 14:55:01,745 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_158|, |v_#memory_int_178|], 2=[|v_#memory_$Pointer$.base_163|], 12=[|v_#memory_$Pointer$.base_174|]} [2019-12-07 14:55:01,748 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 109 treesize of output 97 [2019-12-07 14:55:01,748 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:55:01,769 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 34 [2019-12-07 14:55:01,774 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,788 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,790 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:55:01,800 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,802 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 73 treesize of output 59 [2019-12-07 14:55:01,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:01,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 26 [2019-12-07 14:55:01,812 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:55:01,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,815 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:55:01,820 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,820 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:55:01,820 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:181, output treesize:32 [2019-12-07 14:55:01,862 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:55:01,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-12-07 14:55:01,863 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,867 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:01,867 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:55:01,868 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-12-07 14:55:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 5702 backedges. 1785 proven. 91 refuted. 0 times theorem prover too weak. 3826 trivial. 0 not checked. [2019-12-07 14:55:02,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:55:02,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-12-07 14:55:02,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349133814] [2019-12-07 14:55:02,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:55:02,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:02,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:55:02,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:55:02,783 INFO L87 Difference]: Start difference. First operand 5752 states and 8635 transitions. Second operand 12 states. [2019-12-07 14:55:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:09,148 INFO L93 Difference]: Finished difference Result 45493 states and 68567 transitions. [2019-12-07 14:55:09,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 14:55:09,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 780 [2019-12-07 14:55:09,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:09,192 INFO L225 Difference]: With dead ends: 45493 [2019-12-07 14:55:09,192 INFO L226 Difference]: Without dead ends: 39760 [2019-12-07 14:55:09,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 786 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=1190, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 14:55:09,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39760 states. [2019-12-07 14:55:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39760 to 25803. [2019-12-07 14:55:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25803 states. [2019-12-07 14:55:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25803 states to 25803 states and 40467 transitions. [2019-12-07 14:55:09,734 INFO L78 Accepts]: Start accepts. Automaton has 25803 states and 40467 transitions. Word has length 780 [2019-12-07 14:55:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:09,735 INFO L462 AbstractCegarLoop]: Abstraction has 25803 states and 40467 transitions. [2019-12-07 14:55:09,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:55:09,735 INFO L276 IsEmpty]: Start isEmpty. Operand 25803 states and 40467 transitions. [2019-12-07 14:55:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 782 [2019-12-07 14:55:09,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:09,779 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 16, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:09,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:55:09,980 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:09,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:09,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1978544095, now seen corresponding path program 1 times [2019-12-07 14:55:09,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:09,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49179639] [2019-12-07 14:55:09,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5717 backedges. 3232 proven. 0 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-12-07 14:55:10,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49179639] [2019-12-07 14:55:10,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:10,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:10,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830399941] [2019-12-07 14:55:10,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:10,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:10,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:10,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:10,446 INFO L87 Difference]: Start difference. First operand 25803 states and 40467 transitions. Second operand 4 states. [2019-12-07 14:55:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:11,352 INFO L93 Difference]: Finished difference Result 59364 states and 92872 transitions. [2019-12-07 14:55:11,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:11,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 781 [2019-12-07 14:55:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:11,384 INFO L225 Difference]: With dead ends: 59364 [2019-12-07 14:55:11,384 INFO L226 Difference]: Without dead ends: 33580 [2019-12-07 14:55:11,397 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-12-07 14:55:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33580 states. [2019-12-07 14:55:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33580 to 28919. [2019-12-07 14:55:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28919 states. [2019-12-07 14:55:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28919 states to 28919 states and 46167 transitions. [2019-12-07 14:55:11,920 INFO L78 Accepts]: Start accepts. Automaton has 28919 states and 46167 transitions. Word has length 781 [2019-12-07 14:55:11,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:11,921 INFO L462 AbstractCegarLoop]: Abstraction has 28919 states and 46167 transitions. [2019-12-07 14:55:11,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 28919 states and 46167 transitions. [2019-12-07 14:55:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2019-12-07 14:55:11,947 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:11,947 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 16, 15, 14, 14, 13, 13, 8, 8, 7, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:11,947 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:11,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:11,947 INFO L82 PathProgramCache]: Analyzing trace with hash -195751553, now seen corresponding path program 1 times [2019-12-07 14:55:11,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:11,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920532746] [2019-12-07 14:55:11,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5732 backedges. 3240 proven. 0 refuted. 0 times theorem prover too weak. 2492 trivial. 0 not checked. [2019-12-07 14:55:12,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920532746] [2019-12-07 14:55:12,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:12,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:12,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982726614] [2019-12-07 14:55:12,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:12,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:12,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:12,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:12,439 INFO L87 Difference]: Start difference. First operand 28919 states and 46167 transitions. Second operand 4 states. [2019-12-07 14:55:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:13,351 INFO L93 Difference]: Finished difference Result 62423 states and 98439 transitions. [2019-12-07 14:55:13,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:13,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 784 [2019-12-07 14:55:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:13,380 INFO L225 Difference]: With dead ends: 62423 [2019-12-07 14:55:13,380 INFO L226 Difference]: Without dead ends: 33523 [2019-12-07 14:55:13,395 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-12-07 14:55:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33523 states. [2019-12-07 14:55:13,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33523 to 28995. [2019-12-07 14:55:13,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28995 states. [2019-12-07 14:55:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28995 states to 28995 states and 46243 transitions. [2019-12-07 14:55:13,913 INFO L78 Accepts]: Start accepts. Automaton has 28995 states and 46243 transitions. Word has length 784 [2019-12-07 14:55:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:13,914 INFO L462 AbstractCegarLoop]: Abstraction has 28995 states and 46243 transitions. [2019-12-07 14:55:13,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 28995 states and 46243 transitions. [2019-12-07 14:55:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2019-12-07 14:55:13,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:13,938 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 16, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:13,938 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:13,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:13,938 INFO L82 PathProgramCache]: Analyzing trace with hash -300177575, now seen corresponding path program 1 times [2019-12-07 14:55:13,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:13,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607459805] [2019-12-07 14:55:13,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5744 backedges. 1876 proven. 0 refuted. 0 times theorem prover too weak. 3868 trivial. 0 not checked. [2019-12-07 14:55:14,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607459805] [2019-12-07 14:55:14,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:14,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:55:14,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308938434] [2019-12-07 14:55:14,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:55:14,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:14,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:55:14,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:55:14,468 INFO L87 Difference]: Start difference. First operand 28995 states and 46243 transitions. Second operand 5 states. [2019-12-07 14:55:15,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:15,450 INFO L93 Difference]: Finished difference Result 63405 states and 101028 transitions. [2019-12-07 14:55:15,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:55:15,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 784 [2019-12-07 14:55:15,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:15,481 INFO L225 Difference]: With dead ends: 63405 [2019-12-07 14:55:15,481 INFO L226 Difference]: Without dead ends: 34391 [2019-12-07 14:55:15,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:55:15,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34391 states. [2019-12-07 14:55:16,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34391 to 31465. [2019-12-07 14:55:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-12-07 14:55:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50651 transitions. [2019-12-07 14:55:16,087 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50651 transitions. Word has length 784 [2019-12-07 14:55:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:16,087 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50651 transitions. [2019-12-07 14:55:16,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:55:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50651 transitions. [2019-12-07 14:55:16,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2019-12-07 14:55:16,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:16,111 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:16,112 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:16,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:16,112 INFO L82 PathProgramCache]: Analyzing trace with hash 920835345, now seen corresponding path program 1 times [2019-12-07 14:55:16,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:16,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885325753] [2019-12-07 14:55:16,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5957 backedges. 1684 proven. 0 refuted. 0 times theorem prover too weak. 4273 trivial. 0 not checked. [2019-12-07 14:55:16,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885325753] [2019-12-07 14:55:16,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:16,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:16,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291115897] [2019-12-07 14:55:16,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:16,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:16,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:16,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:16,450 INFO L87 Difference]: Start difference. First operand 31465 states and 50651 transitions. Second operand 4 states. [2019-12-07 14:55:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:17,230 INFO L93 Difference]: Finished difference Result 64640 states and 103638 transitions. [2019-12-07 14:55:17,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:17,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 790 [2019-12-07 14:55:17,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:17,256 INFO L225 Difference]: With dead ends: 64640 [2019-12-07 14:55:17,256 INFO L226 Difference]: Without dead ends: 33194 [2019-12-07 14:55:17,270 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-12-07 14:55:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33194 states. [2019-12-07 14:55:17,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33194 to 31465. [2019-12-07 14:55:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-12-07 14:55:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50594 transitions. [2019-12-07 14:55:17,909 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50594 transitions. Word has length 790 [2019-12-07 14:55:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:17,909 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50594 transitions. [2019-12-07 14:55:17,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50594 transitions. [2019-12-07 14:55:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2019-12-07 14:55:17,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:17,934 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 20, 20, 20, 18, 18, 17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:55:17,934 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:17,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:17,935 INFO L82 PathProgramCache]: Analyzing trace with hash -713834898, now seen corresponding path program 1 times [2019-12-07 14:55:17,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:17,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655765611] [2019-12-07 14:55:17,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5926 backedges. 1449 proven. 0 refuted. 0 times theorem prover too weak. 4477 trivial. 0 not checked. [2019-12-07 14:55:18,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655765611] [2019-12-07 14:55:18,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:18,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:18,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758140836] [2019-12-07 14:55:18,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:18,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:18,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:18,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:18,266 INFO L87 Difference]: Start difference. First operand 31465 states and 50594 transitions. Second operand 4 states. [2019-12-07 14:55:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:19,000 INFO L93 Difference]: Finished difference Result 63899 states and 102670 transitions. [2019-12-07 14:55:19,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:19,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 791 [2019-12-07 14:55:19,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:19,028 INFO L225 Difference]: With dead ends: 63899 [2019-12-07 14:55:19,028 INFO L226 Difference]: Without dead ends: 32453 [2019-12-07 14:55:19,042 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-12-07 14:55:19,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32453 states. [2019-12-07 14:55:19,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32453 to 31465. [2019-12-07 14:55:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-12-07 14:55:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50518 transitions. [2019-12-07 14:55:19,666 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50518 transitions. Word has length 791 [2019-12-07 14:55:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:19,666 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50518 transitions. [2019-12-07 14:55:19,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:19,667 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50518 transitions. [2019-12-07 14:55:19,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2019-12-07 14:55:19,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:19,691 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:19,691 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:19,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:19,692 INFO L82 PathProgramCache]: Analyzing trace with hash -103465286, now seen corresponding path program 1 times [2019-12-07 14:55:19,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:19,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225420093] [2019-12-07 14:55:19,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5978 backedges. 1705 proven. 0 refuted. 0 times theorem prover too weak. 4273 trivial. 0 not checked. [2019-12-07 14:55:20,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225420093] [2019-12-07 14:55:20,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:20,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:20,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673196019] [2019-12-07 14:55:20,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:20,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:20,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:20,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:20,030 INFO L87 Difference]: Start difference. First operand 31465 states and 50518 transitions. Second operand 4 states. [2019-12-07 14:55:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:20,839 INFO L93 Difference]: Finished difference Result 64526 states and 103258 transitions. [2019-12-07 14:55:20,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:20,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 791 [2019-12-07 14:55:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:20,863 INFO L225 Difference]: With dead ends: 64526 [2019-12-07 14:55:20,864 INFO L226 Difference]: Without dead ends: 33080 [2019-12-07 14:55:20,878 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-12-07 14:55:20,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33080 states. [2019-12-07 14:55:21,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33080 to 31465. [2019-12-07 14:55:21,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-12-07 14:55:21,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50461 transitions. [2019-12-07 14:55:21,547 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50461 transitions. Word has length 791 [2019-12-07 14:55:21,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:21,547 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50461 transitions. [2019-12-07 14:55:21,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:21,548 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50461 transitions. [2019-12-07 14:55:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2019-12-07 14:55:21,572 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:21,573 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:21,573 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:21,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:21,573 INFO L82 PathProgramCache]: Analyzing trace with hash 878686074, now seen corresponding path program 1 times [2019-12-07 14:55:21,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:21,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598079001] [2019-12-07 14:55:21,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5999 backedges. 1726 proven. 0 refuted. 0 times theorem prover too weak. 4273 trivial. 0 not checked. [2019-12-07 14:55:21,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598079001] [2019-12-07 14:55:21,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:21,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:21,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812778454] [2019-12-07 14:55:21,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:21,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:21,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:21,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:21,909 INFO L87 Difference]: Start difference. First operand 31465 states and 50461 transitions. Second operand 4 states. [2019-12-07 14:55:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:22,705 INFO L93 Difference]: Finished difference Result 64469 states and 103087 transitions. [2019-12-07 14:55:22,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:22,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 791 [2019-12-07 14:55:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:22,734 INFO L225 Difference]: With dead ends: 64469 [2019-12-07 14:55:22,735 INFO L226 Difference]: Without dead ends: 33023 [2019-12-07 14:55:22,751 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-12-07 14:55:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33023 states. [2019-12-07 14:55:23,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33023 to 31465. [2019-12-07 14:55:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-12-07 14:55:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50404 transitions. [2019-12-07 14:55:23,302 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50404 transitions. Word has length 791 [2019-12-07 14:55:23,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:23,303 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50404 transitions. [2019-12-07 14:55:23,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:23,303 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50404 transitions. [2019-12-07 14:55:23,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2019-12-07 14:55:23,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:23,328 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 20, 20, 18, 18, 17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:55:23,328 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:23,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:23,329 INFO L82 PathProgramCache]: Analyzing trace with hash -943994634, now seen corresponding path program 1 times [2019-12-07 14:55:23,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:23,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512287319] [2019-12-07 14:55:23,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5946 backedges. 1469 proven. 0 refuted. 0 times theorem prover too weak. 4477 trivial. 0 not checked. [2019-12-07 14:55:23,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512287319] [2019-12-07 14:55:23,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:23,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:23,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190972447] [2019-12-07 14:55:23,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:23,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:23,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:23,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:23,750 INFO L87 Difference]: Start difference. First operand 31465 states and 50404 transitions. Second operand 4 states. [2019-12-07 14:55:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:24,469 INFO L93 Difference]: Finished difference Result 63899 states and 102290 transitions. [2019-12-07 14:55:24,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:24,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 792 [2019-12-07 14:55:24,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:24,493 INFO L225 Difference]: With dead ends: 63899 [2019-12-07 14:55:24,494 INFO L226 Difference]: Without dead ends: 32453 [2019-12-07 14:55:24,508 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-12-07 14:55:24,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32453 states. [2019-12-07 14:55:25,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32453 to 31465. [2019-12-07 14:55:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-12-07 14:55:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50328 transitions. [2019-12-07 14:55:25,069 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50328 transitions. Word has length 792 [2019-12-07 14:55:25,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:25,069 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50328 transitions. [2019-12-07 14:55:25,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50328 transitions. [2019-12-07 14:55:25,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2019-12-07 14:55:25,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:25,095 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:25,095 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:25,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:25,096 INFO L82 PathProgramCache]: Analyzing trace with hash 347902165, now seen corresponding path program 1 times [2019-12-07 14:55:25,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:25,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617288819] [2019-12-07 14:55:25,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5873 backedges. 1600 proven. 0 refuted. 0 times theorem prover too weak. 4273 trivial. 0 not checked. [2019-12-07 14:55:25,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617288819] [2019-12-07 14:55:25,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:25,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:25,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690491958] [2019-12-07 14:55:25,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:25,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:25,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:25,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:25,508 INFO L87 Difference]: Start difference. First operand 31465 states and 50328 transitions. Second operand 4 states. [2019-12-07 14:55:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:26,273 INFO L93 Difference]: Finished difference Result 47968 states and 76260 transitions. [2019-12-07 14:55:26,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:26,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 792 [2019-12-07 14:55:26,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:26,298 INFO L225 Difference]: With dead ends: 47968 [2019-12-07 14:55:26,298 INFO L226 Difference]: Without dead ends: 33023 [2019-12-07 14:55:26,308 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-12-07 14:55:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33023 states. [2019-12-07 14:55:26,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33023 to 31465. [2019-12-07 14:55:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-12-07 14:55:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50271 transitions. [2019-12-07 14:55:26,867 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50271 transitions. Word has length 792 [2019-12-07 14:55:26,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:26,867 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50271 transitions. [2019-12-07 14:55:26,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50271 transitions. [2019-12-07 14:55:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2019-12-07 14:55:26,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:26,893 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 18, 18, 17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:55:26,893 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:26,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:26,893 INFO L82 PathProgramCache]: Analyzing trace with hash -123229943, now seen corresponding path program 1 times [2019-12-07 14:55:26,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:26,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547976119] [2019-12-07 14:55:26,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:27,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5966 backedges. 1489 proven. 0 refuted. 0 times theorem prover too weak. 4477 trivial. 0 not checked. [2019-12-07 14:55:27,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547976119] [2019-12-07 14:55:27,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:27,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:27,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587134221] [2019-12-07 14:55:27,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:27,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:27,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:27,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:27,227 INFO L87 Difference]: Start difference. First operand 31465 states and 50271 transitions. Second operand 4 states. [2019-12-07 14:55:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:27,986 INFO L93 Difference]: Finished difference Result 63671 states and 101736 transitions. [2019-12-07 14:55:27,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:27,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 793 [2019-12-07 14:55:27,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:28,013 INFO L225 Difference]: With dead ends: 63671 [2019-12-07 14:55:28,014 INFO L226 Difference]: Without dead ends: 32225 [2019-12-07 14:55:28,022 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-12-07 14:55:28,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32225 states. [2019-12-07 14:55:28,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32225 to 31465. [2019-12-07 14:55:28,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-12-07 14:55:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50195 transitions. [2019-12-07 14:55:28,575 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50195 transitions. Word has length 793 [2019-12-07 14:55:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:28,575 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50195 transitions. [2019-12-07 14:55:28,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50195 transitions. [2019-12-07 14:55:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2019-12-07 14:55:28,600 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:28,601 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:28,601 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:28,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:28,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1236927746, now seen corresponding path program 1 times [2019-12-07 14:55:28,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:28,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017601495] [2019-12-07 14:55:28,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5894 backedges. 1621 proven. 0 refuted. 0 times theorem prover too weak. 4273 trivial. 0 not checked. [2019-12-07 14:55:28,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017601495] [2019-12-07 14:55:28,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:28,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:28,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861893815] [2019-12-07 14:55:28,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:28,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:28,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:28,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:28,939 INFO L87 Difference]: Start difference. First operand 31465 states and 50195 transitions. Second operand 4 states. [2019-12-07 14:55:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:29,707 INFO L93 Difference]: Finished difference Result 47968 states and 76070 transitions. [2019-12-07 14:55:29,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:29,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 793 [2019-12-07 14:55:29,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:29,732 INFO L225 Difference]: With dead ends: 47968 [2019-12-07 14:55:29,732 INFO L226 Difference]: Without dead ends: 33023 [2019-12-07 14:55:29,741 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-12-07 14:55:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33023 states. [2019-12-07 14:55:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33023 to 31465. [2019-12-07 14:55:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-12-07 14:55:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50138 transitions. [2019-12-07 14:55:30,305 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50138 transitions. Word has length 793 [2019-12-07 14:55:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:30,305 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50138 transitions. [2019-12-07 14:55:30,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50138 transitions. [2019-12-07 14:55:30,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2019-12-07 14:55:30,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:30,330 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:30,330 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:30,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:30,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1295042298, now seen corresponding path program 1 times [2019-12-07 14:55:30,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:30,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322253352] [2019-12-07 14:55:30,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5915 backedges. 1642 proven. 0 refuted. 0 times theorem prover too weak. 4273 trivial. 0 not checked. [2019-12-07 14:55:30,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322253352] [2019-12-07 14:55:30,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:30,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:30,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307904637] [2019-12-07 14:55:30,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:30,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:30,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:30,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:30,747 INFO L87 Difference]: Start difference. First operand 31465 states and 50138 transitions. Second operand 4 states. [2019-12-07 14:55:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:31,523 INFO L93 Difference]: Finished difference Result 47968 states and 75994 transitions. [2019-12-07 14:55:31,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:31,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 794 [2019-12-07 14:55:31,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:31,552 INFO L225 Difference]: With dead ends: 47968 [2019-12-07 14:55:31,552 INFO L226 Difference]: Without dead ends: 33023 [2019-12-07 14:55:31,562 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-12-07 14:55:31,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33023 states. [2019-12-07 14:55:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33023 to 31465. [2019-12-07 14:55:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-12-07 14:55:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50081 transitions. [2019-12-07 14:55:32,134 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50081 transitions. Word has length 794 [2019-12-07 14:55:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:32,134 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50081 transitions. [2019-12-07 14:55:32,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50081 transitions. [2019-12-07 14:55:32,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2019-12-07 14:55:32,159 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:32,159 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:32,160 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:32,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:32,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1696175229, now seen corresponding path program 1 times [2019-12-07 14:55:32,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:32,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009085226] [2019-12-07 14:55:32,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5936 backedges. 1663 proven. 0 refuted. 0 times theorem prover too weak. 4273 trivial. 0 not checked. [2019-12-07 14:55:32,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009085226] [2019-12-07 14:55:32,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:32,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:32,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427266369] [2019-12-07 14:55:32,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:32,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:32,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:32,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:32,510 INFO L87 Difference]: Start difference. First operand 31465 states and 50081 transitions. Second operand 4 states. [2019-12-07 14:55:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:33,312 INFO L93 Difference]: Finished difference Result 47778 states and 75690 transitions. [2019-12-07 14:55:33,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:33,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 795 [2019-12-07 14:55:33,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:33,334 INFO L225 Difference]: With dead ends: 47778 [2019-12-07 14:55:33,334 INFO L226 Difference]: Without dead ends: 32833 [2019-12-07 14:55:33,339 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-12-07 14:55:33,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32833 states. [2019-12-07 14:55:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32833 to 31465. [2019-12-07 14:55:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31465 states. [2019-12-07 14:55:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31465 states to 31465 states and 50024 transitions. [2019-12-07 14:55:33,898 INFO L78 Accepts]: Start accepts. Automaton has 31465 states and 50024 transitions. Word has length 795 [2019-12-07 14:55:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:33,899 INFO L462 AbstractCegarLoop]: Abstraction has 31465 states and 50024 transitions. [2019-12-07 14:55:33,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 31465 states and 50024 transitions. [2019-12-07 14:55:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2019-12-07 14:55:33,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:33,924 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:33,924 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:33,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:33,925 INFO L82 PathProgramCache]: Analyzing trace with hash 402427948, now seen corresponding path program 1 times [2019-12-07 14:55:33,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:33,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851434385] [2019-12-07 14:55:33,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5957 backedges. 2037 proven. 0 refuted. 0 times theorem prover too weak. 3920 trivial. 0 not checked. [2019-12-07 14:55:34,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851434385] [2019-12-07 14:55:34,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:34,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:34,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686516217] [2019-12-07 14:55:34,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:34,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:34,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:34,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:34,290 INFO L87 Difference]: Start difference. First operand 31465 states and 50024 transitions. Second operand 4 states. [2019-12-07 14:55:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:35,194 INFO L93 Difference]: Finished difference Result 67775 states and 107730 transitions. [2019-12-07 14:55:35,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:35,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 796 [2019-12-07 14:55:35,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:35,221 INFO L225 Difference]: With dead ends: 67775 [2019-12-07 14:55:35,222 INFO L226 Difference]: Without dead ends: 36329 [2019-12-07 14:55:35,236 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-12-07 14:55:35,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36329 states. [2019-12-07 14:55:35,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36329 to 31427. [2019-12-07 14:55:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31427 states. [2019-12-07 14:55:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31427 states to 31427 states and 49948 transitions. [2019-12-07 14:55:35,836 INFO L78 Accepts]: Start accepts. Automaton has 31427 states and 49948 transitions. Word has length 796 [2019-12-07 14:55:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:35,837 INFO L462 AbstractCegarLoop]: Abstraction has 31427 states and 49948 transitions. [2019-12-07 14:55:35,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 31427 states and 49948 transitions. [2019-12-07 14:55:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 798 [2019-12-07 14:55:35,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:35,862 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:35,862 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:35,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:35,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1987925951, now seen corresponding path program 1 times [2019-12-07 14:55:35,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:35,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395040738] [2019-12-07 14:55:35,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5999 backedges. 2084 proven. 0 refuted. 0 times theorem prover too weak. 3915 trivial. 0 not checked. [2019-12-07 14:55:36,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395040738] [2019-12-07 14:55:36,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:36,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:36,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004606122] [2019-12-07 14:55:36,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:36,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:36,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:36,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:36,328 INFO L87 Difference]: Start difference. First operand 31427 states and 49948 transitions. Second operand 4 states. [2019-12-07 14:55:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:37,380 INFO L93 Difference]: Finished difference Result 67363 states and 105849 transitions. [2019-12-07 14:55:37,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:37,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 797 [2019-12-07 14:55:37,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:37,410 INFO L225 Difference]: With dead ends: 67363 [2019-12-07 14:55:37,411 INFO L226 Difference]: Without dead ends: 35955 [2019-12-07 14:55:37,427 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-12-07 14:55:37,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35955 states. [2019-12-07 14:55:38,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35955 to 31427. [2019-12-07 14:55:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31427 states. [2019-12-07 14:55:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31427 states to 31427 states and 49872 transitions. [2019-12-07 14:55:38,034 INFO L78 Accepts]: Start accepts. Automaton has 31427 states and 49872 transitions. Word has length 797 [2019-12-07 14:55:38,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:38,034 INFO L462 AbstractCegarLoop]: Abstraction has 31427 states and 49872 transitions. [2019-12-07 14:55:38,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:38,035 INFO L276 IsEmpty]: Start isEmpty. Operand 31427 states and 49872 transitions. [2019-12-07 14:55:38,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 799 [2019-12-07 14:55:38,060 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:38,060 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 16, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:38,060 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:38,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:38,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1901591263, now seen corresponding path program 1 times [2019-12-07 14:55:38,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:38,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138525817] [2019-12-07 14:55:38,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6014 backedges. 2099 proven. 0 refuted. 0 times theorem prover too weak. 3915 trivial. 0 not checked. [2019-12-07 14:55:38,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138525817] [2019-12-07 14:55:38,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:38,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:38,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602885718] [2019-12-07 14:55:38,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:38,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:38,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:38,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:38,427 INFO L87 Difference]: Start difference. First operand 31427 states and 49872 transitions. Second operand 4 states. [2019-12-07 14:55:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:39,456 INFO L93 Difference]: Finished difference Result 66907 states and 105065 transitions. [2019-12-07 14:55:39,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:39,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 798 [2019-12-07 14:55:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:39,484 INFO L225 Difference]: With dead ends: 66907 [2019-12-07 14:55:39,484 INFO L226 Difference]: Without dead ends: 35499 [2019-12-07 14:55:39,499 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-12-07 14:55:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35499 states. [2019-12-07 14:55:40,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35499 to 31427. [2019-12-07 14:55:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31427 states. [2019-12-07 14:55:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31427 states to 31427 states and 49796 transitions. [2019-12-07 14:55:40,149 INFO L78 Accepts]: Start accepts. Automaton has 31427 states and 49796 transitions. Word has length 798 [2019-12-07 14:55:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:40,150 INFO L462 AbstractCegarLoop]: Abstraction has 31427 states and 49796 transitions. [2019-12-07 14:55:40,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 31427 states and 49796 transitions. [2019-12-07 14:55:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 799 [2019-12-07 14:55:40,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:40,175 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:40,175 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:40,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:40,175 INFO L82 PathProgramCache]: Analyzing trace with hash 374599984, now seen corresponding path program 1 times [2019-12-07 14:55:40,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:40,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311150358] [2019-12-07 14:55:40,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:40,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5873 backedges. 1988 proven. 0 refuted. 0 times theorem prover too weak. 3885 trivial. 0 not checked. [2019-12-07 14:55:40,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311150358] [2019-12-07 14:55:40,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:40,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:55:40,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146513207] [2019-12-07 14:55:40,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:55:40,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:40,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:55:40,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:55:40,634 INFO L87 Difference]: Start difference. First operand 31427 states and 49796 transitions. Second operand 5 states. [2019-12-07 14:55:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:41,710 INFO L93 Difference]: Finished difference Result 71258 states and 112588 transitions. [2019-12-07 14:55:41,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:41,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 798 [2019-12-07 14:55:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:41,740 INFO L225 Difference]: With dead ends: 71258 [2019-12-07 14:55:41,740 INFO L226 Difference]: Without dead ends: 39850 [2019-12-07 14:55:41,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:55:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39850 states. [2019-12-07 14:55:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39850 to 32301. [2019-12-07 14:55:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32301 states. [2019-12-07 14:55:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32301 states to 32301 states and 51354 transitions. [2019-12-07 14:55:42,414 INFO L78 Accepts]: Start accepts. Automaton has 32301 states and 51354 transitions. Word has length 798 [2019-12-07 14:55:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:42,414 INFO L462 AbstractCegarLoop]: Abstraction has 32301 states and 51354 transitions. [2019-12-07 14:55:42,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:55:42,414 INFO L276 IsEmpty]: Start isEmpty. Operand 32301 states and 51354 transitions. [2019-12-07 14:55:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 799 [2019-12-07 14:55:42,440 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:42,440 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:42,440 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:42,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:42,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1575722194, now seen corresponding path program 2 times [2019-12-07 14:55:42,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:42,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620286856] [2019-12-07 14:55:42,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5873 backedges. 1228 proven. 0 refuted. 0 times theorem prover too weak. 4645 trivial. 0 not checked. [2019-12-07 14:55:42,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620286856] [2019-12-07 14:55:42,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:42,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:55:42,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406341298] [2019-12-07 14:55:42,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:55:42,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:42,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:55:42,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:55:42,905 INFO L87 Difference]: Start difference. First operand 32301 states and 51354 transitions. Second operand 6 states. [2019-12-07 14:55:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:44,684 INFO L93 Difference]: Finished difference Result 78693 states and 123674 transitions. [2019-12-07 14:55:44,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:55:44,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 798 [2019-12-07 14:55:44,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:44,719 INFO L225 Difference]: With dead ends: 78693 [2019-12-07 14:55:44,720 INFO L226 Difference]: Without dead ends: 46411 [2019-12-07 14:55:44,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:55:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46411 states. [2019-12-07 14:55:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46411 to 34277. [2019-12-07 14:55:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34277 states. [2019-12-07 14:55:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34277 states to 34277 states and 54223 transitions. [2019-12-07 14:55:45,478 INFO L78 Accepts]: Start accepts. Automaton has 34277 states and 54223 transitions. Word has length 798 [2019-12-07 14:55:45,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:45,478 INFO L462 AbstractCegarLoop]: Abstraction has 34277 states and 54223 transitions. [2019-12-07 14:55:45,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:55:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 34277 states and 54223 transitions. [2019-12-07 14:55:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2019-12-07 14:55:45,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:45,506 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 16, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:45,506 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:45,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:45,506 INFO L82 PathProgramCache]: Analyzing trace with hash -375088688, now seen corresponding path program 1 times [2019-12-07 14:55:45,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:45,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937672979] [2019-12-07 14:55:45,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5888 backedges. 2003 proven. 0 refuted. 0 times theorem prover too weak. 3885 trivial. 0 not checked. [2019-12-07 14:55:45,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937672979] [2019-12-07 14:55:45,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:45,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:55:45,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165923830] [2019-12-07 14:55:45,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:55:45,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:45,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:55:45,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:55:45,982 INFO L87 Difference]: Start difference. First operand 34277 states and 54223 transitions. Second operand 5 states. [2019-12-07 14:55:47,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:47,232 INFO L93 Difference]: Finished difference Result 74640 states and 117212 transitions. [2019-12-07 14:55:47,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:47,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 799 [2019-12-07 14:55:47,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:47,263 INFO L225 Difference]: With dead ends: 74640 [2019-12-07 14:55:47,263 INFO L226 Difference]: Without dead ends: 40382 [2019-12-07 14:55:47,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:55:47,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40382 states. [2019-12-07 14:55:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40382 to 34353. [2019-12-07 14:55:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34353 states. [2019-12-07 14:55:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34353 states to 34353 states and 54185 transitions. [2019-12-07 14:55:47,999 INFO L78 Accepts]: Start accepts. Automaton has 34353 states and 54185 transitions. Word has length 799 [2019-12-07 14:55:47,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:47,999 INFO L462 AbstractCegarLoop]: Abstraction has 34353 states and 54185 transitions. [2019-12-07 14:55:48,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:55:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 34353 states and 54185 transitions. [2019-12-07 14:55:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2019-12-07 14:55:48,026 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:48,026 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 18, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:48,026 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:48,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:48,027 INFO L82 PathProgramCache]: Analyzing trace with hash -857024230, now seen corresponding path program 1 times [2019-12-07 14:55:48,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:48,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622926777] [2019-12-07 14:55:48,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5911 backedges. 1011 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-12-07 14:55:48,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622926777] [2019-12-07 14:55:48,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:48,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:48,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777949394] [2019-12-07 14:55:48,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:48,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:48,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:48,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:48,357 INFO L87 Difference]: Start difference. First operand 34353 states and 54185 transitions. Second operand 4 states. [2019-12-07 14:55:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:49,501 INFO L93 Difference]: Finished difference Result 57322 states and 89771 transitions. [2019-12-07 14:55:49,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:49,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 800 [2019-12-07 14:55:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:49,535 INFO L225 Difference]: With dead ends: 57322 [2019-12-07 14:55:49,535 INFO L226 Difference]: Without dead ends: 39698 [2019-12-07 14:55:49,547 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-12-07 14:55:49,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39698 states. [2019-12-07 14:55:50,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39698 to 34353. [2019-12-07 14:55:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34353 states. [2019-12-07 14:55:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34353 states to 34353 states and 54109 transitions. [2019-12-07 14:55:50,286 INFO L78 Accepts]: Start accepts. Automaton has 34353 states and 54109 transitions. Word has length 800 [2019-12-07 14:55:50,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:50,286 INFO L462 AbstractCegarLoop]: Abstraction has 34353 states and 54109 transitions. [2019-12-07 14:55:50,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 34353 states and 54109 transitions. [2019-12-07 14:55:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2019-12-07 14:55:50,312 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:50,313 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 18, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:50,313 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:50,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:50,313 INFO L82 PathProgramCache]: Analyzing trace with hash -646211802, now seen corresponding path program 1 times [2019-12-07 14:55:50,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:50,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266522343] [2019-12-07 14:55:50,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5932 backedges. 1032 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-12-07 14:55:50,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266522343] [2019-12-07 14:55:50,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:50,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:50,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798199223] [2019-12-07 14:55:50,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:50,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:50,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:50,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:50,686 INFO L87 Difference]: Start difference. First operand 34353 states and 54109 transitions. Second operand 4 states. [2019-12-07 14:55:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:51,883 INFO L93 Difference]: Finished difference Result 57322 states and 89657 transitions. [2019-12-07 14:55:51,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:51,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 801 [2019-12-07 14:55:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:51,912 INFO L225 Difference]: With dead ends: 57322 [2019-12-07 14:55:51,912 INFO L226 Difference]: Without dead ends: 39698 [2019-12-07 14:55:51,924 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-12-07 14:55:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39698 states. [2019-12-07 14:55:52,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39698 to 34353. [2019-12-07 14:55:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34353 states. [2019-12-07 14:55:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34353 states to 34353 states and 54033 transitions. [2019-12-07 14:55:52,662 INFO L78 Accepts]: Start accepts. Automaton has 34353 states and 54033 transitions. Word has length 801 [2019-12-07 14:55:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:52,662 INFO L462 AbstractCegarLoop]: Abstraction has 34353 states and 54033 transitions. [2019-12-07 14:55:52,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 34353 states and 54033 transitions. [2019-12-07 14:55:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 803 [2019-12-07 14:55:52,688 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:52,689 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 18, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:52,689 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:52,689 INFO L82 PathProgramCache]: Analyzing trace with hash -372672587, now seen corresponding path program 1 times [2019-12-07 14:55:52,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:52,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949772632] [2019-12-07 14:55:52,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5953 backedges. 1053 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2019-12-07 14:55:53,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949772632] [2019-12-07 14:55:53,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:53,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:53,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255563104] [2019-12-07 14:55:53,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:53,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:53,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:53,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:53,024 INFO L87 Difference]: Start difference. First operand 34353 states and 54033 transitions. Second operand 4 states. [2019-12-07 14:55:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:54,223 INFO L93 Difference]: Finished difference Result 57132 states and 89315 transitions. [2019-12-07 14:55:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:54,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 802 [2019-12-07 14:55:54,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:54,252 INFO L225 Difference]: With dead ends: 57132 [2019-12-07 14:55:54,252 INFO L226 Difference]: Without dead ends: 39508 [2019-12-07 14:55:54,265 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-12-07 14:55:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39508 states. [2019-12-07 14:55:54,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39508 to 34353. [2019-12-07 14:55:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34353 states. [2019-12-07 14:55:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34353 states to 34353 states and 53957 transitions. [2019-12-07 14:55:55,026 INFO L78 Accepts]: Start accepts. Automaton has 34353 states and 53957 transitions. Word has length 802 [2019-12-07 14:55:55,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:55,026 INFO L462 AbstractCegarLoop]: Abstraction has 34353 states and 53957 transitions. [2019-12-07 14:55:55,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:55,026 INFO L276 IsEmpty]: Start isEmpty. Operand 34353 states and 53957 transitions. [2019-12-07 14:55:55,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2019-12-07 14:55:55,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:55,054 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 20, 20, 20, 19, 19, 18, 18, 18, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:55,054 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:55,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:55,054 INFO L82 PathProgramCache]: Analyzing trace with hash 878611890, now seen corresponding path program 1 times [2019-12-07 14:55:55,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:55,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375903056] [2019-12-07 14:55:55,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6125 backedges. 1099 proven. 0 refuted. 0 times theorem prover too weak. 5026 trivial. 0 not checked. [2019-12-07 14:55:55,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375903056] [2019-12-07 14:55:55,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:55:55,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:55:55,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826410984] [2019-12-07 14:55:55,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:55:55,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:55,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:55:55,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:55:55,451 INFO L87 Difference]: Start difference. First operand 34353 states and 53957 transitions. Second operand 4 states. [2019-12-07 14:55:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:55:56,661 INFO L93 Difference]: Finished difference Result 73842 states and 115344 transitions. [2019-12-07 14:55:56,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:55:56,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 812 [2019-12-07 14:55:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:55:56,692 INFO L225 Difference]: With dead ends: 73842 [2019-12-07 14:55:56,692 INFO L226 Difference]: Without dead ends: 39508 [2019-12-07 14:55:56,708 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-12-07 14:55:56,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39508 states. [2019-12-07 14:55:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39508 to 34353. [2019-12-07 14:55:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34353 states. [2019-12-07 14:55:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34353 states to 34353 states and 53881 transitions. [2019-12-07 14:55:57,476 INFO L78 Accepts]: Start accepts. Automaton has 34353 states and 53881 transitions. Word has length 812 [2019-12-07 14:55:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:55:57,476 INFO L462 AbstractCegarLoop]: Abstraction has 34353 states and 53881 transitions. [2019-12-07 14:55:57,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:55:57,476 INFO L276 IsEmpty]: Start isEmpty. Operand 34353 states and 53881 transitions. [2019-12-07 14:55:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2019-12-07 14:55:57,503 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:55:57,503 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 16, 15, 15, 14, 14, 13, 13, 11, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:55:57,503 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:55:57,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:55:57,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1088166287, now seen corresponding path program 1 times [2019-12-07 14:55:57,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:55:57,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191693019] [2019-12-07 14:55:57,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:55:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:58,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6252 backedges. 3250 proven. 27 refuted. 0 times theorem prover too weak. 2975 trivial. 0 not checked. [2019-12-07 14:55:58,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191693019] [2019-12-07 14:55:58,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922566198] [2019-12-07 14:55:58,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/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-12-07 14:55:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:55:58,394 INFO L264 TraceCheckSpWp]: Trace formula consists of 2570 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 14:55:58,403 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:55:58,412 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-12-07 14:55:58,412 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:58,414 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:58,414 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:55:58,414 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 14:55:58,417 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-12-07 14:55:58,417 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:58,419 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:58,419 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:55:58,419 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:55:58,427 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_175|, |v_#memory_$Pointer$.offset_161|], 2=[|v_#memory_int_180|]} [2019-12-07 14:55:58,429 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-12-07 14:55:58,429 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:55:58,433 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:58,435 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-12-07 14:55:58,435 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:55:58,439 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:58,451 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:58,451 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-12-07 14:55:58,451 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:58,467 INFO L614 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-12-07 14:55:58,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:58,468 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:55:58,469 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-12-07 14:55:58,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:58,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:58,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:58,492 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-12-07 14:55:58,493 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:58,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:58,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:58,511 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-12-07 14:55:58,511 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:58,543 INFO L614 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-12-07 14:55:58,544 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:55:58,544 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-12-07 14:55:58,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:55:58,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:55:58,569 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-12-07 14:55:58,569 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:58,571 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:55:58,572 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-12-07 14:55:58,572 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:55:58,574 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:55:58,575 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 14:55:58,575 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-12-07 14:55:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6252 backedges. 3250 proven. 27 refuted. 0 times theorem prover too weak. 2975 trivial. 0 not checked. [2019-12-07 14:55:58,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:55:58,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2019-12-07 14:55:58,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039929604] [2019-12-07 14:55:58,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:55:58,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:55:58,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:55:58,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:55:58,995 INFO L87 Difference]: Start difference. First operand 34353 states and 53881 transitions. Second operand 12 states. [2019-12-07 14:56:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:56:04,058 INFO L93 Difference]: Finished difference Result 95958 states and 148082 transitions. [2019-12-07 14:56:04,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 14:56:04,059 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 812 [2019-12-07 14:56:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:56:04,117 INFO L225 Difference]: With dead ends: 95958 [2019-12-07 14:56:04,117 INFO L226 Difference]: Without dead ends: 61624 [2019-12-07 14:56:04,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 839 GetRequests, 814 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-07 14:56:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61624 states. [2019-12-07 14:56:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61624 to 35949. [2019-12-07 14:56:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35949 states. [2019-12-07 14:56:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35949 states to 35949 states and 56541 transitions. [2019-12-07 14:56:05,124 INFO L78 Accepts]: Start accepts. Automaton has 35949 states and 56541 transitions. Word has length 812 [2019-12-07 14:56:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:56:05,124 INFO L462 AbstractCegarLoop]: Abstraction has 35949 states and 56541 transitions. [2019-12-07 14:56:05,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:56:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 35949 states and 56541 transitions. [2019-12-07 14:56:05,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2019-12-07 14:56:05,152 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:56:05,153 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 24, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 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, 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, 1, 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-12-07 14:56:05,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:56:05,354 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:56:05,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:56:05,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1440017906, now seen corresponding path program 1 times [2019-12-07 14:56:05,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:56:05,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280241823] [2019-12-07 14:56:05,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:56:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:56:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6723 backedges. 3525 proven. 0 refuted. 0 times theorem prover too weak. 3198 trivial. 0 not checked. [2019-12-07 14:56:05,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280241823] [2019-12-07 14:56:05,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:56:05,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:56:05,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208641149] [2019-12-07 14:56:05,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:56:05,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:56:05,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:56:05,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:56:05,855 INFO L87 Difference]: Start difference. First operand 35949 states and 56541 transitions. Second operand 4 states. [2019-12-07 14:56:07,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:56:07,210 INFO L93 Difference]: Finished difference Result 57947 states and 90316 transitions. [2019-12-07 14:56:07,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:56:07,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 854 [2019-12-07 14:56:07,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:56:07,244 INFO L225 Difference]: With dead ends: 57947 [2019-12-07 14:56:07,244 INFO L226 Difference]: Without dead ends: 39525 [2019-12-07 14:56:07,256 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-12-07 14:56:07,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39525 states. [2019-12-07 14:56:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39525 to 35949. [2019-12-07 14:56:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35949 states. [2019-12-07 14:56:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35949 states to 35949 states and 56465 transitions. [2019-12-07 14:56:08,131 INFO L78 Accepts]: Start accepts. Automaton has 35949 states and 56465 transitions. Word has length 854 [2019-12-07 14:56:08,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:56:08,131 INFO L462 AbstractCegarLoop]: Abstraction has 35949 states and 56465 transitions. [2019-12-07 14:56:08,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:56:08,132 INFO L276 IsEmpty]: Start isEmpty. Operand 35949 states and 56465 transitions. [2019-12-07 14:56:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2019-12-07 14:56:08,159 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:56:08,160 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 22, 22, 22, 22, 22, 22, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 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, 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, 1, 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-12-07 14:56:08,160 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:56:08,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:56:08,160 INFO L82 PathProgramCache]: Analyzing trace with hash 861777995, now seen corresponding path program 1 times [2019-12-07 14:56:08,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:56:08,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393284496] [2019-12-07 14:56:08,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:56:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:56:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6792 backedges. 3575 proven. 0 refuted. 0 times theorem prover too weak. 3217 trivial. 0 not checked. [2019-12-07 14:56:08,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393284496] [2019-12-07 14:56:08,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:56:08,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:56:08,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708571214] [2019-12-07 14:56:08,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:56:08,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:56:08,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:56:08,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:56:08,591 INFO L87 Difference]: Start difference. First operand 35949 states and 56465 transitions. Second operand 4 states. [2019-12-07 14:56:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:56:10,032 INFO L93 Difference]: Finished difference Result 57947 states and 90202 transitions. [2019-12-07 14:56:10,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:56:10,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 857 [2019-12-07 14:56:10,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:56:10,061 INFO L225 Difference]: With dead ends: 57947 [2019-12-07 14:56:10,061 INFO L226 Difference]: Without dead ends: 39525 [2019-12-07 14:56:10,071 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-12-07 14:56:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39525 states. [2019-12-07 14:56:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39525 to 35949. [2019-12-07 14:56:10,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35949 states. [2019-12-07 14:56:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35949 states to 35949 states and 56389 transitions. [2019-12-07 14:56:10,940 INFO L78 Accepts]: Start accepts. Automaton has 35949 states and 56389 transitions. Word has length 857 [2019-12-07 14:56:10,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:56:10,941 INFO L462 AbstractCegarLoop]: Abstraction has 35949 states and 56389 transitions. [2019-12-07 14:56:10,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:56:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 35949 states and 56389 transitions. [2019-12-07 14:56:10,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2019-12-07 14:56:10,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:56:10,970 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 24, 24, 24, 22, 22, 22, 22, 22, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 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, 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, 1, 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-12-07 14:56:10,970 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:56:10,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:56:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1661748781, now seen corresponding path program 1 times [2019-12-07 14:56:10,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:56:10,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268931620] [2019-12-07 14:56:10,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:56:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:56:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6861 backedges. 3625 proven. 0 refuted. 0 times theorem prover too weak. 3236 trivial. 0 not checked. [2019-12-07 14:56:11,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268931620] [2019-12-07 14:56:11,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:56:11,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:56:11,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451005087] [2019-12-07 14:56:11,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:56:11,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:56:11,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:56:11,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:56:11,403 INFO L87 Difference]: Start difference. First operand 35949 states and 56389 transitions. Second operand 4 states. [2019-12-07 14:56:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:56:12,823 INFO L93 Difference]: Finished difference Result 57947 states and 90088 transitions. [2019-12-07 14:56:12,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:56:12,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 860 [2019-12-07 14:56:12,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:56:12,853 INFO L225 Difference]: With dead ends: 57947 [2019-12-07 14:56:12,853 INFO L226 Difference]: Without dead ends: 39525 [2019-12-07 14:56:12,864 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-12-07 14:56:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39525 states. [2019-12-07 14:56:13,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39525 to 35949. [2019-12-07 14:56:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35949 states. [2019-12-07 14:56:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35949 states to 35949 states and 56313 transitions. [2019-12-07 14:56:13,811 INFO L78 Accepts]: Start accepts. Automaton has 35949 states and 56313 transitions. Word has length 860 [2019-12-07 14:56:13,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:56:13,812 INFO L462 AbstractCegarLoop]: Abstraction has 35949 states and 56313 transitions. [2019-12-07 14:56:13,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:56:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 35949 states and 56313 transitions. [2019-12-07 14:56:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 864 [2019-12-07 14:56:13,838 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:56:13,839 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 24, 24, 24, 22, 22, 22, 22, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 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, 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, 1, 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-12-07 14:56:13,839 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:56:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:56:13,839 INFO L82 PathProgramCache]: Analyzing trace with hash 998099846, now seen corresponding path program 1 times [2019-12-07 14:56:13,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:56:13,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664007673] [2019-12-07 14:56:13,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:56:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:56:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6930 backedges. 3675 proven. 0 refuted. 0 times theorem prover too weak. 3255 trivial. 0 not checked. [2019-12-07 14:56:14,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664007673] [2019-12-07 14:56:14,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:56:14,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:56:14,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12513666] [2019-12-07 14:56:14,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:56:14,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:56:14,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:56:14,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:56:14,275 INFO L87 Difference]: Start difference. First operand 35949 states and 56313 transitions. Second operand 4 states. [2019-12-07 14:56:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:56:15,691 INFO L93 Difference]: Finished difference Result 57757 states and 89746 transitions. [2019-12-07 14:56:15,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:56:15,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 863 [2019-12-07 14:56:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:56:15,722 INFO L225 Difference]: With dead ends: 57757 [2019-12-07 14:56:15,722 INFO L226 Difference]: Without dead ends: 39335 [2019-12-07 14:56:15,734 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-12-07 14:56:15,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39335 states. [2019-12-07 14:56:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39335 to 35949. [2019-12-07 14:56:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35949 states. [2019-12-07 14:56:16,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35949 states to 35949 states and 56237 transitions. [2019-12-07 14:56:16,636 INFO L78 Accepts]: Start accepts. Automaton has 35949 states and 56237 transitions. Word has length 863 [2019-12-07 14:56:16,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:56:16,636 INFO L462 AbstractCegarLoop]: Abstraction has 35949 states and 56237 transitions. [2019-12-07 14:56:16,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:56:16,636 INFO L276 IsEmpty]: Start isEmpty. Operand 35949 states and 56237 transitions. [2019-12-07 14:56:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2019-12-07 14:56:16,664 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:56:16,665 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:56:16,665 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:56:16,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:56:16,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1639594912, now seen corresponding path program 1 times [2019-12-07 14:56:16,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:56:16,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971810449] [2019-12-07 14:56:16,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:56:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:56:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7410 backedges. 4031 proven. 0 refuted. 0 times theorem prover too weak. 3379 trivial. 0 not checked. [2019-12-07 14:56:17,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971810449] [2019-12-07 14:56:17,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:56:17,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:56:17,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441615566] [2019-12-07 14:56:17,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:56:17,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:56:17,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:56:17,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:56:17,178 INFO L87 Difference]: Start difference. First operand 35949 states and 56237 transitions. Second operand 4 states. [2019-12-07 14:56:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:56:18,645 INFO L93 Difference]: Finished difference Result 75265 states and 116915 transitions. [2019-12-07 14:56:18,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:56:18,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 875 [2019-12-07 14:56:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:56:18,675 INFO L225 Difference]: With dead ends: 75265 [2019-12-07 14:56:18,676 INFO L226 Difference]: Without dead ends: 39335 [2019-12-07 14:56:18,692 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-12-07 14:56:18,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39335 states. [2019-12-07 14:56:19,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39335 to 35949. [2019-12-07 14:56:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35949 states. [2019-12-07 14:56:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35949 states to 35949 states and 56161 transitions. [2019-12-07 14:56:19,605 INFO L78 Accepts]: Start accepts. Automaton has 35949 states and 56161 transitions. Word has length 875 [2019-12-07 14:56:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:56:19,605 INFO L462 AbstractCegarLoop]: Abstraction has 35949 states and 56161 transitions. [2019-12-07 14:56:19,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:56:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 35949 states and 56161 transitions. [2019-12-07 14:56:19,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2019-12-07 14:56:19,633 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:56:19,633 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 23, 23, 19, 19, 18, 18, 17, 17, 17, 17, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 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-12-07 14:56:19,633 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:56:19,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:56:19,634 INFO L82 PathProgramCache]: Analyzing trace with hash -471142324, now seen corresponding path program 1 times [2019-12-07 14:56:19,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:56:19,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502653058] [2019-12-07 14:56:19,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:56:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:56:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7524 backedges. 4237 proven. 46 refuted. 0 times theorem prover too weak. 3241 trivial. 0 not checked. [2019-12-07 14:56:20,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502653058] [2019-12-07 14:56:20,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952364640] [2019-12-07 14:56:20,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/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-12-07 14:56:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:56:20,452 INFO L264 TraceCheckSpWp]: Trace formula consists of 2774 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:56:20,461 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:56:20,469 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-12-07 14:56:20,469 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:20,470 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:20,471 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:56:20,471 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 14:56:20,480 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:56:20,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:56:20,481 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:20,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:20,484 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:56:20,484 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:56:20,497 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:56:20,497 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-12-07 14:56:20,497 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:20,499 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:20,499 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:56:20,499 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:56:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7524 backedges. 4237 proven. 46 refuted. 0 times theorem prover too weak. 3241 trivial. 0 not checked. [2019-12-07 14:56:20,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:56:20,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-07 14:56:20,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538407662] [2019-12-07 14:56:20,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 14:56:20,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:56:20,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 14:56:20,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:56:20,961 INFO L87 Difference]: Start difference. First operand 35949 states and 56161 transitions. Second operand 9 states. [2019-12-07 14:56:23,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:56:23,656 INFO L93 Difference]: Finished difference Result 80796 states and 124772 transitions. [2019-12-07 14:56:23,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:56:23,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 875 [2019-12-07 14:56:23,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:56:23,692 INFO L225 Difference]: With dead ends: 80796 [2019-12-07 14:56:23,692 INFO L226 Difference]: Without dead ends: 44866 [2019-12-07 14:56:23,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 876 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:56:23,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44866 states. [2019-12-07 14:56:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44866 to 36101. [2019-12-07 14:56:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36101 states. [2019-12-07 14:56:24,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36101 states to 36101 states and 56237 transitions. [2019-12-07 14:56:24,671 INFO L78 Accepts]: Start accepts. Automaton has 36101 states and 56237 transitions. Word has length 875 [2019-12-07 14:56:24,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:56:24,672 INFO L462 AbstractCegarLoop]: Abstraction has 36101 states and 56237 transitions. [2019-12-07 14:56:24,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 14:56:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 36101 states and 56237 transitions. [2019-12-07 14:56:24,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 879 [2019-12-07 14:56:24,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:56:24,701 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 23, 20, 19, 19, 18, 18, 17, 17, 17, 17, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:56:24,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:56:24,902 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:56:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:56:24,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1910766567, now seen corresponding path program 1 times [2019-12-07 14:56:24,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:56:24,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762747935] [2019-12-07 14:56:24,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:56:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:56:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7473 backedges. 4075 proven. 0 refuted. 0 times theorem prover too weak. 3398 trivial. 0 not checked. [2019-12-07 14:56:25,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762747935] [2019-12-07 14:56:25,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:56:25,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:56:25,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199914259] [2019-12-07 14:56:25,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:56:25,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:56:25,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:56:25,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:56:25,392 INFO L87 Difference]: Start difference. First operand 36101 states and 56237 transitions. Second operand 4 states. [2019-12-07 14:56:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:56:26,917 INFO L93 Difference]: Finished difference Result 75265 states and 116475 transitions. [2019-12-07 14:56:26,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:56:26,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 878 [2019-12-07 14:56:26,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:56:26,947 INFO L225 Difference]: With dead ends: 75265 [2019-12-07 14:56:26,948 INFO L226 Difference]: Without dead ends: 39183 [2019-12-07 14:56:26,964 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-12-07 14:56:26,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39183 states. [2019-12-07 14:56:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39183 to 36101. [2019-12-07 14:56:27,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36101 states. [2019-12-07 14:56:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36101 states to 36101 states and 56161 transitions. [2019-12-07 14:56:27,905 INFO L78 Accepts]: Start accepts. Automaton has 36101 states and 56161 transitions. Word has length 878 [2019-12-07 14:56:27,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:56:27,905 INFO L462 AbstractCegarLoop]: Abstraction has 36101 states and 56161 transitions. [2019-12-07 14:56:27,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:56:27,905 INFO L276 IsEmpty]: Start isEmpty. Operand 36101 states and 56161 transitions. [2019-12-07 14:56:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2019-12-07 14:56:27,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:56:27,935 INFO L410 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 25, 25, 25, 25, 22, 22, 22, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 16, 15, 15, 14, 14, 13, 13, 8, 8, 7, 5, 5, 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, 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, 1, 1, 1, 1, 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-12-07 14:56:27,935 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:56:27,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:56:27,936 INFO L82 PathProgramCache]: Analyzing trace with hash 2076777139, now seen corresponding path program 1 times [2019-12-07 14:56:27,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:56:27,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823010858] [2019-12-07 14:56:27,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:56:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:56:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7557 backedges. 4030 proven. 153 refuted. 0 times theorem prover too weak. 3374 trivial. 0 not checked. [2019-12-07 14:56:28,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823010858] [2019-12-07 14:56:28,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781713134] [2019-12-07 14:56:28,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:56:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:56:28,785 INFO L264 TraceCheckSpWp]: Trace formula consists of 2846 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 14:56:28,793 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:56:28,803 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-12-07 14:56:28,803 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:28,810 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:28,810 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:56:28,811 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 14:56:28,862 INFO L343 Elim1Store]: treesize reduction 95, result has 56.6 percent of original size [2019-12-07 14:56:28,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 133 [2019-12-07 14:56:28,862 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:28,893 INFO L614 ElimStorePlain]: treesize reduction 46, result has 65.4 percent of original size [2019-12-07 14:56:28,896 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 9 treesize of output 3 [2019-12-07 14:56:28,896 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:28,898 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 21 treesize of output 15 [2019-12-07 14:56:28,899 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:56:28,901 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 9 treesize of output 3 [2019-12-07 14:56:28,901 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:28,910 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:28,912 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 13 treesize of output 7 [2019-12-07 14:56:28,912 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:28,912 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:56:28,913 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:28,913 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 14:56:28,913 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:28,916 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:28,916 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:56:28,917 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:74, output treesize:19 [2019-12-07 14:56:28,927 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:56:28,927 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-12-07 14:56:28,927 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:28,928 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:28,928 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:56:28,928 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:56:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7557 backedges. 4030 proven. 153 refuted. 0 times theorem prover too weak. 3374 trivial. 0 not checked. [2019-12-07 14:56:29,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:56:29,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-12-07 14:56:29,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607175784] [2019-12-07 14:56:29,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:56:29,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:56:29,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:56:29,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:56:29,317 INFO L87 Difference]: Start difference. First operand 36101 states and 56161 transitions. Second operand 8 states. [2019-12-07 14:56:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:56:31,333 INFO L93 Difference]: Finished difference Result 58475 states and 90783 transitions. [2019-12-07 14:56:31,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:56:31,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 896 [2019-12-07 14:56:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:56:31,362 INFO L225 Difference]: With dead ends: 58475 [2019-12-07 14:56:31,363 INFO L226 Difference]: Without dead ends: 39977 [2019-12-07 14:56:31,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 897 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:56:31,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39977 states. [2019-12-07 14:56:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39977 to 36101. [2019-12-07 14:56:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36101 states. [2019-12-07 14:56:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36101 states to 36101 states and 55857 transitions. [2019-12-07 14:56:32,331 INFO L78 Accepts]: Start accepts. Automaton has 36101 states and 55857 transitions. Word has length 896 [2019-12-07 14:56:32,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:56:32,331 INFO L462 AbstractCegarLoop]: Abstraction has 36101 states and 55857 transitions. [2019-12-07 14:56:32,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:56:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 36101 states and 55857 transitions. [2019-12-07 14:56:32,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2019-12-07 14:56:32,360 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:56:32,360 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 21, 21, 20, 20, 20, 20, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:56:32,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:56:32,561 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:56:32,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:56:32,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1616683975, now seen corresponding path program 1 times [2019-12-07 14:56:32,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:56:32,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114711043] [2019-12-07 14:56:32,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:56:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:56:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7968 backedges. 2509 proven. 275 refuted. 0 times theorem prover too weak. 5184 trivial. 0 not checked. [2019-12-07 14:56:35,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114711043] [2019-12-07 14:56:35,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599874840] [2019-12-07 14:56:35,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:56:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:56:35,480 INFO L264 TraceCheckSpWp]: Trace formula consists of 2810 conjuncts, 63 conjunts are in the unsatisfiable core [2019-12-07 14:56:35,493 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:56:35,501 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-12-07 14:56:35,501 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:35,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:35,503 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:56:35,503 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 14:56:35,511 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_164|], 12=[|v_#memory_$Pointer$.base_179|]} [2019-12-07 14:56:35,514 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:56:35,515 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 49 treesize of output 37 [2019-12-07 14:56:35,515 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:56:35,517 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:35,595 INFO L343 Elim1Store]: treesize reduction 46, result has 73.6 percent of original size [2019-12-07 14:56:35,595 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 143 [2019-12-07 14:56:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:35,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:35,681 INFO L534 ElimStorePlain]: Start of recursive call 3: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 31 xjuncts. [2019-12-07 14:56:36,565 WARN L192 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 110 [2019-12-07 14:56:36,565 INFO L614 ElimStorePlain]: treesize reduction 8879, result has 6.6 percent of original size [2019-12-07 14:56:36,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:36,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:36,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 28 dim-0 vars, and 15 xjuncts. [2019-12-07 14:56:36,569 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:546 [2019-12-07 14:56:49,415 WARN L192 SmtUtils]: Spent 12.77 s on a formula simplification. DAG size of input: 170 DAG size of output: 86 [2019-12-07 14:56:49,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 14:56:49,432 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_177|], 90=[|v_#memory_$Pointer$.base_180|]} [2019-12-07 14:56:49,435 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:56:49,438 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:56:49,442 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:56:49,446 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:56:49,451 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:56:49,456 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:56:49,708 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 14:56:49,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:49,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:49,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:49,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:49,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:49,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:49,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:49,901 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-12-07 14:56:49,901 INFO L343 Elim1Store]: treesize reduction 78, result has 70.8 percent of original size [2019-12-07 14:56:49,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 225 [2019-12-07 14:56:49,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:49,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:49,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:49,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:49,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:49,905 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:49,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:49,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:49,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:49,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:49,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:49,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:49,988 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 49 treesize of output 43 [2019-12-07 14:56:49,989 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:49,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,043 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 49 treesize of output 43 [2019-12-07 14:56:50,043 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:50,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,130 INFO L343 Elim1Store]: treesize reduction 39, result has 64.5 percent of original size [2019-12-07 14:56:50,131 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 104 [2019-12-07 14:56:50,131 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:50,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,201 INFO L343 Elim1Store]: treesize reduction 39, result has 58.5 percent of original size [2019-12-07 14:56:50,201 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 3 case distinctions, treesize of input 49 treesize of output 88 [2019-12-07 14:56:50,201 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:50,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:50,264 INFO L343 Elim1Store]: treesize reduction 39, result has 69.0 percent of original size [2019-12-07 14:56:50,264 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 124 [2019-12-07 14:56:50,265 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:50,680 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 116 [2019-12-07 14:56:50,680 INFO L614 ElimStorePlain]: treesize reduction 3331, result has 10.2 percent of original size [2019-12-07 14:56:50,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:50,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:50,683 INFO L534 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 7 xjuncts. [2019-12-07 14:56:50,683 INFO L239 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:424, output treesize:211 [2019-12-07 14:56:50,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:54,790 WARN L192 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 80 DAG size of output: 30 [2019-12-07 14:56:54,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:56:54,818 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_165|], 30=[|v_#memory_$Pointer$.base_181|]} [2019-12-07 14:56:54,822 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 19 treesize of output 1 [2019-12-07 14:56:54,823 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:54,827 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 19 treesize of output 1 [2019-12-07 14:56:54,827 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:54,832 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 19 treesize of output 1 [2019-12-07 14:56:54,832 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:54,836 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 19 treesize of output 1 [2019-12-07 14:56:54,836 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:54,864 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:54,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:54,871 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-12-07 14:56:54,872 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:54,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:54,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:54,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:54,914 INFO L343 Elim1Store]: treesize reduction 28, result has 65.9 percent of original size [2019-12-07 14:56:54,914 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 78 [2019-12-07 14:56:54,915 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:54,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:54,922 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-12-07 14:56:54,922 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:54,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:54,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:54,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:55,011 INFO L343 Elim1Store]: treesize reduction 56, result has 68.7 percent of original size [2019-12-07 14:56:55,011 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 7 case distinctions, treesize of input 47 treesize of output 150 [2019-12-07 14:56:55,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,014 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2019-12-07 14:56:55,108 INFO L614 ElimStorePlain]: treesize reduction 1587, result has 4.1 percent of original size [2019-12-07 14:56:55,108 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-12-07 14:56:55,109 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:223, output treesize:67 [2019-12-07 14:56:55,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:56:55,111 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_184|], 2=[|v_#memory_$Pointer$.offset_166|], 30=[|v_#memory_$Pointer$.base_182|]} [2019-12-07 14:56:55,117 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 31 treesize of output 21 [2019-12-07 14:56:55,117 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:55,123 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 31 treesize of output 21 [2019-12-07 14:56:55,123 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:55,128 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 31 treesize of output 21 [2019-12-07 14:56:55,128 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:55,134 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 31 treesize of output 21 [2019-12-07 14:56:55,134 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:56:55,183 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:55,203 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:55,204 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 146 [2019-12-07 14:56:55,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,205 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2019-12-07 14:56:55,229 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:55,229 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 146 [2019-12-07 14:56:55,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,230 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-12-07 14:56:55,253 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:55,254 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 126 [2019-12-07 14:56:55,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,254 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-12-07 14:56:55,273 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:55,274 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 146 [2019-12-07 14:56:55,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,275 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-12-07 14:56:55,413 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-12-07 14:56:55,413 INFO L614 ElimStorePlain]: treesize reduction 699, result has 36.7 percent of original size [2019-12-07 14:56:55,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:55,452 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:55,452 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 183 [2019-12-07 14:56:55,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,454 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2019-12-07 14:56:55,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:55,516 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:55,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 274 [2019-12-07 14:56:55,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,519 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2019-12-07 14:56:55,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:56:55,623 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:55,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 98 treesize of output 392 [2019-12-07 14:56:55,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:56:55,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,956 INFO L534 ElimStorePlain]: Start of recursive call 12: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 14:56:55,991 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:56:55,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 182 [2019-12-07 14:56:55,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:56:55,999 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimArr_2], 1=[v_arrayElimArr_1]} [2019-12-07 14:56:56,005 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@26aed3a2 [2019-12-07 14:56:56,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:56:56,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-12-07 14:56:56,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658464982] [2019-12-07 14:56:56,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 14:56:56,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:56:56,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 14:56:56,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-07 14:56:56,006 INFO L87 Difference]: Start difference. First operand 36101 states and 55857 transitions. Second operand 16 states. [2019-12-07 14:56:56,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 14:56:56,207 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:56:56,207 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@26aed3a2 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-07 14:56:56,210 INFO L168 Benchmark]: Toolchain (without parser) took 138928.53 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 940.8 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-12-07 14:56:56,210 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:56:56,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -112.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:56:56,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:56:56,211 INFO L168 Benchmark]: Boogie Preprocessor took 61.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:56:56,211 INFO L168 Benchmark]: RCFGBuilder took 644.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 937.0 MB in the end (delta: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:56:56,211 INFO L168 Benchmark]: TraceAbstraction took 137658.44 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 937.0 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-12-07 14:56:56,212 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 490.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -112.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 644.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 937.0 MB in the end (delta: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 137658.44 ms. Allocated memory was 1.1 GB in the beginning and 4.8 GB in the end (delta: 3.7 GB). Free memory was 937.0 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@26aed3a2 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@26aed3a2: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 14:56:57,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:56:57,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:56:57,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:56:57,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:56:57,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:56:57,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:56:57,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:56:57,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:56:57,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:56:57,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:56:57,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:56:57,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:56:57,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:56:57,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:56:57,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:56:57,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:56:57,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:56:57,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:56:57,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:56:57,685 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:56:57,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:56:57,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:56:57,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:56:57,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:56:57,689 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:56:57,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:56:57,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:56:57,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:56:57,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:56:57,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:56:57,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:56:57,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:56:57,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:56:57,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:56:57,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:56:57,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:56:57,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:56:57,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:56:57,695 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:56:57,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:56:57,696 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 14:56:57,706 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:56:57,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:56:57,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:56:57,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:56:57,707 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:56:57,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:56:57,708 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:56:57,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:56:57,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:56:57,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:56:57,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:56:57,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:56:57,709 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 14:56:57,709 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 14:56:57,709 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:56:57,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:56:57,709 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:56:57,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:56:57,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:56:57,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:56:57,710 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:56:57,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:56:57,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:56:57,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:56:57,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:56:57,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:56:57,711 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 14:56:57,711 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 14:56:57,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:56:57,711 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:56:57,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:56:57,711 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_27bd20e1-786a-40c7-9bea-05fb44e2fe40/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 -> cc19bcc101ef1dd198c78f620192eb69b4a92f44 [2019-12-07 14:56:57,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:56:57,879 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:56:57,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:56:57,882 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:56:57,882 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:56:57,883 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-2.c [2019-12-07 14:56:57,920 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/data/f990c83c4/e035d98d9aba45a69054e6c254466ea0/FLAGe0d768c6a [2019-12-07 14:56:58,406 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:56:58,406 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/sv-benchmarks/c/ssh/s3_srvr.blast.06.i.cil-2.c [2019-12-07 14:56:58,419 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/data/f990c83c4/e035d98d9aba45a69054e6c254466ea0/FLAGe0d768c6a [2019-12-07 14:56:58,696 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/data/f990c83c4/e035d98d9aba45a69054e6c254466ea0 [2019-12-07 14:56:58,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:56:58,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:56:58,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:56:58,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:56:58,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:56:58,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:56:58" (1/1) ... [2019-12-07 14:56:58,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48ce1753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:56:58, skipping insertion in model container [2019-12-07 14:56:58,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:56:58" (1/1) ... [2019-12-07 14:56:58,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:56:58,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:56:59,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:56:59,043 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:56:59,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:56:59,123 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:56:59,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:56:59 WrapperNode [2019-12-07 14:56:59,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:56:59,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:56:59,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:56:59,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:56:59,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:56:59" (1/1) ... [2019-12-07 14:56:59,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:56:59" (1/1) ... [2019-12-07 14:56:59,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:56:59,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:56:59,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:56:59,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:56:59,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:56:59" (1/1) ... [2019-12-07 14:56:59,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:56:59" (1/1) ... [2019-12-07 14:56:59,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:56:59" (1/1) ... [2019-12-07 14:56:59,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:56:59" (1/1) ... [2019-12-07 14:56:59,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:56:59" (1/1) ... [2019-12-07 14:56:59,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:56:59" (1/1) ... [2019-12-07 14:56:59,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:56:59" (1/1) ... [2019-12-07 14:56:59,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:56:59,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:56:59,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:56:59,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:56:59,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:56:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/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-12-07 14:56:59,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:56:59,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:56:59,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 14:56:59,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:56:59,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:56:59,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:56:59,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:56:59,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 14:56:59,436 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:57:01,661 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 14:57:01,661 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 14:57:01,662 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:57:01,662 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 14:57:01,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:57:01 BoogieIcfgContainer [2019-12-07 14:57:01,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:57:01,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:57:01,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:57:01,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:57:01,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:56:58" (1/3) ... [2019-12-07 14:57:01,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73eb03d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:57:01, skipping insertion in model container [2019-12-07 14:57:01,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:56:59" (2/3) ... [2019-12-07 14:57:01,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73eb03d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:57:01, skipping insertion in model container [2019-12-07 14:57:01,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:57:01" (3/3) ... [2019-12-07 14:57:01,668 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-2.c [2019-12-07 14:57:01,674 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:57:01,679 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:57:01,687 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:57:01,703 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:57:01,703 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:57:01,704 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:57:01,704 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:57:01,704 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:57:01,704 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:57:01,704 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:57:01,704 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:57:01,717 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-12-07 14:57:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 14:57:01,723 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:01,724 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, 1] [2019-12-07 14:57:01,724 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:01,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash -635828374, now seen corresponding path program 1 times [2019-12-07 14:57:01,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:57:01,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397305974] [2019-12-07 14:57:01,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 14:57:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:01,857 INFO L264 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:57:01,862 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:01,895 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:01,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397305974] [2019-12-07 14:57:01,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:01,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:57:01,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319829315] [2019-12-07 14:57:01,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:57:01,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:57:01,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:57:01,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:57:01,931 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2019-12-07 14:57:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:02,139 INFO L93 Difference]: Finished difference Result 608 states and 1053 transitions. [2019-12-07 14:57:02,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:57:02,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 14:57:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:02,153 INFO L225 Difference]: With dead ends: 608 [2019-12-07 14:57:02,153 INFO L226 Difference]: Without dead ends: 417 [2019-12-07 14:57:02,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 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-12-07 14:57:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-12-07 14:57:02,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2019-12-07 14:57:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-12-07 14:57:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 641 transitions. [2019-12-07 14:57:02,204 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 641 transitions. Word has length 45 [2019-12-07 14:57:02,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:02,205 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 641 transitions. [2019-12-07 14:57:02,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:57:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 641 transitions. [2019-12-07 14:57:02,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-07 14:57:02,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:02,210 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, 1] [2019-12-07 14:57:02,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 14:57:02,412 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:02,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:02,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1145622847, now seen corresponding path program 1 times [2019-12-07 14:57:02,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:57:02,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764174167] [2019-12-07 14:57:02,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 14:57:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:02,672 INFO L264 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:57:02,675 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:02,696 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:57:02,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764174167] [2019-12-07 14:57:02,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:02,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:57:02,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816478206] [2019-12-07 14:57:02,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:57:02,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:57:02,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:57:02,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:57:02,725 INFO L87 Difference]: Start difference. First operand 417 states and 641 transitions. Second operand 4 states. [2019-12-07 14:57:03,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:03,421 INFO L93 Difference]: Finished difference Result 958 states and 1503 transitions. [2019-12-07 14:57:03,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:57:03,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-12-07 14:57:03,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:03,426 INFO L225 Difference]: With dead ends: 958 [2019-12-07 14:57:03,427 INFO L226 Difference]: Without dead ends: 685 [2019-12-07 14:57:03,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 212 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-12-07 14:57:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-12-07 14:57:03,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2019-12-07 14:57:03,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-12-07 14:57:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1046 transitions. [2019-12-07 14:57:03,459 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1046 transitions. Word has length 108 [2019-12-07 14:57:03,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:03,459 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1046 transitions. [2019-12-07 14:57:03,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:57:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1046 transitions. [2019-12-07 14:57:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-07 14:57:03,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:03,463 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, 1] [2019-12-07 14:57:03,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 14:57:03,664 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:03,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1801355127, now seen corresponding path program 1 times [2019-12-07 14:57:03,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:57:03,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341846409] [2019-12-07 14:57:03,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 14:57:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:03,832 INFO L264 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:57:03,838 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 14:57:03,869 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 14:57:03,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341846409] [2019-12-07 14:57:03,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:03,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:57:03,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380602186] [2019-12-07 14:57:03,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:57:03,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:57:03,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:57:03,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:57:03,904 INFO L87 Difference]: Start difference. First operand 685 states and 1046 transitions. Second operand 4 states. [2019-12-07 14:57:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:04,467 INFO L93 Difference]: Finished difference Result 1497 states and 2316 transitions. [2019-12-07 14:57:04,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:57:04,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-12-07 14:57:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:04,472 INFO L225 Difference]: With dead ends: 1497 [2019-12-07 14:57:04,472 INFO L226 Difference]: Without dead ends: 956 [2019-12-07 14:57:04,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 344 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-12-07 14:57:04,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2019-12-07 14:57:04,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 956. [2019-12-07 14:57:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-12-07 14:57:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1454 transitions. [2019-12-07 14:57:04,495 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1454 transitions. Word has length 174 [2019-12-07 14:57:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:04,495 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 1454 transitions. [2019-12-07 14:57:04,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:57:04,495 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1454 transitions. [2019-12-07 14:57:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-12-07 14:57:04,498 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:04,498 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:57:04,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 14:57:04,699 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:04,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:04,700 INFO L82 PathProgramCache]: Analyzing trace with hash -859904317, now seen corresponding path program 1 times [2019-12-07 14:57:04,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:57:04,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070216697] [2019-12-07 14:57:04,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 14:57:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:04,950 INFO L264 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:57:04,956 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:05,001 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-07 14:57:05,001 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-07 14:57:05,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070216697] [2019-12-07 14:57:05,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:05,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:57:05,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071163527] [2019-12-07 14:57:05,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:57:05,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:57:05,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:57:05,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:57:05,079 INFO L87 Difference]: Start difference. First operand 956 states and 1454 transitions. Second operand 4 states. [2019-12-07 14:57:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:06,089 INFO L93 Difference]: Finished difference Result 2037 states and 3127 transitions. [2019-12-07 14:57:06,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:57:06,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-12-07 14:57:06,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:06,095 INFO L225 Difference]: With dead ends: 2037 [2019-12-07 14:57:06,095 INFO L226 Difference]: Without dead ends: 1225 [2019-12-07 14:57:06,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 476 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-12-07 14:57:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-12-07 14:57:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1225. [2019-12-07 14:57:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2019-12-07 14:57:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1857 transitions. [2019-12-07 14:57:06,123 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1857 transitions. Word has length 240 [2019-12-07 14:57:06,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:06,124 INFO L462 AbstractCegarLoop]: Abstraction has 1225 states and 1857 transitions. [2019-12-07 14:57:06,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:57:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1857 transitions. [2019-12-07 14:57:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-12-07 14:57:06,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:06,128 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:57:06,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 14:57:06,329 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:06,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:06,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1248575700, now seen corresponding path program 1 times [2019-12-07 14:57:06,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:57:06,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686936449] [2019-12-07 14:57:06,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 14:57:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:06,575 INFO L264 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:57:06,578 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-12-07 14:57:06,636 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-12-07 14:57:06,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686936449] [2019-12-07 14:57:06,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:06,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:57:06,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078262645] [2019-12-07 14:57:06,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:57:06,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:57:06,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:57:06,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:57:06,710 INFO L87 Difference]: Start difference. First operand 1225 states and 1857 transitions. Second operand 4 states. [2019-12-07 14:57:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:07,118 INFO L93 Difference]: Finished difference Result 2575 states and 3931 transitions. [2019-12-07 14:57:07,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:57:07,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-12-07 14:57:07,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:07,124 INFO L225 Difference]: With dead ends: 2575 [2019-12-07 14:57:07,125 INFO L226 Difference]: Without dead ends: 1494 [2019-12-07 14:57:07,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 624 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-12-07 14:57:07,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-12-07 14:57:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1494. [2019-12-07 14:57:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2019-12-07 14:57:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2258 transitions. [2019-12-07 14:57:07,171 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2258 transitions. Word has length 314 [2019-12-07 14:57:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:07,171 INFO L462 AbstractCegarLoop]: Abstraction has 1494 states and 2258 transitions. [2019-12-07 14:57:07,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:57:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2258 transitions. [2019-12-07 14:57:07,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-12-07 14:57:07,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:07,178 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 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, 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, 1, 1, 1, 1] [2019-12-07 14:57:07,378 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 14:57:07,379 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:07,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:07,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1936580360, now seen corresponding path program 1 times [2019-12-07 14:57:07,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:57:07,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283159928] [2019-12-07 14:57:07,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 14:57:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:07,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:57:07,781 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 727 proven. 0 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2019-12-07 14:57:07,862 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 727 proven. 0 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2019-12-07 14:57:07,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283159928] [2019-12-07 14:57:07,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:07,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:57:07,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324455605] [2019-12-07 14:57:07,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:57:07,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:57:07,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:57:07,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:57:07,955 INFO L87 Difference]: Start difference. First operand 1494 states and 2258 transitions. Second operand 4 states. [2019-12-07 14:57:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:08,441 INFO L93 Difference]: Finished difference Result 3111 states and 4728 transitions. [2019-12-07 14:57:08,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:57:08,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 388 [2019-12-07 14:57:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:08,450 INFO L225 Difference]: With dead ends: 3111 [2019-12-07 14:57:08,450 INFO L226 Difference]: Without dead ends: 1761 [2019-12-07 14:57:08,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 774 GetRequests, 772 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-12-07 14:57:08,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2019-12-07 14:57:08,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1761. [2019-12-07 14:57:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-12-07 14:57:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2655 transitions. [2019-12-07 14:57:08,496 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2655 transitions. Word has length 388 [2019-12-07 14:57:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:08,497 INFO L462 AbstractCegarLoop]: Abstraction has 1761 states and 2655 transitions. [2019-12-07 14:57:08,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:57:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2655 transitions. [2019-12-07 14:57:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-12-07 14:57:08,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:08,501 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 3, 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, 1, 1, 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-12-07 14:57:08,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 14:57:08,701 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:08,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:08,702 INFO L82 PathProgramCache]: Analyzing trace with hash 968373987, now seen corresponding path program 1 times [2019-12-07 14:57:08,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:57:08,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222765555] [2019-12-07 14:57:08,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 14:57:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:09,024 INFO L264 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:57:09,029 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:09,061 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-12-07 14:57:09,061 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:57:09,065 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:57:09,065 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:57:09,065 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:57:09,077 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 7 [2019-12-07 14:57:09,077 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:57:09,079 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:57:09,079 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:57:09,079 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:57:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 929 proven. 0 refuted. 0 times theorem prover too weak. 907 trivial. 0 not checked. [2019-12-07 14:57:09,191 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 929 proven. 0 refuted. 0 times theorem prover too weak. 907 trivial. 0 not checked. [2019-12-07 14:57:09,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222765555] [2019-12-07 14:57:09,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:09,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 14:57:09,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404007054] [2019-12-07 14:57:09,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:57:09,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:57:09,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:57:09,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:57:09,319 INFO L87 Difference]: Start difference. First operand 1761 states and 2655 transitions. Second operand 4 states. [2019-12-07 14:57:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:15,222 INFO L93 Difference]: Finished difference Result 3969 states and 5989 transitions. [2019-12-07 14:57:15,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:57:15,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 461 [2019-12-07 14:57:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:15,234 INFO L225 Difference]: With dead ends: 3969 [2019-12-07 14:57:15,234 INFO L226 Difference]: Without dead ends: 2216 [2019-12-07 14:57:15,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 918 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-12-07 14:57:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2019-12-07 14:57:15,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2013. [2019-12-07 14:57:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2013 states. [2019-12-07 14:57:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 3087 transitions. [2019-12-07 14:57:15,287 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 3087 transitions. Word has length 461 [2019-12-07 14:57:15,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:15,287 INFO L462 AbstractCegarLoop]: Abstraction has 2013 states and 3087 transitions. [2019-12-07 14:57:15,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:57:15,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 3087 transitions. [2019-12-07 14:57:15,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-12-07 14:57:15,291 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:15,291 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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-12-07 14:57:15,492 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 14:57:15,492 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:15,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:15,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1549390611, now seen corresponding path program 1 times [2019-12-07 14:57:15,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:57:15,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542275635] [2019-12-07 14:57:15,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 14:57:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:15,863 INFO L264 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:57:15,868 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:15,886 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:57:15,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:57:15,886 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:57:15,893 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:57:15,894 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:57:15,894 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:57:15,911 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:57:15,911 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-12-07 14:57:15,912 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:57:15,915 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:57:15,915 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:57:15,916 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:57:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 1013 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2019-12-07 14:57:16,069 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 1013 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2019-12-07 14:57:16,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542275635] [2019-12-07 14:57:16,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:16,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2019-12-07 14:57:16,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091628889] [2019-12-07 14:57:16,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:57:16,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:57:16,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:57:16,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:57:16,191 INFO L87 Difference]: Start difference. First operand 2013 states and 3087 transitions. Second operand 5 states. [2019-12-07 14:57:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:22,386 INFO L93 Difference]: Finished difference Result 5034 states and 7736 transitions. [2019-12-07 14:57:22,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:57:22,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 463 [2019-12-07 14:57:22,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:22,397 INFO L225 Difference]: With dead ends: 5034 [2019-12-07 14:57:22,398 INFO L226 Difference]: Without dead ends: 3029 [2019-12-07 14:57:22,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 925 GetRequests, 921 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:57:22,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2019-12-07 14:57:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 2433. [2019-12-07 14:57:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2433 states. [2019-12-07 14:57:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3855 transitions. [2019-12-07 14:57:22,449 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3855 transitions. Word has length 463 [2019-12-07 14:57:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:22,449 INFO L462 AbstractCegarLoop]: Abstraction has 2433 states and 3855 transitions. [2019-12-07 14:57:22,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:57:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3855 transitions. [2019-12-07 14:57:22,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2019-12-07 14:57:22,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:22,454 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-12-07 14:57:22,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 14:57:22,655 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:22,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:22,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1054802594, now seen corresponding path program 1 times [2019-12-07 14:57:22,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:57:22,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562555956] [2019-12-07 14:57:22,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 14:57:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:23,041 INFO L264 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:57:23,046 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:23,051 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-12-07 14:57:23,052 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:57:23,054 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:57:23,055 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:57:23,055 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:57:23,063 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 7 [2019-12-07 14:57:23,063 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:57:23,064 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:57:23,064 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:57:23,065 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:57:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 973 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:57:23,207 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 973 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:57:23,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562555956] [2019-12-07 14:57:23,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:23,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:57:23,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024082106] [2019-12-07 14:57:23,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:57:23,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:57:23,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:57:23,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:57:23,327 INFO L87 Difference]: Start difference. First operand 2433 states and 3855 transitions. Second operand 6 states. [2019-12-07 14:57:33,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:33,729 INFO L93 Difference]: Finished difference Result 6683 states and 10431 transitions. [2019-12-07 14:57:33,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:57:33,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 474 [2019-12-07 14:57:33,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:33,744 INFO L225 Difference]: With dead ends: 6683 [2019-12-07 14:57:33,744 INFO L226 Difference]: Without dead ends: 4258 [2019-12-07 14:57:33,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 942 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:57:33,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4258 states. [2019-12-07 14:57:33,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4258 to 2641. [2019-12-07 14:57:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2641 states. [2019-12-07 14:57:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 4169 transitions. [2019-12-07 14:57:33,803 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 4169 transitions. Word has length 474 [2019-12-07 14:57:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:33,804 INFO L462 AbstractCegarLoop]: Abstraction has 2641 states and 4169 transitions. [2019-12-07 14:57:33,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:57:33,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 4169 transitions. [2019-12-07 14:57:33,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-12-07 14:57:33,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:33,808 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:57:34,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 14:57:34,010 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:34,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:34,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1311858010, now seen corresponding path program 1 times [2019-12-07 14:57:34,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:57:34,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822138413] [2019-12-07 14:57:34,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 14:57:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:34,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:57:34,407 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:34,413 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-12-07 14:57:34,413 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:57:34,416 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:57:34,417 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:57:34,417 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:57:34,425 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 7 [2019-12-07 14:57:34,425 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:57:34,427 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:57:34,427 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:57:34,427 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:57:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:57:34,547 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:57:34,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822138413] [2019-12-07 14:57:34,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:34,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:57:34,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749750636] [2019-12-07 14:57:34,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:57:34,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:57:34,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:57:34,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:57:34,660 INFO L87 Difference]: Start difference. First operand 2641 states and 4169 transitions. Second operand 6 states. [2019-12-07 14:57:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:44,681 INFO L93 Difference]: Finished difference Result 7074 states and 11034 transitions. [2019-12-07 14:57:44,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:57:44,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 475 [2019-12-07 14:57:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:44,697 INFO L225 Difference]: With dead ends: 7074 [2019-12-07 14:57:44,697 INFO L226 Difference]: Without dead ends: 4441 [2019-12-07 14:57:44,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 944 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:57:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4441 states. [2019-12-07 14:57:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4441 to 2784. [2019-12-07 14:57:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2784 states. [2019-12-07 14:57:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4340 transitions. [2019-12-07 14:57:44,763 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4340 transitions. Word has length 475 [2019-12-07 14:57:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:44,763 INFO L462 AbstractCegarLoop]: Abstraction has 2784 states and 4340 transitions. [2019-12-07 14:57:44,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:57:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4340 transitions. [2019-12-07 14:57:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-12-07 14:57:44,767 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:44,767 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-12-07 14:57:44,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 14:57:44,981 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:44,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:44,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1699064859, now seen corresponding path program 1 times [2019-12-07 14:57:44,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:57:44,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978780916] [2019-12-07 14:57:44,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 14:57:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:45,362 INFO L264 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:57:45,367 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:45,372 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-12-07 14:57:45,372 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:57:45,375 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:57:45,376 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:57:45,376 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:57:45,383 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 7 [2019-12-07 14:57:45,383 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:57:45,384 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:57:45,385 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:57:45,385 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:57:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 986 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:57:45,488 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 986 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:57:45,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978780916] [2019-12-07 14:57:45,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:45,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:57:45,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083780827] [2019-12-07 14:57:45,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:57:45,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:57:45,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:57:45,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:57:45,605 INFO L87 Difference]: Start difference. First operand 2784 states and 4340 transitions. Second operand 6 states. [2019-12-07 14:57:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:57:55,453 INFO L93 Difference]: Finished difference Result 7193 states and 11131 transitions. [2019-12-07 14:57:55,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:57:55,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 475 [2019-12-07 14:57:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:57:55,470 INFO L225 Difference]: With dead ends: 7193 [2019-12-07 14:57:55,470 INFO L226 Difference]: Without dead ends: 4417 [2019-12-07 14:57:55,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 944 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:57:55,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4417 states. [2019-12-07 14:57:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4417 to 2862. [2019-12-07 14:57:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2862 states. [2019-12-07 14:57:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 4459 transitions. [2019-12-07 14:57:55,536 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 4459 transitions. Word has length 475 [2019-12-07 14:57:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:57:55,536 INFO L462 AbstractCegarLoop]: Abstraction has 2862 states and 4459 transitions. [2019-12-07 14:57:55,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:57:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 4459 transitions. [2019-12-07 14:57:55,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-12-07 14:57:55,540 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:57:55,541 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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-12-07 14:57:55,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 14:57:55,742 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:57:55,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:57:55,742 INFO L82 PathProgramCache]: Analyzing trace with hash -387560229, now seen corresponding path program 1 times [2019-12-07 14:57:55,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:57:55,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44493684] [2019-12-07 14:57:55,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 14:57:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:57:56,115 INFO L264 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:57:56,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:57:56,124 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-12-07 14:57:56,124 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:57:56,127 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:57:56,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:57:56,128 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:57:56,134 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 7 [2019-12-07 14:57:56,134 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:57:56,136 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:57:56,136 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:57:56,136 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:57:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 999 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:57:56,237 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:57:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 999 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:57:56,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44493684] [2019-12-07 14:57:56,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:57:56,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:57:56,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864115635] [2019-12-07 14:57:56,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:57:56,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:57:56,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:57:56,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:57:56,365 INFO L87 Difference]: Start difference. First operand 2862 states and 4459 transitions. Second operand 6 states. [2019-12-07 14:58:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:58:01,158 INFO L93 Difference]: Finished difference Result 7246 states and 11188 transitions. [2019-12-07 14:58:01,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:58:01,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 475 [2019-12-07 14:58:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:58:01,165 INFO L225 Difference]: With dead ends: 7246 [2019-12-07 14:58:01,165 INFO L226 Difference]: Without dead ends: 4392 [2019-12-07 14:58:01,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 944 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:58:01,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4392 states. [2019-12-07 14:58:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4392 to 2875. [2019-12-07 14:58:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2875 states. [2019-12-07 14:58:01,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 4448 transitions. [2019-12-07 14:58:01,234 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 4448 transitions. Word has length 475 [2019-12-07 14:58:01,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:58:01,234 INFO L462 AbstractCegarLoop]: Abstraction has 2875 states and 4448 transitions. [2019-12-07 14:58:01,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:58:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 4448 transitions. [2019-12-07 14:58:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-12-07 14:58:01,238 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:58:01,238 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:58:01,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 14:58:01,440 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:58:01,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:58:01,440 INFO L82 PathProgramCache]: Analyzing trace with hash 130004882, now seen corresponding path program 1 times [2019-12-07 14:58:01,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:58:01,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737388128] [2019-12-07 14:58:01,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 14:58:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:58:01,816 INFO L264 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:58:01,820 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:58:01,825 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-12-07 14:58:01,825 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:01,827 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:01,828 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:01,828 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:58:01,834 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 7 [2019-12-07 14:58:01,835 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:01,836 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:01,836 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:01,836 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:58:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1924 backedges. 921 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:58:01,934 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:58:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1924 backedges. 921 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:58:02,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737388128] [2019-12-07 14:58:02,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:58:02,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:58:02,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334299760] [2019-12-07 14:58:02,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:58:02,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:58:02,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:58:02,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:58:02,060 INFO L87 Difference]: Start difference. First operand 2875 states and 4448 transitions. Second operand 6 states. [2019-12-07 14:58:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:58:10,074 INFO L93 Difference]: Finished difference Result 7259 states and 11140 transitions. [2019-12-07 14:58:10,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:58:10,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 475 [2019-12-07 14:58:10,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:58:10,081 INFO L225 Difference]: With dead ends: 7259 [2019-12-07 14:58:10,081 INFO L226 Difference]: Without dead ends: 4392 [2019-12-07 14:58:10,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 944 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:58:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4392 states. [2019-12-07 14:58:10,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4392 to 2875. [2019-12-07 14:58:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2875 states. [2019-12-07 14:58:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 4398 transitions. [2019-12-07 14:58:10,150 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 4398 transitions. Word has length 475 [2019-12-07 14:58:10,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:58:10,151 INFO L462 AbstractCegarLoop]: Abstraction has 2875 states and 4398 transitions. [2019-12-07 14:58:10,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:58:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 4398 transitions. [2019-12-07 14:58:10,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-12-07 14:58:10,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:58:10,155 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:58:10,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 14:58:10,356 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:58:10,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:58:10,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1142812281, now seen corresponding path program 1 times [2019-12-07 14:58:10,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:58:10,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645453342] [2019-12-07 14:58:10,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 14:58:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:58:10,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:58:10,779 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:58:10,784 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-12-07 14:58:10,784 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:10,786 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:10,786 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:10,787 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:58:10,794 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 7 [2019-12-07 14:58:10,794 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:10,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:10,795 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:10,796 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:58:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1937 backedges. 934 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:58:10,906 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:58:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1937 backedges. 934 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:58:11,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645453342] [2019-12-07 14:58:11,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:58:11,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:58:11,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289402251] [2019-12-07 14:58:11,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:58:11,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:58:11,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:58:11,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:58:11,018 INFO L87 Difference]: Start difference. First operand 2875 states and 4398 transitions. Second operand 6 states. [2019-12-07 14:58:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:58:18,272 INFO L93 Difference]: Finished difference Result 7259 states and 11040 transitions. [2019-12-07 14:58:18,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:58:18,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 476 [2019-12-07 14:58:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:58:18,278 INFO L225 Difference]: With dead ends: 7259 [2019-12-07 14:58:18,278 INFO L226 Difference]: Without dead ends: 4392 [2019-12-07 14:58:18,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 952 GetRequests, 946 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:58:18,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4392 states. [2019-12-07 14:58:18,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4392 to 2875. [2019-12-07 14:58:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2875 states. [2019-12-07 14:58:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 4348 transitions. [2019-12-07 14:58:18,364 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 4348 transitions. Word has length 476 [2019-12-07 14:58:18,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:58:18,364 INFO L462 AbstractCegarLoop]: Abstraction has 2875 states and 4348 transitions. [2019-12-07 14:58:18,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:58:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 4348 transitions. [2019-12-07 14:58:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-12-07 14:58:18,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:58:18,369 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:58:18,569 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 14:58:18,570 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:58:18,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:58:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash -97079923, now seen corresponding path program 1 times [2019-12-07 14:58:18,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:58:18,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763283514] [2019-12-07 14:58:18,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 14:58:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:58:19,027 INFO L264 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:58:19,031 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:58:19,037 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-12-07 14:58:19,037 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:19,040 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:19,040 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:19,041 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:58:19,048 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 7 [2019-12-07 14:58:19,048 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:19,049 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:19,050 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:19,050 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:58:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 947 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:58:19,151 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:58:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 947 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:58:19,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763283514] [2019-12-07 14:58:19,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:58:19,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:58:19,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463930845] [2019-12-07 14:58:19,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:58:19,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:58:19,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:58:19,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:58:19,285 INFO L87 Difference]: Start difference. First operand 2875 states and 4348 transitions. Second operand 6 states. [2019-12-07 14:58:25,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:58:25,085 INFO L93 Difference]: Finished difference Result 7259 states and 10940 transitions. [2019-12-07 14:58:25,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:58:25,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 477 [2019-12-07 14:58:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:58:25,091 INFO L225 Difference]: With dead ends: 7259 [2019-12-07 14:58:25,091 INFO L226 Difference]: Without dead ends: 4392 [2019-12-07 14:58:25,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 954 GetRequests, 948 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:58:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4392 states. [2019-12-07 14:58:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4392 to 2875. [2019-12-07 14:58:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2875 states. [2019-12-07 14:58:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 4298 transitions. [2019-12-07 14:58:25,166 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 4298 transitions. Word has length 477 [2019-12-07 14:58:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:58:25,166 INFO L462 AbstractCegarLoop]: Abstraction has 2875 states and 4298 transitions. [2019-12-07 14:58:25,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:58:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 4298 transitions. [2019-12-07 14:58:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-12-07 14:58:25,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:58:25,170 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:58:25,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 14:58:25,372 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:58:25,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:58:25,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1843784212, now seen corresponding path program 1 times [2019-12-07 14:58:25,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:58:25,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800181174] [2019-12-07 14:58:25,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 14:58:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:58:25,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:58:25,720 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:58:25,726 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-12-07 14:58:25,726 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:25,729 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:25,729 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:25,729 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:58:25,736 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 7 [2019-12-07 14:58:25,736 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:25,737 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:25,738 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:25,738 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:58:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1963 backedges. 960 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:58:25,838 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:58:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1963 backedges. 960 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:58:25,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800181174] [2019-12-07 14:58:25,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:58:25,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:58:25,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816861719] [2019-12-07 14:58:25,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:58:25,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:58:25,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:58:25,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:58:25,961 INFO L87 Difference]: Start difference. First operand 2875 states and 4298 transitions. Second operand 6 states. [2019-12-07 14:58:31,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:58:31,219 INFO L93 Difference]: Finished difference Result 7009 states and 10515 transitions. [2019-12-07 14:58:31,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:58:31,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 478 [2019-12-07 14:58:31,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:58:31,224 INFO L225 Difference]: With dead ends: 7009 [2019-12-07 14:58:31,224 INFO L226 Difference]: Without dead ends: 4142 [2019-12-07 14:58:31,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 956 GetRequests, 950 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:58:31,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states. [2019-12-07 14:58:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 2875. [2019-12-07 14:58:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2875 states. [2019-12-07 14:58:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 4248 transitions. [2019-12-07 14:58:31,299 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 4248 transitions. Word has length 478 [2019-12-07 14:58:31,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:58:31,300 INFO L462 AbstractCegarLoop]: Abstraction has 2875 states and 4248 transitions. [2019-12-07 14:58:31,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:58:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 4248 transitions. [2019-12-07 14:58:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-12-07 14:58:31,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:58:31,304 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 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, 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-12-07 14:58:31,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 14:58:31,505 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:58:31,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:58:31,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1754367126, now seen corresponding path program 1 times [2019-12-07 14:58:31,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:58:31,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319955688] [2019-12-07 14:58:31,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 14:58:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:58:31,906 INFO L264 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:58:31,910 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:58:31,915 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-12-07 14:58:31,915 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:31,918 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:31,918 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:31,919 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:58:31,935 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 7 [2019-12-07 14:58:31,935 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:31,936 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:31,937 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:31,937 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:58:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2018 backedges. 1015 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:58:32,040 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:58:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2018 backedges. 1015 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:58:32,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319955688] [2019-12-07 14:58:32,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:58:32,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:58:32,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644318972] [2019-12-07 14:58:32,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:58:32,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:58:32,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:58:32,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:58:32,160 INFO L87 Difference]: Start difference. First operand 2875 states and 4248 transitions. Second operand 6 states. [2019-12-07 14:58:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:58:37,345 INFO L93 Difference]: Finished difference Result 7019 states and 10391 transitions. [2019-12-07 14:58:37,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:58:37,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 478 [2019-12-07 14:58:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:58:37,351 INFO L225 Difference]: With dead ends: 7019 [2019-12-07 14:58:37,351 INFO L226 Difference]: Without dead ends: 4376 [2019-12-07 14:58:37,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 956 GetRequests, 950 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:58:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4376 states. [2019-12-07 14:58:37,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4376 to 3122. [2019-12-07 14:58:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2019-12-07 14:58:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 4536 transitions. [2019-12-07 14:58:37,435 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 4536 transitions. Word has length 478 [2019-12-07 14:58:37,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:58:37,435 INFO L462 AbstractCegarLoop]: Abstraction has 3122 states and 4536 transitions. [2019-12-07 14:58:37,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:58:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 4536 transitions. [2019-12-07 14:58:37,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2019-12-07 14:58:37,439 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:58:37,439 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:58:37,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 14:58:37,641 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:58:37,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:58:37,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1785149342, now seen corresponding path program 1 times [2019-12-07 14:58:37,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:58:37,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553633552] [2019-12-07 14:58:37,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 14:58:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:58:38,026 INFO L264 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:58:38,029 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:58:38,034 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-12-07 14:58:38,034 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:38,036 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:38,037 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:38,037 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:58:38,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 19 treesize of output 7 [2019-12-07 14:58:38,043 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:38,045 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:38,045 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:38,045 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:58:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:58:38,159 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:58:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2019-12-07 14:58:38,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553633552] [2019-12-07 14:58:38,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:58:38,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:58:38,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928208122] [2019-12-07 14:58:38,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:58:38,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:58:38,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:58:38,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:58:38,281 INFO L87 Difference]: Start difference. First operand 3122 states and 4536 transitions. Second operand 6 states. [2019-12-07 14:58:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:58:43,073 INFO L93 Difference]: Finished difference Result 7258 states and 10632 transitions. [2019-12-07 14:58:43,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:58:43,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 479 [2019-12-07 14:58:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:58:43,077 INFO L225 Difference]: With dead ends: 7258 [2019-12-07 14:58:43,077 INFO L226 Difference]: Without dead ends: 4387 [2019-12-07 14:58:43,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 952 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:58:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4387 states. [2019-12-07 14:58:43,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4387 to 3146. [2019-12-07 14:58:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2019-12-07 14:58:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 4537 transitions. [2019-12-07 14:58:43,163 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 4537 transitions. Word has length 479 [2019-12-07 14:58:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:58:43,163 INFO L462 AbstractCegarLoop]: Abstraction has 3146 states and 4537 transitions. [2019-12-07 14:58:43,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:58:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 4537 transitions. [2019-12-07 14:58:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-12-07 14:58:43,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:58:43,176 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:58:43,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 14:58:43,378 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:58:43,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:58:43,379 INFO L82 PathProgramCache]: Analyzing trace with hash -280174459, now seen corresponding path program 1 times [2019-12-07 14:58:43,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:58:43,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292073880] [2019-12-07 14:58:43,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 14:58:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:58:43,766 INFO L264 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:58:43,769 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:58:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1235 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-12-07 14:58:43,887 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:58:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1235 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-12-07 14:58:44,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292073880] [2019-12-07 14:58:44,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:58:44,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:58:44,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744342804] [2019-12-07 14:58:44,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:58:44,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:58:44,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:58:44,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:58:44,021 INFO L87 Difference]: Start difference. First operand 3146 states and 4537 transitions. Second operand 4 states. [2019-12-07 14:58:44,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:58:44,660 INFO L93 Difference]: Finished difference Result 6480 states and 9370 transitions. [2019-12-07 14:58:44,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:58:44,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 480 [2019-12-07 14:58:44,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:58:44,663 INFO L225 Difference]: With dead ends: 6480 [2019-12-07 14:58:44,663 INFO L226 Difference]: Without dead ends: 3599 [2019-12-07 14:58:44,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 958 GetRequests, 956 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-12-07 14:58:44,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3599 states. [2019-12-07 14:58:44,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3599 to 3599. [2019-12-07 14:58:44,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3599 states. [2019-12-07 14:58:44,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3599 states to 3599 states and 5179 transitions. [2019-12-07 14:58:44,765 INFO L78 Accepts]: Start accepts. Automaton has 3599 states and 5179 transitions. Word has length 480 [2019-12-07 14:58:44,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:58:44,766 INFO L462 AbstractCegarLoop]: Abstraction has 3599 states and 5179 transitions. [2019-12-07 14:58:44,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:58:44,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3599 states and 5179 transitions. [2019-12-07 14:58:44,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-12-07 14:58:44,770 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:58:44,771 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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-12-07 14:58:44,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 14:58:44,972 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:58:44,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:58:44,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1684045706, now seen corresponding path program 1 times [2019-12-07 14:58:44,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:58:44,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923977558] [2019-12-07 14:58:44,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 14:58:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:58:45,370 INFO L264 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:58:45,374 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:58:45,394 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:58:45,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:58:45,395 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:45,403 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:45,403 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:45,403 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:58:45,420 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:58:45,420 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-12-07 14:58:45,421 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:45,422 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:45,422 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:45,422 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:58:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2439 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 14:58:45,573 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:58:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2439 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 14:58:45,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923977558] [2019-12-07 14:58:45,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:58:45,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:58:45,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072615198] [2019-12-07 14:58:45,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:58:45,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:58:45,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:58:45,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:58:45,722 INFO L87 Difference]: Start difference. First operand 3599 states and 5179 transitions. Second operand 6 states. [2019-12-07 14:58:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:58:56,671 INFO L93 Difference]: Finished difference Result 8783 states and 12757 transitions. [2019-12-07 14:58:56,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:58:56,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 526 [2019-12-07 14:58:56,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:58:56,676 INFO L225 Difference]: With dead ends: 8783 [2019-12-07 14:58:56,676 INFO L226 Difference]: Without dead ends: 5447 [2019-12-07 14:58:56,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1052 GetRequests, 1046 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:58:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5447 states. [2019-12-07 14:58:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5447 to 3644. [2019-12-07 14:58:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3644 states. [2019-12-07 14:58:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 3644 states and 5241 transitions. [2019-12-07 14:58:56,779 INFO L78 Accepts]: Start accepts. Automaton has 3644 states and 5241 transitions. Word has length 526 [2019-12-07 14:58:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:58:56,779 INFO L462 AbstractCegarLoop]: Abstraction has 3644 states and 5241 transitions. [2019-12-07 14:58:56,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:58:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3644 states and 5241 transitions. [2019-12-07 14:58:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2019-12-07 14:58:56,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:58:56,784 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:58:56,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 14:58:56,986 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:58:56,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:58:56,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1532910563, now seen corresponding path program 1 times [2019-12-07 14:58:56,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:58:56,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375184155] [2019-12-07 14:58:56,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 14:58:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:58:57,363 INFO L264 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:58:57,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:58:57,382 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:58:57,383 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:58:57,383 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:57,391 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:57,391 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:57,391 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:58:57,406 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:58:57,406 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-12-07 14:58:57,406 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:58:57,408 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:58:57,408 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:58:57,408 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:58:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2454 backedges. 1189 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 14:58:57,556 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:58:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2454 backedges. 1189 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 14:58:57,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375184155] [2019-12-07 14:58:57,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:58:57,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:58:57,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650320151] [2019-12-07 14:58:57,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:58:57,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:58:57,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:58:57,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:58:57,715 INFO L87 Difference]: Start difference. First operand 3644 states and 5241 transitions. Second operand 6 states. [2019-12-07 14:59:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:10,704 INFO L93 Difference]: Finished difference Result 9366 states and 13499 transitions. [2019-12-07 14:59:10,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:59:10,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 529 [2019-12-07 14:59:10,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:10,711 INFO L225 Difference]: With dead ends: 9366 [2019-12-07 14:59:10,711 INFO L226 Difference]: Without dead ends: 5741 [2019-12-07 14:59:10,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 1052 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:59:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5741 states. [2019-12-07 14:59:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5741 to 3953. [2019-12-07 14:59:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3953 states. [2019-12-07 14:59:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3953 states to 3953 states and 5607 transitions. [2019-12-07 14:59:10,825 INFO L78 Accepts]: Start accepts. Automaton has 3953 states and 5607 transitions. Word has length 529 [2019-12-07 14:59:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:10,825 INFO L462 AbstractCegarLoop]: Abstraction has 3953 states and 5607 transitions. [2019-12-07 14:59:10,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:59:10,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3953 states and 5607 transitions. [2019-12-07 14:59:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2019-12-07 14:59:10,830 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:10,831 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:59:11,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 14:59:11,031 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:59:11,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:11,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1666832073, now seen corresponding path program 1 times [2019-12-07 14:59:11,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:59:11,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241073426] [2019-12-07 14:59:11,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:11,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:59:11,407 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:11,422 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:59:11,422 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:59:11,422 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:11,428 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:11,429 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:11,429 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:59:11,443 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:59:11,443 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-12-07 14:59:11,443 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:11,445 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:11,445 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:11,445 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:59:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 1211 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 14:59:11,598 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2476 backedges. 1211 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 14:59:11,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241073426] [2019-12-07 14:59:11,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:11,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:59:11,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499320701] [2019-12-07 14:59:11,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:59:11,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:59:11,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:59:11,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:59:11,748 INFO L87 Difference]: Start difference. First operand 3953 states and 5607 transitions. Second operand 6 states. [2019-12-07 14:59:21,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:21,018 INFO L93 Difference]: Finished difference Result 10011 states and 14257 transitions. [2019-12-07 14:59:21,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:59:21,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 529 [2019-12-07 14:59:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:21,025 INFO L225 Difference]: With dead ends: 10011 [2019-12-07 14:59:21,025 INFO L226 Difference]: Without dead ends: 6077 [2019-12-07 14:59:21,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 1052 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:59:21,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6077 states. [2019-12-07 14:59:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6077 to 4319. [2019-12-07 14:59:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4319 states. [2019-12-07 14:59:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4319 states to 4319 states and 6059 transitions. [2019-12-07 14:59:21,151 INFO L78 Accepts]: Start accepts. Automaton has 4319 states and 6059 transitions. Word has length 529 [2019-12-07 14:59:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:21,151 INFO L462 AbstractCegarLoop]: Abstraction has 4319 states and 6059 transitions. [2019-12-07 14:59:21,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:59:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4319 states and 6059 transitions. [2019-12-07 14:59:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2019-12-07 14:59:21,156 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:21,156 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 14:59:21,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 14:59:21,357 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:59:21,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:21,358 INFO L82 PathProgramCache]: Analyzing trace with hash 812820056, now seen corresponding path program 1 times [2019-12-07 14:59:21,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:59:21,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913550893] [2019-12-07 14:59:21,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:21,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:59:21,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:21,799 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:59:21,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:59:21,800 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:21,808 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:21,808 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:21,808 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:59:21,824 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:59:21,824 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-12-07 14:59:21,824 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:21,825 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:21,825 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:21,825 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:59:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 1201 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 14:59:21,982 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2466 backedges. 1201 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 14:59:22,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913550893] [2019-12-07 14:59:22,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:22,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:59:22,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836420065] [2019-12-07 14:59:22,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:59:22,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:59:22,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:59:22,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:59:22,126 INFO L87 Difference]: Start difference. First operand 4319 states and 6059 transitions. Second operand 6 states. [2019-12-07 14:59:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:30,363 INFO L93 Difference]: Finished difference Result 10351 states and 14662 transitions. [2019-12-07 14:59:30,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:59:30,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 530 [2019-12-07 14:59:30,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:30,368 INFO L225 Difference]: With dead ends: 10351 [2019-12-07 14:59:30,368 INFO L226 Difference]: Without dead ends: 6051 [2019-12-07 14:59:30,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1060 GetRequests, 1054 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:59:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2019-12-07 14:59:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 4333. [2019-12-07 14:59:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4333 states. [2019-12-07 14:59:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4333 states to 4333 states and 6045 transitions. [2019-12-07 14:59:30,496 INFO L78 Accepts]: Start accepts. Automaton has 4333 states and 6045 transitions. Word has length 530 [2019-12-07 14:59:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:30,497 INFO L462 AbstractCegarLoop]: Abstraction has 4333 states and 6045 transitions. [2019-12-07 14:59:30,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:59:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4333 states and 6045 transitions. [2019-12-07 14:59:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2019-12-07 14:59:30,502 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:30,502 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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-12-07 14:59:30,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 14:59:30,704 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:59:30,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:30,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1789835020, now seen corresponding path program 1 times [2019-12-07 14:59:30,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:59:30,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66012478] [2019-12-07 14:59:30,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:31,103 INFO L264 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:59:31,107 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:31,122 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:59:31,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:59:31,123 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:31,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:31,130 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:31,130 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:59:31,145 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:59:31,146 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-12-07 14:59:31,146 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:31,147 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:31,147 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:31,147 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:59:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2487 backedges. 1222 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 14:59:31,304 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2487 backedges. 1222 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 14:59:31,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66012478] [2019-12-07 14:59:31,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:31,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:59:31,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607712910] [2019-12-07 14:59:31,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:59:31,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:59:31,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:59:31,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:59:31,450 INFO L87 Difference]: Start difference. First operand 4333 states and 6045 transitions. Second operand 6 states. [2019-12-07 14:59:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:43,523 INFO L93 Difference]: Finished difference Result 10296 states and 14515 transitions. [2019-12-07 14:59:43,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:59:43,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 530 [2019-12-07 14:59:43,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:43,528 INFO L225 Difference]: With dead ends: 10296 [2019-12-07 14:59:43,528 INFO L226 Difference]: Without dead ends: 5982 [2019-12-07 14:59:43,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1060 GetRequests, 1054 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:59:43,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2019-12-07 14:59:43,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 4362. [2019-12-07 14:59:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4362 states. [2019-12-07 14:59:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4362 states to 4362 states and 6075 transitions. [2019-12-07 14:59:43,661 INFO L78 Accepts]: Start accepts. Automaton has 4362 states and 6075 transitions. Word has length 530 [2019-12-07 14:59:43,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:43,662 INFO L462 AbstractCegarLoop]: Abstraction has 4362 states and 6075 transitions. [2019-12-07 14:59:43,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:59:43,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4362 states and 6075 transitions. [2019-12-07 14:59:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-12-07 14:59:43,667 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:43,667 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 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-12-07 14:59:43,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 14:59:43,868 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:59:43,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:43,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1117196396, now seen corresponding path program 1 times [2019-12-07 14:59:43,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:59:43,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377205745] [2019-12-07 14:59:43,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:44,266 INFO L264 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:59:44,270 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:44,286 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:59:44,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:59:44,286 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:44,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:44,295 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:44,296 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:59:44,310 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:59:44,311 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-12-07 14:59:44,311 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:44,312 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:44,312 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:44,312 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:59:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2517 backedges. 1252 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 14:59:44,476 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2517 backedges. 1252 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 14:59:44,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377205745] [2019-12-07 14:59:44,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:44,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:59:44,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31108789] [2019-12-07 14:59:44,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:59:44,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:59:44,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:59:44,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:59:44,637 INFO L87 Difference]: Start difference. First operand 4362 states and 6075 transitions. Second operand 6 states. [2019-12-07 14:59:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:59:52,260 INFO L93 Difference]: Finished difference Result 10700 states and 14967 transitions. [2019-12-07 14:59:52,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:59:52,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 532 [2019-12-07 14:59:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:59:52,265 INFO L225 Difference]: With dead ends: 10700 [2019-12-07 14:59:52,265 INFO L226 Difference]: Without dead ends: 6357 [2019-12-07 14:59:52,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1064 GetRequests, 1058 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:59:52,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6357 states. [2019-12-07 14:59:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6357 to 4782. [2019-12-07 14:59:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4782 states. [2019-12-07 14:59:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4782 states to 4782 states and 6587 transitions. [2019-12-07 14:59:52,409 INFO L78 Accepts]: Start accepts. Automaton has 4782 states and 6587 transitions. Word has length 532 [2019-12-07 14:59:52,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:59:52,409 INFO L462 AbstractCegarLoop]: Abstraction has 4782 states and 6587 transitions. [2019-12-07 14:59:52,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:59:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 4782 states and 6587 transitions. [2019-12-07 14:59:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-12-07 14:59:52,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:59:52,413 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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-12-07 14:59:52,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 14:59:52,614 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:59:52,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:59:52,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1067106869, now seen corresponding path program 1 times [2019-12-07 14:59:52,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:59:52,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282722779] [2019-12-07 14:59:52,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 14:59:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:59:52,984 INFO L264 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:59:52,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:59:53,006 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:59:53,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 14:59:53,006 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:53,015 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:53,016 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:53,016 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 14:59:53,030 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:59:53,030 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-12-07 14:59:53,031 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:59:53,031 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:59:53,032 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:59:53,032 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 14:59:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2526 backedges. 1261 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 14:59:53,195 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:59:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2526 backedges. 1261 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 14:59:53,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282722779] [2019-12-07 14:59:53,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:59:53,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:59:53,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519041217] [2019-12-07 14:59:53,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:59:53,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:59:53,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:59:53,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:59:53,357 INFO L87 Difference]: Start difference. First operand 4782 states and 6587 transitions. Second operand 6 states. [2019-12-07 15:00:01,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:01,812 INFO L93 Difference]: Finished difference Result 11061 states and 15372 transitions. [2019-12-07 15:00:01,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:00:01,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 533 [2019-12-07 15:00:01,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:01,816 INFO L225 Difference]: With dead ends: 11061 [2019-12-07 15:00:01,816 INFO L226 Difference]: Without dead ends: 6298 [2019-12-07 15:00:01,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1066 GetRequests, 1060 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:00:01,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6298 states. [2019-12-07 15:00:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6298 to 4842. [2019-12-07 15:00:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4842 states. [2019-12-07 15:00:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4842 states to 4842 states and 6679 transitions. [2019-12-07 15:00:01,966 INFO L78 Accepts]: Start accepts. Automaton has 4842 states and 6679 transitions. Word has length 533 [2019-12-07 15:00:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:01,966 INFO L462 AbstractCegarLoop]: Abstraction has 4842 states and 6679 transitions. [2019-12-07 15:00:01,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:00:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4842 states and 6679 transitions. [2019-12-07 15:00:01,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2019-12-07 15:00:01,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:01,970 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 15:00:02,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 15:00:02,171 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:02,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:02,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1895403980, now seen corresponding path program 1 times [2019-12-07 15:00:02,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:00:02,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780093233] [2019-12-07 15:00:02,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 15:00:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:02,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 15:00:02,556 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:00:02,571 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 15:00:02,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 15:00:02,571 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:00:02,578 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:00:02,578 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:00:02,578 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 15:00:02,591 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 15:00:02,592 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-12-07 15:00:02,592 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:00:02,593 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:00:02,593 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:00:02,593 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 15:00:02,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2533 backedges. 1268 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 15:00:02,749 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:00:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2533 backedges. 1268 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 15:00:02,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780093233] [2019-12-07 15:00:02,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:02,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 15:00:02,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087915120] [2019-12-07 15:00:02,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:00:02,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:00:02,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:00:02,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:00:02,914 INFO L87 Difference]: Start difference. First operand 4842 states and 6679 transitions. Second operand 6 states. [2019-12-07 15:00:12,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:12,613 INFO L93 Difference]: Finished difference Result 11556 states and 15976 transitions. [2019-12-07 15:00:12,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:00:12,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 534 [2019-12-07 15:00:12,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:12,619 INFO L225 Difference]: With dead ends: 11556 [2019-12-07 15:00:12,619 INFO L226 Difference]: Without dead ends: 6733 [2019-12-07 15:00:12,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1068 GetRequests, 1062 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:00:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6733 states. [2019-12-07 15:00:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6733 to 5292. [2019-12-07 15:00:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5292 states. [2019-12-07 15:00:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 7221 transitions. [2019-12-07 15:00:12,783 INFO L78 Accepts]: Start accepts. Automaton has 5292 states and 7221 transitions. Word has length 534 [2019-12-07 15:00:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:12,783 INFO L462 AbstractCegarLoop]: Abstraction has 5292 states and 7221 transitions. [2019-12-07 15:00:12,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:00:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 5292 states and 7221 transitions. [2019-12-07 15:00:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-12-07 15:00:12,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:12,787 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 15:00:12,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 15:00:12,988 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:12,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:12,989 INFO L82 PathProgramCache]: Analyzing trace with hash 875578624, now seen corresponding path program 1 times [2019-12-07 15:00:12,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:00:12,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17315839] [2019-12-07 15:00:12,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 15:00:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:13,378 INFO L264 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 15:00:13,382 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:00:13,398 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 15:00:13,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 15:00:13,398 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:00:13,405 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:00:13,405 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:00:13,405 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 15:00:13,419 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 15:00:13,419 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-12-07 15:00:13,419 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:00:13,421 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:00:13,421 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:00:13,421 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 15:00:13,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1235 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 15:00:13,571 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:00:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1235 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 15:00:13,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17315839] [2019-12-07 15:00:13,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:13,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 15:00:13,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570195674] [2019-12-07 15:00:13,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:00:13,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:00:13,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:00:13,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:00:13,731 INFO L87 Difference]: Start difference. First operand 5292 states and 7221 transitions. Second operand 6 states. [2019-12-07 15:00:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:22,998 INFO L93 Difference]: Finished difference Result 12471 states and 17075 transitions. [2019-12-07 15:00:22,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:00:22,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 535 [2019-12-07 15:00:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:23,003 INFO L225 Difference]: With dead ends: 12471 [2019-12-07 15:00:23,004 INFO L226 Difference]: Without dead ends: 7198 [2019-12-07 15:00:23,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1070 GetRequests, 1064 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:00:23,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7198 states. [2019-12-07 15:00:23,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7198 to 5682. [2019-12-07 15:00:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5682 states. [2019-12-07 15:00:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5682 states to 5682 states and 7643 transitions. [2019-12-07 15:00:23,176 INFO L78 Accepts]: Start accepts. Automaton has 5682 states and 7643 transitions. Word has length 535 [2019-12-07 15:00:23,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:23,176 INFO L462 AbstractCegarLoop]: Abstraction has 5682 states and 7643 transitions. [2019-12-07 15:00:23,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:00:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 5682 states and 7643 transitions. [2019-12-07 15:00:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-12-07 15:00:23,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:23,183 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 15:00:23,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 15:00:23,384 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:23,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:23,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1000195573, now seen corresponding path program 1 times [2019-12-07 15:00:23,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:00:23,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023927549] [2019-12-07 15:00:23,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 15:00:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:23,776 INFO L264 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 15:00:23,780 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:00:23,794 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 15:00:23,794 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 15:00:23,794 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:00:23,801 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:00:23,801 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:00:23,801 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 15:00:23,815 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 15:00:23,815 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-12-07 15:00:23,815 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:00:23,816 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:00:23,816 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:00:23,817 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 15:00:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 1277 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 15:00:23,974 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:00:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 1277 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 15:00:24,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023927549] [2019-12-07 15:00:24,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:24,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 15:00:24,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819973742] [2019-12-07 15:00:24,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:00:24,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:00:24,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:00:24,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:00:24,138 INFO L87 Difference]: Start difference. First operand 5682 states and 7643 transitions. Second operand 6 states. [2019-12-07 15:00:32,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:32,675 INFO L93 Difference]: Finished difference Result 12775 states and 17338 transitions. [2019-12-07 15:00:32,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:00:32,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 535 [2019-12-07 15:00:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:32,686 INFO L225 Difference]: With dead ends: 12775 [2019-12-07 15:00:32,686 INFO L226 Difference]: Without dead ends: 7112 [2019-12-07 15:00:32,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1070 GetRequests, 1064 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:00:32,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7112 states. [2019-12-07 15:00:32,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7112 to 5712. [2019-12-07 15:00:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5712 states. [2019-12-07 15:00:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5712 states to 5712 states and 7675 transitions. [2019-12-07 15:00:32,875 INFO L78 Accepts]: Start accepts. Automaton has 5712 states and 7675 transitions. Word has length 535 [2019-12-07 15:00:32,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:32,876 INFO L462 AbstractCegarLoop]: Abstraction has 5712 states and 7675 transitions. [2019-12-07 15:00:32,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:00:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5712 states and 7675 transitions. [2019-12-07 15:00:32,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-12-07 15:00:32,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:32,880 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 15:00:33,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-12-07 15:00:33,081 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:33,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:33,082 INFO L82 PathProgramCache]: Analyzing trace with hash 942499639, now seen corresponding path program 1 times [2019-12-07 15:00:33,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:00:33,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91864809] [2019-12-07 15:00:33,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2019-12-07 15:00:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:33,496 INFO L264 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 15:00:33,500 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:00:33,515 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 15:00:33,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 15:00:33,516 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:00:33,523 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:00:33,523 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:00:33,523 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 15:00:33,537 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 15:00:33,537 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-12-07 15:00:33,537 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:00:33,538 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:00:33,539 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:00:33,539 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 15:00:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 1245 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 15:00:33,690 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:00:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 1245 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 15:00:33,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91864809] [2019-12-07 15:00:33,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:33,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 15:00:33,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404903587] [2019-12-07 15:00:33,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:00:33,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:00:33,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:00:33,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:00:33,856 INFO L87 Difference]: Start difference. First operand 5712 states and 7675 transitions. Second operand 6 states. [2019-12-07 15:00:43,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:43,435 INFO L93 Difference]: Finished difference Result 12779 states and 17303 transitions. [2019-12-07 15:00:43,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:00:43,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 536 [2019-12-07 15:00:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:43,447 INFO L225 Difference]: With dead ends: 12779 [2019-12-07 15:00:43,447 INFO L226 Difference]: Without dead ends: 7086 [2019-12-07 15:00:43,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1072 GetRequests, 1066 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:00:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7086 states. [2019-12-07 15:00:43,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7086 to 5712. [2019-12-07 15:00:43,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5712 states. [2019-12-07 15:00:43,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5712 states to 5712 states and 7617 transitions. [2019-12-07 15:00:43,646 INFO L78 Accepts]: Start accepts. Automaton has 5712 states and 7617 transitions. Word has length 536 [2019-12-07 15:00:43,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:43,646 INFO L462 AbstractCegarLoop]: Abstraction has 5712 states and 7617 transitions. [2019-12-07 15:00:43,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:00:43,646 INFO L276 IsEmpty]: Start isEmpty. Operand 5712 states and 7617 transitions. [2019-12-07 15:00:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-12-07 15:00:43,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:43,650 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 15:00:43,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2019-12-07 15:00:43,852 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:43,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:43,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1914604846, now seen corresponding path program 1 times [2019-12-07 15:00:43,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:00:43,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075613713] [2019-12-07 15:00:43,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 15:00:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:44,270 INFO L264 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 15:00:44,274 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:00:44,289 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 15:00:44,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 15:00:44,289 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:00:44,297 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:00:44,297 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:00:44,298 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 15:00:44,312 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 15:00:44,312 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-12-07 15:00:44,313 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:00:44,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:00:44,314 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:00:44,314 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 15:00:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 1286 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 15:00:44,488 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:00:44,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2551 backedges. 1286 proven. 0 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2019-12-07 15:00:44,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075613713] [2019-12-07 15:00:44,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:44,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 15:00:44,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254396591] [2019-12-07 15:00:44,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:00:44,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:00:44,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:00:44,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:00:44,646 INFO L87 Difference]: Start difference. First operand 5712 states and 7617 transitions. Second operand 6 states. [2019-12-07 15:00:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:53,372 INFO L93 Difference]: Finished difference Result 13160 states and 17615 transitions. [2019-12-07 15:00:53,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:00:53,379 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 536 [2019-12-07 15:00:53,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:53,384 INFO L225 Difference]: With dead ends: 13160 [2019-12-07 15:00:53,384 INFO L226 Difference]: Without dead ends: 7467 [2019-12-07 15:00:53,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1072 GetRequests, 1066 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:00:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2019-12-07 15:00:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 6192. [2019-12-07 15:00:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6192 states. [2019-12-07 15:00:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6192 states to 6192 states and 8159 transitions. [2019-12-07 15:00:53,578 INFO L78 Accepts]: Start accepts. Automaton has 6192 states and 8159 transitions. Word has length 536 [2019-12-07 15:00:53,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:53,578 INFO L462 AbstractCegarLoop]: Abstraction has 6192 states and 8159 transitions. [2019-12-07 15:00:53,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:00:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 6192 states and 8159 transitions. [2019-12-07 15:00:53,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2019-12-07 15:00:53,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:53,583 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 5, 5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 15:00:53,784 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2019-12-07 15:00:53,784 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:53,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:53,785 INFO L82 PathProgramCache]: Analyzing trace with hash -59306467, now seen corresponding path program 1 times [2019-12-07 15:00:53,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:00:53,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205932564] [2019-12-07 15:00:53,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2019-12-07 15:00:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:54,198 INFO L264 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:00:54,201 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:00:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 1448 proven. 0 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-12-07 15:00:54,357 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:00:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 1448 proven. 0 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-12-07 15:00:54,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205932564] [2019-12-07 15:00:54,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:54,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 15:00:54,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369204275] [2019-12-07 15:00:54,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:00:54,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:00:54,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:00:54,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:00:54,502 INFO L87 Difference]: Start difference. First operand 6192 states and 8159 transitions. Second operand 4 states. [2019-12-07 15:00:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:55,023 INFO L93 Difference]: Finished difference Result 12805 states and 16895 transitions. [2019-12-07 15:00:55,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:00:55,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 540 [2019-12-07 15:00:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:55,028 INFO L225 Difference]: With dead ends: 12805 [2019-12-07 15:00:55,028 INFO L226 Difference]: Without dead ends: 7032 [2019-12-07 15:00:55,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1078 GetRequests, 1076 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-12-07 15:00:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7032 states. [2019-12-07 15:00:55,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7032 to 7032. [2019-12-07 15:00:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7032 states. [2019-12-07 15:00:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7032 states to 7032 states and 9255 transitions. [2019-12-07 15:00:55,252 INFO L78 Accepts]: Start accepts. Automaton has 7032 states and 9255 transitions. Word has length 540 [2019-12-07 15:00:55,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:55,252 INFO L462 AbstractCegarLoop]: Abstraction has 7032 states and 9255 transitions. [2019-12-07 15:00:55,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:00:55,252 INFO L276 IsEmpty]: Start isEmpty. Operand 7032 states and 9255 transitions. [2019-12-07 15:00:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2019-12-07 15:00:55,257 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:55,258 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 15:00:55,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2019-12-07 15:00:55,459 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:55,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:55,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1680334423, now seen corresponding path program 1 times [2019-12-07 15:00:55,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:00:55,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686653359] [2019-12-07 15:00:55,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2019-12-07 15:00:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:55,854 INFO L264 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:00:55,858 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:00:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3019 backedges. 1460 proven. 0 refuted. 0 times theorem prover too weak. 1559 trivial. 0 not checked. [2019-12-07 15:00:56,031 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:00:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3019 backedges. 1460 proven. 0 refuted. 0 times theorem prover too weak. 1559 trivial. 0 not checked. [2019-12-07 15:00:56,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686653359] [2019-12-07 15:00:56,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:56,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 15:00:56,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277473825] [2019-12-07 15:00:56,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:00:56,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:00:56,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:00:56,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:00:56,199 INFO L87 Difference]: Start difference. First operand 7032 states and 9255 transitions. Second operand 3 states. [2019-12-07 15:00:57,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:57,011 INFO L93 Difference]: Finished difference Result 14067 states and 18529 transitions. [2019-12-07 15:00:57,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:00:57,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 582 [2019-12-07 15:00:57,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:57,016 INFO L225 Difference]: With dead ends: 14067 [2019-12-07 15:00:57,016 INFO L226 Difference]: Without dead ends: 7454 [2019-12-07 15:00:57,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1162 GetRequests, 1161 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-12-07 15:00:57,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7454 states. [2019-12-07 15:00:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7454 to 7454. [2019-12-07 15:00:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7454 states. [2019-12-07 15:00:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7454 states to 7454 states and 9802 transitions. [2019-12-07 15:00:57,278 INFO L78 Accepts]: Start accepts. Automaton has 7454 states and 9802 transitions. Word has length 582 [2019-12-07 15:00:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:00:57,278 INFO L462 AbstractCegarLoop]: Abstraction has 7454 states and 9802 transitions. [2019-12-07 15:00:57,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:00:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 7454 states and 9802 transitions. [2019-12-07 15:00:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2019-12-07 15:00:57,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:00:57,287 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 6, 6, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 15:00:57,487 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2019-12-07 15:00:57,488 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:00:57,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:00:57,488 INFO L82 PathProgramCache]: Analyzing trace with hash -438757346, now seen corresponding path program 1 times [2019-12-07 15:00:57,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:00:57,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813500566] [2019-12-07 15:00:57,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2019-12-07 15:00:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:00:57,946 INFO L264 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:00:57,950 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:00:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3456 backedges. 1919 proven. 0 refuted. 0 times theorem prover too weak. 1537 trivial. 0 not checked. [2019-12-07 15:00:58,124 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:00:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3456 backedges. 1919 proven. 0 refuted. 0 times theorem prover too weak. 1537 trivial. 0 not checked. [2019-12-07 15:00:58,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813500566] [2019-12-07 15:00:58,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:00:58,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 15:00:58,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884870958] [2019-12-07 15:00:58,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:00:58,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:00:58,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:00:58,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:00:58,327 INFO L87 Difference]: Start difference. First operand 7454 states and 9802 transitions. Second operand 4 states. [2019-12-07 15:00:59,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:00:59,737 INFO L93 Difference]: Finished difference Result 15324 states and 20173 transitions. [2019-12-07 15:00:59,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:00:59,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 617 [2019-12-07 15:00:59,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:00:59,742 INFO L225 Difference]: With dead ends: 15324 [2019-12-07 15:00:59,742 INFO L226 Difference]: Without dead ends: 8289 [2019-12-07 15:00:59,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1232 GetRequests, 1230 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-12-07 15:00:59,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8289 states. [2019-12-07 15:01:00,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8289 to 8289. [2019-12-07 15:01:00,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8289 states. [2019-12-07 15:01:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8289 states to 8289 states and 10891 transitions. [2019-12-07 15:01:00,037 INFO L78 Accepts]: Start accepts. Automaton has 8289 states and 10891 transitions. Word has length 617 [2019-12-07 15:01:00,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:00,038 INFO L462 AbstractCegarLoop]: Abstraction has 8289 states and 10891 transitions. [2019-12-07 15:01:00,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:01:00,038 INFO L276 IsEmpty]: Start isEmpty. Operand 8289 states and 10891 transitions. [2019-12-07 15:01:00,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2019-12-07 15:01:00,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:00,046 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 15:01:00,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2019-12-07 15:01:00,247 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:00,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:00,248 INFO L82 PathProgramCache]: Analyzing trace with hash -410922081, now seen corresponding path program 1 times [2019-12-07 15:01:00,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:01:00,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741332253] [2019-12-07 15:01:00,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2019-12-07 15:01:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:00,720 INFO L264 TraceCheckSpWp]: Trace formula consists of 1436 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:01:00,725 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:01:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4496 backedges. 2482 proven. 0 refuted. 0 times theorem prover too weak. 2014 trivial. 0 not checked. [2019-12-07 15:01:00,966 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:01:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4496 backedges. 2482 proven. 0 refuted. 0 times theorem prover too weak. 2014 trivial. 0 not checked. [2019-12-07 15:01:01,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741332253] [2019-12-07 15:01:01,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:01,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 15:01:01,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712765933] [2019-12-07 15:01:01,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:01:01,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:01:01,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:01:01,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:01:01,212 INFO L87 Difference]: Start difference. First operand 8289 states and 10891 transitions. Second operand 4 states. [2019-12-07 15:01:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:01:02,143 INFO L93 Difference]: Finished difference Result 16994 states and 22350 transitions. [2019-12-07 15:01:02,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:01:02,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 696 [2019-12-07 15:01:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:01:02,149 INFO L225 Difference]: With dead ends: 16994 [2019-12-07 15:01:02,149 INFO L226 Difference]: Without dead ends: 9124 [2019-12-07 15:01:02,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1390 GetRequests, 1388 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-12-07 15:01:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9124 states. [2019-12-07 15:01:02,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9124 to 9124. [2019-12-07 15:01:02,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9124 states. [2019-12-07 15:01:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9124 states to 9124 states and 11978 transitions. [2019-12-07 15:01:02,454 INFO L78 Accepts]: Start accepts. Automaton has 9124 states and 11978 transitions. Word has length 696 [2019-12-07 15:01:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:01:02,454 INFO L462 AbstractCegarLoop]: Abstraction has 9124 states and 11978 transitions. [2019-12-07 15:01:02,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:01:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 9124 states and 11978 transitions. [2019-12-07 15:01:02,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2019-12-07 15:01:02,461 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:01:02,462 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:01:02,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2019-12-07 15:01:02,663 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:01:02,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:01:02,663 INFO L82 PathProgramCache]: Analyzing trace with hash -727278029, now seen corresponding path program 1 times [2019-12-07 15:01:02,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:01:02,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904194295] [2019-12-07 15:01:02,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2019-12-07 15:01:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:04,193 INFO L264 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 15:01:04,210 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:01:04,277 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-12-07 15:01:04,278 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,508 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 15:01:04,508 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,510 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_751|], 2=[|v_#memory_$Pointer$.base_746|, |v_#memory_$Pointer$.base_745|]} [2019-12-07 15:01:04,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,563 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-12-07 15:01:04,563 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,649 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,666 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-12-07 15:01:04,667 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,699 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,708 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-12-07 15:01:04,708 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,721 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,722 INFO L534 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-12-07 15:01:04,722 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 15:01:04,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,733 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-12-07 15:01:04,733 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,738 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,738 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,738 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 15:01:04,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,743 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-12-07 15:01:04,743 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,748 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,748 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 15:01:04,753 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:01:04,771 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,775 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-12-07 15:01:04,775 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,782 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,782 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,782 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 15:01:04,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,787 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-12-07 15:01:04,787 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,791 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,792 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,792 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 15:01:04,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,795 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-12-07 15:01:04,795 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,800 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,800 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 15:01:04,803 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:01:04,824 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,828 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-12-07 15:01:04,829 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,836 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,836 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,836 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 15:01:04,838 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_746|], 2=[|v_#memory_$Pointer$.base_758|]} [2019-12-07 15:01:04,840 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 49 treesize of output 37 [2019-12-07 15:01:04,841 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:01:04,852 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,880 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,880 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 15:01:04,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:01:04,882 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,893 INFO L614 ElimStorePlain]: treesize reduction 40, result has 25.9 percent of original size [2019-12-07 15:01:04,894 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,894 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 15:01:04,899 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:01:04,915 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:04,919 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-12-07 15:01:04,920 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,927 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,927 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,927 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 15:01:04,931 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_747|], 2=[|v_#memory_$Pointer$.base_760|]} [2019-12-07 15:01:04,934 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 49 treesize of output 37 [2019-12-07 15:01:04,934 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:01:04,946 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:04,979 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 15:01:04,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:01:04,979 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,996 INFO L614 ElimStorePlain]: treesize reduction 40, result has 25.9 percent of original size [2019-12-07 15:01:04,996 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:01:04,996 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 15:01:04,998 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_789|, |v_#memory_$Pointer$.offset_745|], 2=[|v_#memory_$Pointer$.base_750|, |v_#memory_$Pointer$.base_761|]} [2019-12-07 15:01:05,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:05,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:05,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-12-07 15:01:05,004 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:01:05,032 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:05,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 21 treesize of output 15 [2019-12-07 15:01:05,037 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:01:05,064 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:05,066 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:01:05,084 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:05,087 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 27 [2019-12-07 15:01:05,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:05,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:01:05,092 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 22 treesize of output 14 [2019-12-07 15:01:05,092 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:01:05,099 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:05,099 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:01:05,114 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:05,114 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:01:05,114 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:142, output treesize:35 [2019-12-07 15:01:05,153 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-12-07 15:01:05,154 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:01:05,158 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:05,158 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:01:05,158 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-12-07 15:01:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5702 backedges. 1770 proven. 91 refuted. 0 times theorem prover too weak. 3841 trivial. 0 not checked. [2019-12-07 15:01:05,802 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:01:05,827 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_int|, |v_#memory_$Pointer$.offset_745|], 2=[|v_#memory_$Pointer$.base_750|]} [2019-12-07 15:01:13,922 WARN L192 SmtUtils]: Spent 8.09 s on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 15:01:13,922 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:13,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 106 [2019-12-07 15:01:13,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:01:13,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:01:13,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:01:13,944 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:01:13,945 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 106 treesize of output 106 [2019-12-07 15:01:13,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:01:13,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:01:13,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:01:13,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:01:13,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:01:13,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:01:13,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:01:13,950 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:01:13,951 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_62], 1=[v_arrayElimCell_63]} [2019-12-07 15:01:13,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904194295] [2019-12-07 15:01:13,954 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@c7facb [2019-12-07 15:01:13,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1625267964] [2019-12-07 15:01:13,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:01:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:32,613 INFO L264 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 15:01:32,614 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@c7facb [2019-12-07 15:01:32,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916771518] [2019-12-07 15:01:32,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27bd20e1-786a-40c7-9bea-05fb44e2fe40/bin/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:01:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:01:32,981 INFO L264 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 15:01:32,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:01:32,989 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@c7facb [2019-12-07 15:01:32,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:01:32,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 15:01:32,989 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 15:01:32,989 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:01:33,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:01:33,705 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 15:01:33,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:01:33 BoogieIcfgContainer [2019-12-07 15:01:33,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:01:33,706 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:01:33,706 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:01:33,706 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:01:33,706 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:57:01" (3/4) ... [2019-12-07 15:01:33,709 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 15:01:33,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:01:33,709 INFO L168 Benchmark]: Toolchain (without parser) took 275007.94 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 793.8 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 633.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:33,710 INFO L168 Benchmark]: CDTParser took 0.14 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-12-07 15:01:33,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:33,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.21 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:33,710 INFO L168 Benchmark]: Boogie Preprocessor took 52.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:33,710 INFO L168 Benchmark]: RCFGBuilder took 2430.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.4 MB in the end (delta: 111.5 MB). Peak memory consumption was 111.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:33,711 INFO L168 Benchmark]: TraceAbstraction took 272041.77 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 665.3 MB). Free memory was 976.4 MB in the beginning and 1.1 GB in the end (delta: -129.5 MB). Peak memory consumption was 535.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:01:33,711 INFO L168 Benchmark]: Witness Printer took 2.78 ms. Allocated memory is still 1.8 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:01:33,712 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.14 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 419.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.21 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2430.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.4 MB in the end (delta: 111.5 MB). Peak memory consumption was 111.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 272041.77 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 665.3 MB). Free memory was 976.4 MB in the beginning and 1.1 GB in the end (delta: -129.5 MB). Peak memory consumption was 535.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.78 ms. Allocated memory is still 1.8 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1778]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) [L1130] EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 [L1347] COND FALSE !(ret <= 0) [L1352] s->hit [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 [L1357] s->init_num = 0 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1361] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1364] ret = __VERIFIER_nondet_int() [L1365] COND TRUE blastFlag == 2 [L1366] blastFlag = 3 [L1370] COND FALSE !(ret <= 0) [L1376] s->state = 8528 [L1377] s->init_num = 0 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options [L1382] COND TRUE s->options & 2097152UL [L1383] EXPR s->s3 [L1383] (s->s3)->tmp.use_rsa_tmp = 1 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp [L1387] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1405] ret = __VERIFIER_nondet_int() [L1406] COND TRUE blastFlag == 3 [L1407] blastFlag = 4 [L1411] COND FALSE !(ret <= 0) [L1428] s->state = 8544 [L1429] s->init_num = 0 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND TRUE blastFlag == 4 [L1457] blastFlag = 5 [L1461] COND FALSE !(ret <= 0) [L1466] s->state = 8448 [L1467] EXPR s->s3 [L1467] (s->s3)->tmp.next_state = 8576 [L1468] s->init_num = 0 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND TRUE s->state == 8576 [L1507] ret = __VERIFIER_nondet_int() [L1508] COND TRUE blastFlag == 5 [L1509] blastFlag = 6 [L1513] COND FALSE !(ret <= 0) [L1518] COND FALSE !(ret == 2) [L1521] ret = __VERIFIER_nondet_int() [L1522] COND TRUE blastFlag == 6 [L1523] blastFlag = 7 [L1527] COND FALSE !(ret <= 0) [L1532] s->init_num = 0 [L1533] s->state = 8592 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND TRUE s->state == 8592 [L1538] ret = __VERIFIER_nondet_int() [L1539] COND TRUE blastFlag == 7 [L1540] blastFlag = 8 [L1544] COND FALSE !(ret <= 0) [L1549] s->state = 8608 [L1550] s->init_num = 0 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND TRUE s->state == 8608 [L1554] ret = __VERIFIER_nondet_int() [L1555] COND TRUE blastFlag == 8 [L1556] blastFlag = 9 [L1560] COND FALSE !(ret <= 0) [L1565] s->state = 8640 [L1566] s->init_num = 0 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND TRUE blastFlag == 9 [L1572] blastFlag = 10 [L1592] COND FALSE !(ret <= 0) [L1597] s->hit [L1597] COND FALSE !(s->hit) [L1600] s->state = 8656 [L1602] s->init_num = 0 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND TRUE s->state == 8656 [L1606] EXPR s->session [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.new_cipher [L1606] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1607] COND FALSE !(! tmp___9) [L1613] ret = __VERIFIER_nondet_int() [L1614] COND TRUE blastFlag == 10 [L1615] blastFlag = 11 [L1631] COND FALSE !(ret <= 0) [L1636] s->state = 8672 [L1637] s->init_num = 0 [L1638] COND FALSE !(! tmp___10) [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state [L1235] COND TRUE s->state == 8672 [L1647] ret = __VERIFIER_nondet_int() [L1648] COND TRUE blastFlag == 11 [L1649] blastFlag = 12 [L1665] COND FALSE !(ret <= 0) [L1670] s->state = 8448 [L1671] s->hit [L1671] COND TRUE s->hit [L1672] EXPR s->s3 [L1672] (s->s3)->tmp.next_state = 8640 [L1676] s->init_num = 0 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) [L1574] COND TRUE blastFlag == 12 [L1575] blastFlag = 13 [L1592] COND FALSE !(ret <= 0) [L1597] s->hit [L1597] COND FALSE !(s->hit) [L1600] s->state = 8656 [L1602] s->init_num = 0 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND TRUE s->state == 8656 [L1606] EXPR s->session [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.new_cipher [L1606] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1607] COND FALSE !(! tmp___9) [L1613] ret = __VERIFIER_nondet_int() [L1614] COND FALSE !(blastFlag == 10) [L1617] COND TRUE blastFlag == 13 [L1618] blastFlag = 14 [L1631] COND FALSE !(ret <= 0) [L1636] s->state = 8672 [L1637] s->init_num = 0 [L1638] COND FALSE !(! tmp___10) [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state [L1235] COND TRUE s->state == 8672 [L1647] ret = __VERIFIER_nondet_int() [L1648] COND FALSE !(blastFlag == 11) [L1651] COND TRUE blastFlag == 14 [L1652] blastFlag = 15 [L1665] COND FALSE !(ret <= 0) [L1670] s->state = 8448 [L1671] s->hit [L1671] COND TRUE s->hit [L1672] EXPR s->s3 [L1672] (s->s3)->tmp.next_state = 8640 [L1676] s->init_num = 0 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) [L1574] COND FALSE !(blastFlag == 12) [L1577] COND TRUE blastFlag == 15 [L1578] blastFlag = 16 [L1592] COND FALSE !(ret <= 0) [L1597] s->hit [L1597] COND FALSE !(s->hit) [L1600] s->state = 8656 [L1602] s->init_num = 0 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND TRUE s->state == 8656 [L1606] EXPR s->session [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.new_cipher [L1606] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1607] COND FALSE !(! tmp___9) [L1613] ret = __VERIFIER_nondet_int() [L1614] COND FALSE !(blastFlag == 10) [L1617] COND FALSE !(blastFlag == 13) [L1620] COND TRUE blastFlag == 16 [L1621] blastFlag = 17 [L1631] COND FALSE !(ret <= 0) [L1636] s->state = 8672 [L1637] s->init_num = 0 [L1638] COND FALSE !(! tmp___10) [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state [L1235] COND TRUE s->state == 8672 [L1647] ret = __VERIFIER_nondet_int() [L1648] COND FALSE !(blastFlag == 11) [L1651] COND FALSE !(blastFlag == 14) [L1654] COND TRUE blastFlag == 17 [L1655] blastFlag = 18 [L1665] COND FALSE !(ret <= 0) [L1670] s->state = 8448 [L1671] s->hit [L1671] COND TRUE s->hit [L1672] EXPR s->s3 [L1672] (s->s3)->tmp.next_state = 8640 [L1676] s->init_num = 0 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) [L1574] COND FALSE !(blastFlag == 12) [L1577] COND FALSE !(blastFlag == 15) [L1580] COND TRUE blastFlag == 18 [L1581] blastFlag = 19 [L1592] COND FALSE !(ret <= 0) [L1597] s->hit [L1597] COND FALSE !(s->hit) [L1600] s->state = 8656 [L1602] s->init_num = 0 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND TRUE s->state == 8656 [L1606] EXPR s->session [L1606] EXPR s->s3 [L1606] EXPR (s->s3)->tmp.new_cipher [L1606] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1607] COND FALSE !(! tmp___9) [L1613] ret = __VERIFIER_nondet_int() [L1614] COND FALSE !(blastFlag == 10) [L1617] COND FALSE !(blastFlag == 13) [L1620] COND FALSE !(blastFlag == 16) [L1623] COND TRUE blastFlag == 19 [L1624] blastFlag = 20 [L1631] COND FALSE !(ret <= 0) [L1636] s->state = 8672 [L1637] s->init_num = 0 [L1638] COND FALSE !(! tmp___10) [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state [L1235] COND TRUE s->state == 8672 [L1647] ret = __VERIFIER_nondet_int() [L1648] COND FALSE !(blastFlag == 11) [L1651] COND FALSE !(blastFlag == 14) [L1654] COND FALSE !(blastFlag == 17) [L1657] COND TRUE blastFlag == 20 [L1658] blastFlag = 21 [L1665] COND FALSE !(ret <= 0) [L1670] s->state = 8448 [L1671] s->hit [L1671] COND TRUE s->hit [L1672] EXPR s->s3 [L1672] (s->s3)->tmp.next_state = 8640 [L1676] s->init_num = 0 [L1737] EXPR s->s3 [L1737] EXPR (s->s3)->tmp.reuse_message [L1737] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1766] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) [L1574] COND FALSE !(blastFlag == 12) [L1577] COND FALSE !(blastFlag == 15) [L1580] COND FALSE !(blastFlag == 18) [L1583] COND TRUE blastFlag == 21 [L1778] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 160 locations, 1 error locations. Result: UNKNOWN, OverallTime: 271.8s, OverallIterations: 36, TraceHistogramMax: 21, AutomataDifference: 206.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8598 SDtfs, 7911 SDslu, 17180 SDs, 0 SdLazy, 12812 SolverSat, 1833 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 192.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32486 GetRequests, 32326 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9124occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 34182 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.0s SsaConstructionTime, 7.6s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 16255 NumberOfCodeBlocks, 16255 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 32440 ConstructedInterpolants, 0 QuantifiedInterpolants, 22664119 SizeOfPredicates, 74 NumberOfNonLiveVariables, 34164 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 70 InterpolantComputations, 70 PerfectInterpolantSequences, 143368/143368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...