./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/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 17194510d9b99ec25b25421f731ec156f7460313 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/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 17194510d9b99ec25b25421f731ec156f7460313 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: expected NNF --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:50:30,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:50:30,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:50:30,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:50:30,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:50:30,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:50:30,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:50:30,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:50:30,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:50:30,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:50:30,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:50:30,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:50:30,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:50:30,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:50:30,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:50:30,581 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:50:30,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:50:30,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:50:30,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:50:30,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:50:30,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:50:30,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:50:30,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:50:30,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:50:30,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:50:30,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:50:30,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:50:30,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:50:30,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:50:30,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:50:30,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:50:30,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:50:30,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:50:30,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:50:30,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:50:30,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:50:30,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:50:30,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:50:30,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:50:30,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:50:30,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:50:30,600 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:50:30,613 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:50:30,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:50:30,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:50:30,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:50:30,614 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:50:30,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:50:30,615 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:50:30,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:50:30,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:50:30,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:50:30,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:50:30,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:50:30,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:50:30,617 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:50:30,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:50:30,617 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:50:30,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:50:30,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:50:30,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:50:30,618 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:50:30,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:50:30,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:50:30,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:50:30,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:50:30,619 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:50:30,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:50:30,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:50:30,620 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:50:30,620 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_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/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 -> 17194510d9b99ec25b25421f731ec156f7460313 [2019-11-15 22:50:30,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:50:30,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:50:30,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:50:30,673 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:50:30,673 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:50:30,674 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c [2019-11-15 22:50:30,738 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/data/4a8eeb9dd/d1f09b33da174c788d61d9ae6a175192/FLAGe846238fb [2019-11-15 22:50:31,240 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:50:31,241 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c [2019-11-15 22:50:31,265 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/data/4a8eeb9dd/d1f09b33da174c788d61d9ae6a175192/FLAGe846238fb [2019-11-15 22:50:31,482 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/data/4a8eeb9dd/d1f09b33da174c788d61d9ae6a175192 [2019-11-15 22:50:31,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:50:31,485 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:50:31,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:50:31,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:50:31,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:50:31,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:50:31" (1/1) ... [2019-11-15 22:50:31,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4158f227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:31, skipping insertion in model container [2019-11-15 22:50:31,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:50:31" (1/1) ... [2019-11-15 22:50:31,502 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:50:31,553 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:50:32,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:50:32,064 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:50:32,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:50:32,265 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:50:32,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:32 WrapperNode [2019-11-15 22:50:32,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:50:32,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:50:32,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:50:32,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:50:32,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:32" (1/1) ... [2019-11-15 22:50:32,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:32" (1/1) ... [2019-11-15 22:50:32,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:50:32,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:50:32,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:50:32,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:50:32,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:32" (1/1) ... [2019-11-15 22:50:32,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:32" (1/1) ... [2019-11-15 22:50:32,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:32" (1/1) ... [2019-11-15 22:50:32,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:32" (1/1) ... [2019-11-15 22:50:32,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:32" (1/1) ... [2019-11-15 22:50:32,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:32" (1/1) ... [2019-11-15 22:50:32,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:32" (1/1) ... [2019-11-15 22:50:32,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:50:32,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:50:32,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:50:32,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:50:32,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:50:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:50:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:50:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:50:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:50:32,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:50:32,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:50:32,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:50:32,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:50:32,880 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:50:33,803 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 22:50:33,803 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 22:50:33,804 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:50:33,804 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:50:33,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:50:33 BoogieIcfgContainer [2019-11-15 22:50:33,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:50:33,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:50:33,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:50:33,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:50:33,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:50:31" (1/3) ... [2019-11-15 22:50:33,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5047c302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:50:33, skipping insertion in model container [2019-11-15 22:50:33,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:32" (2/3) ... [2019-11-15 22:50:33,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5047c302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:50:33, skipping insertion in model container [2019-11-15 22:50:33,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:50:33" (3/3) ... [2019-11-15 22:50:33,821 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-2.c [2019-11-15 22:50:33,831 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:50:33,841 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:50:33,851 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:50:33,879 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:50:33,880 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:50:33,880 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:50:33,880 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:50:33,880 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:50:33,880 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:50:33,881 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:50:33,881 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:50:33,900 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 22:50:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:50:33,908 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:33,909 INFO L380 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] [2019-11-15 22:50:33,910 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:33,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:33,915 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-11-15 22:50:33,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:33,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793597975] [2019-11-15 22:50:33,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:33,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:33,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:34,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793597975] [2019-11-15 22:50:34,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:34,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:34,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156226540] [2019-11-15 22:50:34,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:34,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:34,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:34,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:34,205 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-15 22:50:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:34,802 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-11-15 22:50:34,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:34,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 22:50:34,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:34,826 INFO L225 Difference]: With dead ends: 323 [2019-11-15 22:50:34,828 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 22:50:34,833 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 22:50:34,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-15 22:50:34,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:50:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-11-15 22:50:34,902 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-11-15 22:50:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:34,903 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-11-15 22:50:34,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:34,903 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-11-15 22:50:34,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:50:34,907 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:34,907 INFO L380 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] [2019-11-15 22:50:34,908 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:34,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:34,908 INFO L82 PathProgramCache]: Analyzing trace with hash 2027967358, now seen corresponding path program 1 times [2019-11-15 22:50:34,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:34,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838501766] [2019-11-15 22:50:34,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:34,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:34,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:35,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838501766] [2019-11-15 22:50:35,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:35,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:35,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876299752] [2019-11-15 22:50:35,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:35,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:35,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:35,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:35,066 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-11-15 22:50:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:35,501 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-11-15 22:50:35,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:35,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-15 22:50:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:35,504 INFO L225 Difference]: With dead ends: 290 [2019-11-15 22:50:35,504 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 22:50:35,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 22:50:35,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-15 22:50:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:50:35,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-11-15 22:50:35,521 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-11-15 22:50:35,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:35,521 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-11-15 22:50:35,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:35,522 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-11-15 22:50:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:50:35,524 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:35,524 INFO L380 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] [2019-11-15 22:50:35,525 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:35,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:35,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1944321008, now seen corresponding path program 1 times [2019-11-15 22:50:35,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:35,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106298371] [2019-11-15 22:50:35,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:35,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:35,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:35,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:35,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106298371] [2019-11-15 22:50:35,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:35,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:35,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546780852] [2019-11-15 22:50:35,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:35,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:35,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:35,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:35,649 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-11-15 22:50:36,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:36,002 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-11-15 22:50:36,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:36,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 22:50:36,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:36,004 INFO L225 Difference]: With dead ends: 289 [2019-11-15 22:50:36,004 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 22:50:36,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:36,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 22:50:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-11-15 22:50:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:50:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-11-15 22:50:36,015 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-11-15 22:50:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:36,015 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-11-15 22:50:36,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-11-15 22:50:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:50:36,017 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:36,017 INFO L380 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] [2019-11-15 22:50:36,018 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:36,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:36,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2008072389, now seen corresponding path program 1 times [2019-11-15 22:50:36,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:36,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649991168] [2019-11-15 22:50:36,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:36,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:36,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:36,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649991168] [2019-11-15 22:50:36,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:36,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:36,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366101239] [2019-11-15 22:50:36,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:36,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:36,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:36,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:36,110 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-11-15 22:50:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:36,448 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-11-15 22:50:36,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:36,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 22:50:36,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:36,449 INFO L225 Difference]: With dead ends: 287 [2019-11-15 22:50:36,450 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 22:50:36,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 22:50:36,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-11-15 22:50:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:50:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-11-15 22:50:36,459 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-11-15 22:50:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:36,459 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-11-15 22:50:36,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-11-15 22:50:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:50:36,460 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:36,461 INFO L380 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] [2019-11-15 22:50:36,461 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:36,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:36,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1467926917, now seen corresponding path program 1 times [2019-11-15 22:50:36,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:36,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932768800] [2019-11-15 22:50:36,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:36,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:36,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:36,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932768800] [2019-11-15 22:50:36,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:36,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:36,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373592099] [2019-11-15 22:50:36,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:36,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:36,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:36,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:36,532 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-11-15 22:50:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:36,855 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-11-15 22:50:36,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:36,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 22:50:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:36,857 INFO L225 Difference]: With dead ends: 286 [2019-11-15 22:50:36,857 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 22:50:36,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:36,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 22:50:36,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 22:50:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:50:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-11-15 22:50:36,870 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-11-15 22:50:36,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:36,870 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-11-15 22:50:36,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-11-15 22:50:36,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:50:36,871 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:36,872 INFO L380 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] [2019-11-15 22:50:36,872 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:36,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:36,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1078741852, now seen corresponding path program 1 times [2019-11-15 22:50:36,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:36,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518072351] [2019-11-15 22:50:36,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:36,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:36,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:36,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518072351] [2019-11-15 22:50:36,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:36,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:36,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424613667] [2019-11-15 22:50:36,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:36,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:36,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:36,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:36,969 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-11-15 22:50:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:37,313 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-15 22:50:37,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:37,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 22:50:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:37,317 INFO L225 Difference]: With dead ends: 286 [2019-11-15 22:50:37,317 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 22:50:37,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:37,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 22:50:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 22:50:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:50:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-11-15 22:50:37,334 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-11-15 22:50:37,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:37,341 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-11-15 22:50:37,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-15 22:50:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 22:50:37,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:37,343 INFO L380 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] [2019-11-15 22:50:37,343 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:37,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:37,343 INFO L82 PathProgramCache]: Analyzing trace with hash 231094087, now seen corresponding path program 1 times [2019-11-15 22:50:37,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:37,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237907013] [2019-11-15 22:50:37,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:37,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:37,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:37,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237907013] [2019-11-15 22:50:37,410 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:37,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:37,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976833979] [2019-11-15 22:50:37,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:37,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:37,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:37,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:37,412 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-11-15 22:50:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:37,714 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-11-15 22:50:37,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:37,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-15 22:50:37,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:37,716 INFO L225 Difference]: With dead ends: 286 [2019-11-15 22:50:37,716 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 22:50:37,717 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:37,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 22:50:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 22:50:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:50:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-11-15 22:50:37,722 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-11-15 22:50:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:37,722 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-11-15 22:50:37,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-11-15 22:50:37,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 22:50:37,723 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:37,724 INFO L380 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] [2019-11-15 22:50:37,724 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:37,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:37,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1862851913, now seen corresponding path program 1 times [2019-11-15 22:50:37,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:37,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894227245] [2019-11-15 22:50:37,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:37,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:37,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:37,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894227245] [2019-11-15 22:50:37,779 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:37,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:37,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103492102] [2019-11-15 22:50:37,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:37,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:37,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:37,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:37,780 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-11-15 22:50:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:38,100 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-11-15 22:50:38,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:38,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-15 22:50:38,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:38,102 INFO L225 Difference]: With dead ends: 286 [2019-11-15 22:50:38,102 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 22:50:38,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 22:50:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 22:50:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:50:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-11-15 22:50:38,108 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-11-15 22:50:38,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:38,108 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-11-15 22:50:38,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-11-15 22:50:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 22:50:38,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:38,109 INFO L380 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] [2019-11-15 22:50:38,109 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:38,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:38,109 INFO L82 PathProgramCache]: Analyzing trace with hash 589286348, now seen corresponding path program 1 times [2019-11-15 22:50:38,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:38,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671853844] [2019-11-15 22:50:38,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:38,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:38,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:38,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671853844] [2019-11-15 22:50:38,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:38,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:38,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186331472] [2019-11-15 22:50:38,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:38,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:38,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:38,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:38,163 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-11-15 22:50:38,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:38,421 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-11-15 22:50:38,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:38,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 22:50:38,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:38,423 INFO L225 Difference]: With dead ends: 276 [2019-11-15 22:50:38,423 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 22:50:38,424 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 22:50:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-15 22:50:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 22:50:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-15 22:50:38,429 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-11-15 22:50:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:38,429 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-15 22:50:38,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-15 22:50:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 22:50:38,430 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:38,430 INFO L380 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] [2019-11-15 22:50:38,430 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:38,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:38,430 INFO L82 PathProgramCache]: Analyzing trace with hash -350273228, now seen corresponding path program 1 times [2019-11-15 22:50:38,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:38,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002902210] [2019-11-15 22:50:38,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:38,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:38,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:38,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002902210] [2019-11-15 22:50:38,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:38,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:38,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367503092] [2019-11-15 22:50:38,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:38,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:38,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:38,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:38,486 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-11-15 22:50:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:38,851 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-11-15 22:50:38,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:38,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 22:50:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:38,853 INFO L225 Difference]: With dead ends: 316 [2019-11-15 22:50:38,853 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 22:50:38,854 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 22:50:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-15 22:50:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:50:38,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-11-15 22:50:38,859 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-11-15 22:50:38,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:38,860 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-11-15 22:50:38,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:38,860 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-11-15 22:50:38,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 22:50:38,861 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:38,861 INFO L380 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] [2019-11-15 22:50:38,862 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:38,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:38,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1467398046, now seen corresponding path program 1 times [2019-11-15 22:50:38,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:38,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957484054] [2019-11-15 22:50:38,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:38,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:38,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:38,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957484054] [2019-11-15 22:50:38,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:38,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:38,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906701308] [2019-11-15 22:50:38,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:38,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:38,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:38,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:38,915 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-11-15 22:50:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:39,263 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-11-15 22:50:39,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:39,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 22:50:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:39,265 INFO L225 Difference]: With dead ends: 338 [2019-11-15 22:50:39,265 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 22:50:39,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 22:50:39,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-15 22:50:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:50:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-11-15 22:50:39,271 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-11-15 22:50:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:39,271 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-11-15 22:50:39,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-15 22:50:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:50:39,272 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:39,273 INFO L380 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] [2019-11-15 22:50:39,273 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:39,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:39,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2142100496, now seen corresponding path program 1 times [2019-11-15 22:50:39,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:39,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578640696] [2019-11-15 22:50:39,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:39,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:39,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:39,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578640696] [2019-11-15 22:50:39,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:39,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:39,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266732428] [2019-11-15 22:50:39,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:39,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:39,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:39,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:39,323 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-11-15 22:50:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:39,655 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-15 22:50:39,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:39,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 22:50:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:39,657 INFO L225 Difference]: With dead ends: 337 [2019-11-15 22:50:39,657 INFO L226 Difference]: Without dead ends: 188 [2019-11-15 22:50:39,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:39,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-15 22:50:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-11-15 22:50:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:50:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-11-15 22:50:39,663 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-11-15 22:50:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:39,663 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-11-15 22:50:39,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:39,663 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-11-15 22:50:39,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:50:39,664 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:39,664 INFO L380 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] [2019-11-15 22:50:39,664 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:39,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:39,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2089115419, now seen corresponding path program 1 times [2019-11-15 22:50:39,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:39,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937676967] [2019-11-15 22:50:39,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:39,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:39,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:39,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937676967] [2019-11-15 22:50:39,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:39,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:39,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778633257] [2019-11-15 22:50:39,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:39,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:39,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:39,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:39,716 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-11-15 22:50:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:40,101 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-11-15 22:50:40,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:40,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 22:50:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:40,103 INFO L225 Difference]: With dead ends: 335 [2019-11-15 22:50:40,104 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 22:50:40,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 22:50:40,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-11-15 22:50:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:50:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-11-15 22:50:40,109 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-11-15 22:50:40,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:40,109 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-11-15 22:50:40,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:40,110 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-11-15 22:50:40,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:50:40,110 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:40,110 INFO L380 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] [2019-11-15 22:50:40,111 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:40,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:40,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1665706405, now seen corresponding path program 1 times [2019-11-15 22:50:40,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:40,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592050173] [2019-11-15 22:50:40,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:40,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:40,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:40,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592050173] [2019-11-15 22:50:40,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:40,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:40,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133832696] [2019-11-15 22:50:40,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:40,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:40,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:40,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:40,173 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-11-15 22:50:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:40,573 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-11-15 22:50:40,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:40,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 22:50:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:40,575 INFO L225 Difference]: With dead ends: 334 [2019-11-15 22:50:40,576 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 22:50:40,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:40,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 22:50:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 22:50:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:50:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-11-15 22:50:40,581 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-11-15 22:50:40,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:40,581 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-11-15 22:50:40,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-11-15 22:50:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:50:40,582 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:40,582 INFO L380 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] [2019-11-15 22:50:40,583 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:40,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:40,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1276521340, now seen corresponding path program 1 times [2019-11-15 22:50:40,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:40,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241511564] [2019-11-15 22:50:40,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:40,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:40,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:40,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241511564] [2019-11-15 22:50:40,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:40,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:40,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662720301] [2019-11-15 22:50:40,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:40,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:40,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:40,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:40,638 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-11-15 22:50:40,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:40,996 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-11-15 22:50:40,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:40,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 22:50:40,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:40,998 INFO L225 Difference]: With dead ends: 334 [2019-11-15 22:50:40,998 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 22:50:40,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 22:50:41,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 22:50:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:50:41,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-11-15 22:50:41,005 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-11-15 22:50:41,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:41,005 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-11-15 22:50:41,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-11-15 22:50:41,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:50:41,006 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:41,006 INFO L380 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] [2019-11-15 22:50:41,007 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:41,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:41,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1605102745, now seen corresponding path program 1 times [2019-11-15 22:50:41,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:41,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110543672] [2019-11-15 22:50:41,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:41,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:41,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:41,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110543672] [2019-11-15 22:50:41,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:41,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:41,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097968627] [2019-11-15 22:50:41,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:41,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:41,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:41,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:41,063 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-11-15 22:50:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:41,394 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-11-15 22:50:41,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:41,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 22:50:41,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:41,396 INFO L225 Difference]: With dead ends: 334 [2019-11-15 22:50:41,396 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 22:50:41,397 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 22:50:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 22:50:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:50:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-11-15 22:50:41,403 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-11-15 22:50:41,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:41,403 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-11-15 22:50:41,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:41,403 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-11-15 22:50:41,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 22:50:41,404 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:41,404 INFO L380 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] [2019-11-15 22:50:41,404 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:41,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:41,405 INFO L82 PathProgramCache]: Analyzing trace with hash 775324969, now seen corresponding path program 1 times [2019-11-15 22:50:41,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:41,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126005159] [2019-11-15 22:50:41,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:41,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:41,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:41,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126005159] [2019-11-15 22:50:41,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:41,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:41,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306057593] [2019-11-15 22:50:41,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:41,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:41,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:41,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:41,466 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-11-15 22:50:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:41,798 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-11-15 22:50:41,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:41,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 22:50:41,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:41,800 INFO L225 Difference]: With dead ends: 334 [2019-11-15 22:50:41,800 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 22:50:41,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:41,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 22:50:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 22:50:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:50:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-11-15 22:50:41,806 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-11-15 22:50:41,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:41,807 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-11-15 22:50:41,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:41,807 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-11-15 22:50:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 22:50:41,808 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:41,808 INFO L380 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] [2019-11-15 22:50:41,808 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1235689452, now seen corresponding path program 1 times [2019-11-15 22:50:41,809 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:41,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604070011] [2019-11-15 22:50:41,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:41,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:41,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:41,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604070011] [2019-11-15 22:50:41,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:41,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:41,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683738200] [2019-11-15 22:50:41,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:41,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:41,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:41,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:41,863 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-11-15 22:50:42,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:42,193 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-11-15 22:50:42,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:42,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-15 22:50:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:42,195 INFO L225 Difference]: With dead ends: 324 [2019-11-15 22:50:42,195 INFO L226 Difference]: Without dead ends: 175 [2019-11-15 22:50:42,196 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:42,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-15 22:50:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-11-15 22:50:42,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 22:50:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-11-15 22:50:42,201 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-11-15 22:50:42,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:42,201 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-11-15 22:50:42,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-11-15 22:50:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 22:50:42,202 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:42,202 INFO L380 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] [2019-11-15 22:50:42,202 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:42,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1988306166, now seen corresponding path program 1 times [2019-11-15 22:50:42,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:42,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761703810] [2019-11-15 22:50:42,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:42,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:42,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:42,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761703810] [2019-11-15 22:50:42,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:42,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:42,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724218202] [2019-11-15 22:50:42,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:42,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:42,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:42,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:42,287 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-11-15 22:50:42,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:42,824 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-11-15 22:50:42,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:42,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 22:50:42,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:42,827 INFO L225 Difference]: With dead ends: 424 [2019-11-15 22:50:42,827 INFO L226 Difference]: Without dead ends: 275 [2019-11-15 22:50:42,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-15 22:50:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2019-11-15 22:50:42,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-15 22:50:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-11-15 22:50:42,835 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-11-15 22:50:42,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:42,835 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-11-15 22:50:42,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-11-15 22:50:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 22:50:42,837 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:42,837 INFO L380 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] [2019-11-15 22:50:42,837 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:42,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:42,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2060692724, now seen corresponding path program 1 times [2019-11-15 22:50:42,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:42,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478286764] [2019-11-15 22:50:42,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:42,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:42,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:42,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478286764] [2019-11-15 22:50:42,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:42,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:42,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569702305] [2019-11-15 22:50:42,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:42,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:42,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:42,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:42,897 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-11-15 22:50:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:43,330 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-11-15 22:50:43,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:43,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 22:50:43,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:43,332 INFO L225 Difference]: With dead ends: 427 [2019-11-15 22:50:43,332 INFO L226 Difference]: Without dead ends: 248 [2019-11-15 22:50:43,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-15 22:50:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-11-15 22:50:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-15 22:50:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-11-15 22:50:43,339 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-11-15 22:50:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:43,339 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-11-15 22:50:43,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:43,340 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-11-15 22:50:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 22:50:43,340 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:43,340 INFO L380 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] [2019-11-15 22:50:43,341 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:43,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:43,341 INFO L82 PathProgramCache]: Analyzing trace with hash 880688961, now seen corresponding path program 1 times [2019-11-15 22:50:43,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:43,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565671499] [2019-11-15 22:50:43,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:43,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:43,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:43,422 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:43,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565671499] [2019-11-15 22:50:43,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:43,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:43,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702899519] [2019-11-15 22:50:43,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:43,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:43,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:43,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:43,425 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-11-15 22:50:43,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:43,956 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2019-11-15 22:50:43,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:43,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 22:50:43,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:43,959 INFO L225 Difference]: With dead ends: 494 [2019-11-15 22:50:43,959 INFO L226 Difference]: Without dead ends: 291 [2019-11-15 22:50:43,960 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-15 22:50:43,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2019-11-15 22:50:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-15 22:50:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-11-15 22:50:43,967 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-11-15 22:50:43,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:43,968 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-11-15 22:50:43,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-11-15 22:50:43,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 22:50:43,969 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:43,969 INFO L380 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] [2019-11-15 22:50:43,970 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:43,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:43,970 INFO L82 PathProgramCache]: Analyzing trace with hash 979572393, now seen corresponding path program 1 times [2019-11-15 22:50:43,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:43,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026550125] [2019-11-15 22:50:43,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:43,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:43,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:44,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026550125] [2019-11-15 22:50:44,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:44,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:44,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332346785] [2019-11-15 22:50:44,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:44,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:44,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:44,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:44,039 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-11-15 22:50:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:44,515 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2019-11-15 22:50:44,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:44,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-15 22:50:44,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:44,519 INFO L225 Difference]: With dead ends: 495 [2019-11-15 22:50:44,519 INFO L226 Difference]: Without dead ends: 291 [2019-11-15 22:50:44,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-15 22:50:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2019-11-15 22:50:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-15 22:50:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-11-15 22:50:44,528 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2019-11-15 22:50:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:44,529 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-11-15 22:50:44,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-11-15 22:50:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 22:50:44,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:44,530 INFO L380 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] [2019-11-15 22:50:44,531 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:44,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:44,531 INFO L82 PathProgramCache]: Analyzing trace with hash 294608539, now seen corresponding path program 1 times [2019-11-15 22:50:44,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:44,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119855395] [2019-11-15 22:50:44,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:44,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:44,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:44,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119855395] [2019-11-15 22:50:44,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:44,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:44,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167900641] [2019-11-15 22:50:44,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:44,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:44,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:44,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:44,608 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-11-15 22:50:45,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:45,010 INFO L93 Difference]: Finished difference Result 499 states and 772 transitions. [2019-11-15 22:50:45,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:45,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-15 22:50:45,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:45,012 INFO L225 Difference]: With dead ends: 499 [2019-11-15 22:50:45,012 INFO L226 Difference]: Without dead ends: 285 [2019-11-15 22:50:45,013 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-15 22:50:45,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-11-15 22:50:45,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:50:45,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-11-15 22:50:45,020 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2019-11-15 22:50:45,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:45,021 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-11-15 22:50:45,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:45,021 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-11-15 22:50:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:50:45,022 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:45,022 INFO L380 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] [2019-11-15 22:50:45,023 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:45,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:45,023 INFO L82 PathProgramCache]: Analyzing trace with hash 354437512, now seen corresponding path program 1 times [2019-11-15 22:50:45,023 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:45,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290168951] [2019-11-15 22:50:45,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:45,024 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:45,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:45,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290168951] [2019-11-15 22:50:45,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:45,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:45,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458535983] [2019-11-15 22:50:45,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:45,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:45,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:45,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:45,085 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-11-15 22:50:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:45,544 INFO L93 Difference]: Finished difference Result 500 states and 772 transitions. [2019-11-15 22:50:45,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:45,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 22:50:45,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:45,547 INFO L225 Difference]: With dead ends: 500 [2019-11-15 22:50:45,547 INFO L226 Difference]: Without dead ends: 285 [2019-11-15 22:50:45,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-15 22:50:45,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-11-15 22:50:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:50:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-11-15 22:50:45,555 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-11-15 22:50:45,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:45,556 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-11-15 22:50:45,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:45,556 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-11-15 22:50:45,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:50:45,557 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:45,557 INFO L380 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] [2019-11-15 22:50:45,558 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:45,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:45,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2012257082, now seen corresponding path program 1 times [2019-11-15 22:50:45,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:45,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217466879] [2019-11-15 22:50:45,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:45,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:45,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:45,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217466879] [2019-11-15 22:50:45,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:45,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:45,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775833523] [2019-11-15 22:50:45,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:45,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:45,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:45,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:45,626 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-11-15 22:50:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:46,075 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-11-15 22:50:46,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:46,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 22:50:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:46,077 INFO L225 Difference]: With dead ends: 475 [2019-11-15 22:50:46,077 INFO L226 Difference]: Without dead ends: 260 [2019-11-15 22:50:46,078 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-15 22:50:46,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-11-15 22:50:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:50:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-11-15 22:50:46,084 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-11-15 22:50:46,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:46,085 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-11-15 22:50:46,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:46,085 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-11-15 22:50:46,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:50:46,086 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:46,086 INFO L380 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] [2019-11-15 22:50:46,087 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:46,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:46,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2010828614, now seen corresponding path program 1 times [2019-11-15 22:50:46,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:46,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622559733] [2019-11-15 22:50:46,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:46,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:46,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:46,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622559733] [2019-11-15 22:50:46,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:46,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:46,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585854617] [2019-11-15 22:50:46,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:46,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:46,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:46,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:46,144 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-11-15 22:50:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:46,484 INFO L93 Difference]: Finished difference Result 499 states and 767 transitions. [2019-11-15 22:50:46,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:46,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:50:46,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:46,486 INFO L225 Difference]: With dead ends: 499 [2019-11-15 22:50:46,487 INFO L226 Difference]: Without dead ends: 284 [2019-11-15 22:50:46,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:46,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-15 22:50:46,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 234. [2019-11-15 22:50:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:50:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-11-15 22:50:46,494 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-11-15 22:50:46,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:46,494 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-11-15 22:50:46,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-11-15 22:50:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:50:46,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:46,495 INFO L380 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] [2019-11-15 22:50:46,495 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:46,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:46,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1947077233, now seen corresponding path program 1 times [2019-11-15 22:50:46,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:46,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662874640] [2019-11-15 22:50:46,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:46,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:46,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:46,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662874640] [2019-11-15 22:50:46,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:46,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:46,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467613857] [2019-11-15 22:50:46,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:46,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:46,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:46,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:46,562 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-11-15 22:50:47,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:47,016 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-11-15 22:50:47,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:47,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:50:47,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:47,019 INFO L225 Difference]: With dead ends: 497 [2019-11-15 22:50:47,019 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 22:50:47,019 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:47,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 22:50:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-11-15 22:50:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:50:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-11-15 22:50:47,026 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-11-15 22:50:47,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:47,026 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-11-15 22:50:47,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-11-15 22:50:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:50:47,028 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:47,028 INFO L380 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] [2019-11-15 22:50:47,028 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:47,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:47,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1807744591, now seen corresponding path program 1 times [2019-11-15 22:50:47,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:47,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785493148] [2019-11-15 22:50:47,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:47,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:47,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:47,095 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:47,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785493148] [2019-11-15 22:50:47,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:47,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:47,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328037274] [2019-11-15 22:50:47,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:47,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:47,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:47,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:47,096 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-11-15 22:50:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:47,553 INFO L93 Difference]: Finished difference Result 496 states and 760 transitions. [2019-11-15 22:50:47,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:47,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:50:47,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:47,556 INFO L225 Difference]: With dead ends: 496 [2019-11-15 22:50:47,556 INFO L226 Difference]: Without dead ends: 281 [2019-11-15 22:50:47,556 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-15 22:50:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 234. [2019-11-15 22:50:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 22:50:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-11-15 22:50:47,563 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-11-15 22:50:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:47,564 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-11-15 22:50:47,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-11-15 22:50:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:50:47,565 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:47,565 INFO L380 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] [2019-11-15 22:50:47,565 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:47,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:47,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1418559526, now seen corresponding path program 1 times [2019-11-15 22:50:47,566 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:47,566 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685321105] [2019-11-15 22:50:47,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:47,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:47,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:47,637 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 22:50:47,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685321105] [2019-11-15 22:50:47,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:47,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:50:47,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545077294] [2019-11-15 22:50:47,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:50:47,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:47,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:50:47,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:47,640 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-11-15 22:50:48,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:48,186 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-11-15 22:50:48,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:50:48,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-15 22:50:48,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:48,188 INFO L225 Difference]: With dead ends: 470 [2019-11-15 22:50:48,188 INFO L226 Difference]: Without dead ends: 255 [2019-11-15 22:50:48,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:50:48,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-15 22:50:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-11-15 22:50:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:50:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-11-15 22:50:48,198 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-11-15 22:50:48,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:48,198 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-11-15 22:50:48,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:50:48,199 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-11-15 22:50:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:50:48,200 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:48,200 INFO L380 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] [2019-11-15 22:50:48,200 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:48,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:48,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1593988851, now seen corresponding path program 1 times [2019-11-15 22:50:48,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:48,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657567498] [2019-11-15 22:50:48,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:48,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:48,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:48,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657567498] [2019-11-15 22:50:48,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:48,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:48,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413737809] [2019-11-15 22:50:48,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:48,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:48,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:48,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:48,272 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-11-15 22:50:48,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:48,656 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-11-15 22:50:48,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:48,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:50:48,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:48,658 INFO L225 Difference]: With dead ends: 512 [2019-11-15 22:50:48,658 INFO L226 Difference]: Without dead ends: 277 [2019-11-15 22:50:48,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-15 22:50:48,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-11-15 22:50:48,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:50:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-11-15 22:50:48,665 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-11-15 22:50:48,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:48,666 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-11-15 22:50:48,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:48,666 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-11-15 22:50:48,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 22:50:48,667 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:48,667 INFO L380 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] [2019-11-15 22:50:48,667 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:48,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:48,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2134134323, now seen corresponding path program 1 times [2019-11-15 22:50:48,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:48,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875808152] [2019-11-15 22:50:48,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:48,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:48,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:48,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875808152] [2019-11-15 22:50:48,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:48,728 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:48,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067709995] [2019-11-15 22:50:48,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:48,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:48,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:48,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:48,729 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-11-15 22:50:49,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:49,102 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-11-15 22:50:49,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:49,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 22:50:49,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:49,104 INFO L225 Difference]: With dead ends: 511 [2019-11-15 22:50:49,104 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 22:50:49,105 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 22:50:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 22:50:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:50:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-11-15 22:50:49,112 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-11-15 22:50:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:49,112 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-11-15 22:50:49,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-11-15 22:50:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 22:50:49,113 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:49,113 INFO L380 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] [2019-11-15 22:50:49,114 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:49,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:49,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1582169212, now seen corresponding path program 1 times [2019-11-15 22:50:49,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:49,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872585700] [2019-11-15 22:50:49,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:49,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:49,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:49,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872585700] [2019-11-15 22:50:49,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:49,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:49,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653836312] [2019-11-15 22:50:49,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:49,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:49,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:49,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:49,173 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-11-15 22:50:49,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:49,592 INFO L93 Difference]: Finished difference Result 536 states and 805 transitions. [2019-11-15 22:50:49,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:49,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 22:50:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:49,594 INFO L225 Difference]: With dead ends: 536 [2019-11-15 22:50:49,594 INFO L226 Difference]: Without dead ends: 301 [2019-11-15 22:50:49,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-15 22:50:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-15 22:50:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:50:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-11-15 22:50:49,602 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-11-15 22:50:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:49,603 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-11-15 22:50:49,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-11-15 22:50:49,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 22:50:49,604 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:49,604 INFO L380 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] [2019-11-15 22:50:49,604 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:49,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:49,605 INFO L82 PathProgramCache]: Analyzing trace with hash 356992834, now seen corresponding path program 1 times [2019-11-15 22:50:49,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:49,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179428619] [2019-11-15 22:50:49,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:49,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:49,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:49,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179428619] [2019-11-15 22:50:49,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:49,659 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:49,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414148133] [2019-11-15 22:50:49,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:49,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:49,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:49,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:49,660 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-11-15 22:50:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:50,043 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-11-15 22:50:50,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:50,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 22:50:50,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:50,045 INFO L225 Difference]: With dead ends: 511 [2019-11-15 22:50:50,046 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 22:50:50,046 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:50,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 22:50:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 22:50:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:50:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-11-15 22:50:50,053 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-11-15 22:50:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:50,053 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-11-15 22:50:50,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-11-15 22:50:50,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 22:50:50,055 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:50,055 INFO L380 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] [2019-11-15 22:50:50,055 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:50,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:50,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2129784979, now seen corresponding path program 1 times [2019-11-15 22:50:50,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:50,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125505759] [2019-11-15 22:50:50,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:50,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:50,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:50,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125505759] [2019-11-15 22:50:50,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:50,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:50,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541432329] [2019-11-15 22:50:50,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:50,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:50,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:50,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:50,125 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-11-15 22:50:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:50,532 INFO L93 Difference]: Finished difference Result 536 states and 801 transitions. [2019-11-15 22:50:50,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:50,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 22:50:50,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:50,535 INFO L225 Difference]: With dead ends: 536 [2019-11-15 22:50:50,535 INFO L226 Difference]: Without dead ends: 301 [2019-11-15 22:50:50,536 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-15 22:50:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-15 22:50:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:50:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-11-15 22:50:50,544 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-11-15 22:50:50,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:50,544 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-11-15 22:50:50,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-11-15 22:50:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 22:50:50,546 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:50,546 INFO L380 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] [2019-11-15 22:50:50,546 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:50,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:50,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2145303697, now seen corresponding path program 1 times [2019-11-15 22:50:50,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:50,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355185307] [2019-11-15 22:50:50,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:50,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:50,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:50,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355185307] [2019-11-15 22:50:50,613 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:50,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:50,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533490521] [2019-11-15 22:50:50,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:50,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:50,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:50,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:50,615 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-11-15 22:50:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:50,838 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-11-15 22:50:50,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:50,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 22:50:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:50,840 INFO L225 Difference]: With dead ends: 511 [2019-11-15 22:50:50,841 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 22:50:50,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:50,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 22:50:50,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 22:50:50,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:50:50,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-11-15 22:50:50,849 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-11-15 22:50:50,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:50,849 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-11-15 22:50:50,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:50,850 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-11-15 22:50:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 22:50:50,851 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:50,851 INFO L380 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] [2019-11-15 22:50:50,851 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:50,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:50,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1086928127, now seen corresponding path program 1 times [2019-11-15 22:50:50,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:50,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547558985] [2019-11-15 22:50:50,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:50,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:50,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:50,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547558985] [2019-11-15 22:50:50,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:50,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:50,907 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236612087] [2019-11-15 22:50:50,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:50,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:50,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:50,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:50,908 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-11-15 22:50:51,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:51,267 INFO L93 Difference]: Finished difference Result 536 states and 797 transitions. [2019-11-15 22:50:51,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:51,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 22:50:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:51,269 INFO L225 Difference]: With dead ends: 536 [2019-11-15 22:50:51,269 INFO L226 Difference]: Without dead ends: 301 [2019-11-15 22:50:51,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:51,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-15 22:50:51,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-15 22:50:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:50:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-11-15 22:50:51,279 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-11-15 22:50:51,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:51,279 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-11-15 22:50:51,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-11-15 22:50:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 22:50:51,280 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:51,281 INFO L380 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] [2019-11-15 22:50:51,281 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:51,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:51,281 INFO L82 PathProgramCache]: Analyzing trace with hash 605847869, now seen corresponding path program 1 times [2019-11-15 22:50:51,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:51,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022074603] [2019-11-15 22:50:51,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:51,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:51,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:51,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022074603] [2019-11-15 22:50:51,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:51,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:51,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566158546] [2019-11-15 22:50:51,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:51,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:51,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:51,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:51,377 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-11-15 22:50:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:51,747 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-11-15 22:50:51,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:51,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 22:50:51,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:51,749 INFO L225 Difference]: With dead ends: 511 [2019-11-15 22:50:51,749 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 22:50:51,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:51,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 22:50:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 22:50:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:50:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-11-15 22:50:51,757 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-11-15 22:50:51,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:51,757 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-11-15 22:50:51,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-11-15 22:50:51,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 22:50:51,759 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:51,759 INFO L380 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] [2019-11-15 22:50:51,759 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:51,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:51,759 INFO L82 PathProgramCache]: Analyzing trace with hash 738752008, now seen corresponding path program 1 times [2019-11-15 22:50:51,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:51,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035826858] [2019-11-15 22:50:51,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:51,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:51,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:51,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035826858] [2019-11-15 22:50:51,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:51,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:51,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798833415] [2019-11-15 22:50:51,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:51,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:51,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:51,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:51,818 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-11-15 22:50:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:52,160 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2019-11-15 22:50:52,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:52,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 22:50:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:52,163 INFO L225 Difference]: With dead ends: 526 [2019-11-15 22:50:52,163 INFO L226 Difference]: Without dead ends: 291 [2019-11-15 22:50:52,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:52,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-15 22:50:52,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-11-15 22:50:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:50:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-15 22:50:52,171 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-11-15 22:50:52,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:52,171 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-15 22:50:52,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:52,171 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-15 22:50:52,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 22:50:52,172 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:52,172 INFO L380 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] [2019-11-15 22:50:52,173 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:52,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:52,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1289834102, now seen corresponding path program 1 times [2019-11-15 22:50:52,173 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:52,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618473633] [2019-11-15 22:50:52,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:52,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:52,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:52,232 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:52,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618473633] [2019-11-15 22:50:52,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:52,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:52,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789200347] [2019-11-15 22:50:52,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:52,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:52,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:52,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:52,234 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-11-15 22:50:52,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:52,538 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-11-15 22:50:52,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:52,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 22:50:52,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:52,541 INFO L225 Difference]: With dead ends: 501 [2019-11-15 22:50:52,541 INFO L226 Difference]: Without dead ends: 266 [2019-11-15 22:50:52,541 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-15 22:50:52,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-11-15 22:50:52,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:50:52,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-11-15 22:50:52,548 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-11-15 22:50:52,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:52,548 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-11-15 22:50:52,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:52,549 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-11-15 22:50:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:50:52,550 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:52,550 INFO L380 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] [2019-11-15 22:50:52,550 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:52,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:52,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1110599922, now seen corresponding path program 1 times [2019-11-15 22:50:52,551 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:52,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494806097] [2019-11-15 22:50:52,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:52,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:52,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:52,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494806097] [2019-11-15 22:50:52,602 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:52,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:52,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248904173] [2019-11-15 22:50:52,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:52,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:52,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:52,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:52,604 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-11-15 22:50:52,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:52,945 INFO L93 Difference]: Finished difference Result 526 states and 777 transitions. [2019-11-15 22:50:52,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:52,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 22:50:52,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:52,947 INFO L225 Difference]: With dead ends: 526 [2019-11-15 22:50:52,947 INFO L226 Difference]: Without dead ends: 291 [2019-11-15 22:50:52,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-15 22:50:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-11-15 22:50:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 22:50:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-15 22:50:52,955 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-11-15 22:50:52,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:52,956 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-15 22:50:52,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-15 22:50:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 22:50:52,957 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:52,957 INFO L380 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] [2019-11-15 22:50:52,958 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:52,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:52,958 INFO L82 PathProgramCache]: Analyzing trace with hash 276185488, now seen corresponding path program 1 times [2019-11-15 22:50:52,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:52,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833134404] [2019-11-15 22:50:52,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:52,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:52,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:50:53,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833134404] [2019-11-15 22:50:53,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:53,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:53,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351250122] [2019-11-15 22:50:53,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:53,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:53,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:53,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:53,008 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-11-15 22:50:53,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:53,063 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-11-15 22:50:53,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:53,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-15 22:50:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:53,066 INFO L225 Difference]: With dead ends: 722 [2019-11-15 22:50:53,066 INFO L226 Difference]: Without dead ends: 487 [2019-11-15 22:50:53,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-15 22:50:53,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-11-15 22:50:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-15 22:50:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-11-15 22:50:53,080 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-11-15 22:50:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:53,080 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-11-15 22:50:53,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-11-15 22:50:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:50:53,082 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:53,082 INFO L380 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] [2019-11-15 22:50:53,082 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:53,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1173556134, now seen corresponding path program 1 times [2019-11-15 22:50:53,083 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:53,083 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795280482] [2019-11-15 22:50:53,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:53,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:53,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:50:53,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795280482] [2019-11-15 22:50:53,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:53,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:53,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998633377] [2019-11-15 22:50:53,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:53,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:53,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:53,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:53,133 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-11-15 22:50:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:53,190 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-11-15 22:50:53,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:53,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 22:50:53,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:53,194 INFO L225 Difference]: With dead ends: 1190 [2019-11-15 22:50:53,194 INFO L226 Difference]: Without dead ends: 722 [2019-11-15 22:50:53,195 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:53,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-15 22:50:53,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-11-15 22:50:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-15 22:50:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-11-15 22:50:53,215 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-11-15 22:50:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:53,216 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-11-15 22:50:53,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-11-15 22:50:53,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 22:50:53,218 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:53,218 INFO L380 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] [2019-11-15 22:50:53,218 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:53,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:53,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1028721671, now seen corresponding path program 1 times [2019-11-15 22:50:53,219 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:53,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415623742] [2019-11-15 22:50:53,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:53,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:53,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:50:53,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415623742] [2019-11-15 22:50:53,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:53,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:53,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218666321] [2019-11-15 22:50:53,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:53,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:53,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:53,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:53,279 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-11-15 22:50:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:53,376 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-11-15 22:50:53,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:53,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-15 22:50:53,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:53,381 INFO L225 Difference]: With dead ends: 1656 [2019-11-15 22:50:53,381 INFO L226 Difference]: Without dead ends: 955 [2019-11-15 22:50:53,382 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-15 22:50:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-11-15 22:50:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-15 22:50:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-11-15 22:50:53,409 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 104 [2019-11-15 22:50:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:53,410 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-11-15 22:50:53,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-11-15 22:50:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 22:50:53,412 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:53,412 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:50:53,413 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:53,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:53,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1513823389, now seen corresponding path program 1 times [2019-11-15 22:50:53,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:53,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001083386] [2019-11-15 22:50:53,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:53,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:53,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:50:53,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001083386] [2019-11-15 22:50:53,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:53,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:53,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314194542] [2019-11-15 22:50:53,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:53,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:53,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:53,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:53,507 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-11-15 22:50:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:53,575 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-11-15 22:50:53,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:53,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 22:50:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:53,581 INFO L225 Difference]: With dead ends: 2120 [2019-11-15 22:50:53,581 INFO L226 Difference]: Without dead ends: 1186 [2019-11-15 22:50:53,583 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-11-15 22:50:53,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-11-15 22:50:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-11-15 22:50:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-11-15 22:50:53,615 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 121 [2019-11-15 22:50:53,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:53,616 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-11-15 22:50:53,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:53,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-11-15 22:50:53,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 22:50:53,618 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:53,618 INFO L380 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] [2019-11-15 22:50:53,619 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:53,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:53,619 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2019-11-15 22:50:53,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:53,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957586784] [2019-11-15 22:50:53,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:53,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:53,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 22:50:53,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957586784] [2019-11-15 22:50:53,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:53,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:53,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376375848] [2019-11-15 22:50:53,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:53,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:53,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:53,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:53,680 INFO L87 Difference]: Start difference. First operand 1186 states and 1744 transitions. Second operand 3 states. [2019-11-15 22:50:53,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:53,747 INFO L93 Difference]: Finished difference Result 1423 states and 2089 transitions. [2019-11-15 22:50:53,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:53,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-15 22:50:53,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:53,755 INFO L225 Difference]: With dead ends: 1423 [2019-11-15 22:50:53,755 INFO L226 Difference]: Without dead ends: 1421 [2019-11-15 22:50:53,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:53,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-11-15 22:50:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1419. [2019-11-15 22:50:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-11-15 22:50:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2086 transitions. [2019-11-15 22:50:53,794 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2086 transitions. Word has length 127 [2019-11-15 22:50:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:53,795 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2086 transitions. [2019-11-15 22:50:53,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2086 transitions. [2019-11-15 22:50:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-15 22:50:53,798 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:53,798 INFO L380 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] [2019-11-15 22:50:53,798 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:53,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1090500354, now seen corresponding path program 1 times [2019-11-15 22:50:53,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:53,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413985589] [2019-11-15 22:50:53,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:53,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:53,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 22:50:53,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413985589] [2019-11-15 22:50:53,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:53,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:53,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37505101] [2019-11-15 22:50:53,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:53,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:53,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:53,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:53,877 INFO L87 Difference]: Start difference. First operand 1419 states and 2086 transitions. Second operand 4 states. [2019-11-15 22:50:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:54,356 INFO L93 Difference]: Finished difference Result 3197 states and 4729 transitions. [2019-11-15 22:50:54,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:54,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-15 22:50:54,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:54,366 INFO L225 Difference]: With dead ends: 3197 [2019-11-15 22:50:54,366 INFO L226 Difference]: Without dead ends: 1797 [2019-11-15 22:50:54,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2019-11-15 22:50:54,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1587. [2019-11-15 22:50:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2019-11-15 22:50:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2380 transitions. [2019-11-15 22:50:54,413 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2380 transitions. Word has length 163 [2019-11-15 22:50:54,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:54,413 INFO L462 AbstractCegarLoop]: Abstraction has 1587 states and 2380 transitions. [2019-11-15 22:50:54,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:54,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2380 transitions. [2019-11-15 22:50:54,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-15 22:50:54,417 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:54,417 INFO L380 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] [2019-11-15 22:50:54,418 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:54,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:54,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1035384371, now seen corresponding path program 1 times [2019-11-15 22:50:54,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:54,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795341339] [2019-11-15 22:50:54,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:54,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:54,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:50:54,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795341339] [2019-11-15 22:50:54,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810163872] [2019-11-15 22:50:54,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:50:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:55,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-15 22:50:55,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:50:55,226 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:55,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-15 22:50:55,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:50:55,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:55,265 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-11-15 22:50:55,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:55,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:55,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:55,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:55,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:55,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:55,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 22:50:55,312 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:50:55,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:55,355 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:50:55,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:55,509 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 22:50:55,509 INFO L375 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 7 case distinctions, treesize of input 52 treesize of output 46 [2019-11-15 22:50:55,510 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:50:55,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:55,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:50:55,524 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-15 22:50:55,600 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 22:50:55,600 INFO L375 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-11-15 22:50:55,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:50:55,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:55,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:50:55,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 22:50:55,660 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 22:50:55,661 INFO L375 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-11-15 22:50:55,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:50:55,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:55,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:50:55,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 22:50:55,675 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-11-15 22:50:55,677 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:50:55,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:55,751 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-15 22:50:55,751 INFO L375 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-11-15 22:50:55,752 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:50:55,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:55,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:50:55,761 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-15 22:50:55,793 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 22:50:55,794 INFO L375 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-11-15 22:50:55,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:50:55,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:55,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:50:55,801 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 22:50:55,848 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-15 22:50:55,849 INFO L375 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-11-15 22:50:55,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:50:55,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:55,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:50:55,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-15 22:50:55,876 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2019-11-15 22:50:55,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:55,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-15 22:50:55,882 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:50:55,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:56,131 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-11-15 22:50:56,131 INFO L341 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-11-15 22:50:56,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-15 22:50:56,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:56,197 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:50:56,318 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2019-11-15 22:50:56,318 INFO L567 ElimStorePlain]: treesize reduction 328, result has 32.9 percent of original size [2019-11-15 22:50:56,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 22:50:56,320 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:179 [2019-11-15 22:50:56,417 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2019-11-15 22:50:56,421 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:50:56,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:56,644 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 61 [2019-11-15 22:50:56,644 INFO L341 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-11-15 22:50:56,644 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2019-11-15 22:50:56,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:50:56,646 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:50:56,678 INFO L567 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-11-15 22:50:56,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:50:56,679 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-11-15 22:50:56,774 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 30=[|v_#memory_$Pointer$.base_170|]} [2019-11-15 22:50:56,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:50:56,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:50:56,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:56,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:56,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:56,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:56,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:56,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:56,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:57,034 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-11-15 22:50:57,034 INFO L341 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2019-11-15 22:50:57,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 207 [2019-11-15 22:50:57,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,042 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:50:57,144 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 40 [2019-11-15 22:50:57,145 INFO L567 ElimStorePlain]: treesize reduction 1037, result has 7.9 percent of original size [2019-11-15 22:50:57,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:50:57,145 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2019-11-15 22:50:57,198 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_179|], 20=[|v_#memory_$Pointer$.base_171|]} [2019-11-15 22:50:57,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-15 22:50:57,203 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:50:57,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:57,228 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-11-15 22:50:57,228 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:50:57,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:57,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:57,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:57,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:50:57,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:57,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-11-15 22:50:57,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:50:57,388 INFO L496 ElimStorePlain]: Start of recursive call 4: 22 dim-0 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2019-11-15 22:50:57,789 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 147 [2019-11-15 22:50:57,790 INFO L567 ElimStorePlain]: treesize reduction 540, result has 31.9 percent of original size [2019-11-15 22:50:57,793 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 22 dim-0 vars, and 1 xjuncts. [2019-11-15 22:50:57,793 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:165 [2019-11-15 22:50:57,884 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-15 22:50:57,884 INFO L375 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 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-15 22:50:57,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:50:57,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:57,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:50:57,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-11-15 22:50:57,939 INFO L341 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-15 22:50:57,940 INFO L375 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-11-15 22:50:57,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:50:57,950 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:50:57,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:50:57,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-11-15 22:50:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:50:58,369 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:50:58,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-15 22:50:58,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343041485] [2019-11-15 22:50:58,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:50:58,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:58,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:50:58,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:50:58,371 INFO L87 Difference]: Start difference. First operand 1587 states and 2380 transitions. Second operand 14 states. [2019-11-15 22:51:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:02,808 INFO L93 Difference]: Finished difference Result 7397 states and 11123 transitions. [2019-11-15 22:51:02,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:51:02,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 164 [2019-11-15 22:51:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:02,840 INFO L225 Difference]: With dead ends: 7397 [2019-11-15 22:51:02,841 INFO L226 Difference]: Without dead ends: 5829 [2019-11-15 22:51:02,844 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:51:02,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5829 states. [2019-11-15 22:51:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5829 to 3417. [2019-11-15 22:51:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2019-11-15 22:51:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 5271 transitions. [2019-11-15 22:51:02,999 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 5271 transitions. Word has length 164 [2019-11-15 22:51:02,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:02,999 INFO L462 AbstractCegarLoop]: Abstraction has 3417 states and 5271 transitions. [2019-11-15 22:51:02,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:51:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5271 transitions. [2019-11-15 22:51:03,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-15 22:51:03,008 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:03,008 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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] [2019-11-15 22:51:03,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:51:03,281 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:03,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:03,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2088210405, now seen corresponding path program 1 times [2019-11-15 22:51:03,282 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:03,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206452598] [2019-11-15 22:51:03,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:03,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:03,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:51:03,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206452598] [2019-11-15 22:51:03,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:03,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:03,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056027780] [2019-11-15 22:51:03,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:03,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:03,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:03,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:03,379 INFO L87 Difference]: Start difference. First operand 3417 states and 5271 transitions. Second operand 4 states. [2019-11-15 22:51:03,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:03,831 INFO L93 Difference]: Finished difference Result 7163 states and 10994 transitions. [2019-11-15 22:51:03,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:03,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-15 22:51:03,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:03,848 INFO L225 Difference]: With dead ends: 7163 [2019-11-15 22:51:03,848 INFO L226 Difference]: Without dead ends: 3765 [2019-11-15 22:51:03,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2019-11-15 22:51:03,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3417. [2019-11-15 22:51:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2019-11-15 22:51:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 5259 transitions. [2019-11-15 22:51:03,961 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 5259 transitions. Word has length 177 [2019-11-15 22:51:03,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:03,961 INFO L462 AbstractCegarLoop]: Abstraction has 3417 states and 5259 transitions. [2019-11-15 22:51:03,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5259 transitions. [2019-11-15 22:51:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-15 22:51:03,968 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:03,968 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2019-11-15 22:51:03,968 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:03,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:03,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2093282790, now seen corresponding path program 1 times [2019-11-15 22:51:03,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:03,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793591023] [2019-11-15 22:51:03,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:03,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:03,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-15 22:51:04,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793591023] [2019-11-15 22:51:04,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:04,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:04,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045483112] [2019-11-15 22:51:04,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:04,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:04,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:04,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:04,064 INFO L87 Difference]: Start difference. First operand 3417 states and 5259 transitions. Second operand 4 states. [2019-11-15 22:51:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:04,723 INFO L93 Difference]: Finished difference Result 7981 states and 12279 transitions. [2019-11-15 22:51:04,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:04,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-15 22:51:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:04,749 INFO L225 Difference]: With dead ends: 7981 [2019-11-15 22:51:04,749 INFO L226 Difference]: Without dead ends: 4583 [2019-11-15 22:51:04,754 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:04,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-11-15 22:51:04,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 3885. [2019-11-15 22:51:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2019-11-15 22:51:04,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 6111 transitions. [2019-11-15 22:51:04,873 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 6111 transitions. Word has length 178 [2019-11-15 22:51:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:04,874 INFO L462 AbstractCegarLoop]: Abstraction has 3885 states and 6111 transitions. [2019-11-15 22:51:04,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:04,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 6111 transitions. [2019-11-15 22:51:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-15 22:51:04,882 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:04,882 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1] [2019-11-15 22:51:04,882 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:04,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:04,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1031578742, now seen corresponding path program 1 times [2019-11-15 22:51:04,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:04,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163961976] [2019-11-15 22:51:04,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:04,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:04,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:51:04,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163961976] [2019-11-15 22:51:04,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:04,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:04,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842730694] [2019-11-15 22:51:04,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:04,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:04,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:04,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:04,972 INFO L87 Difference]: Start difference. First operand 3885 states and 6111 transitions. Second operand 4 states. [2019-11-15 22:51:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:05,547 INFO L93 Difference]: Finished difference Result 6227 states and 9705 transitions. [2019-11-15 22:51:05,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:05,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-15 22:51:05,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:05,555 INFO L225 Difference]: With dead ends: 6227 [2019-11-15 22:51:05,555 INFO L226 Difference]: Without dead ends: 4233 [2019-11-15 22:51:05,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:05,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-11-15 22:51:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 3885. [2019-11-15 22:51:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2019-11-15 22:51:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 6099 transitions. [2019-11-15 22:51:05,662 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 6099 transitions. Word has length 178 [2019-11-15 22:51:05,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:05,663 INFO L462 AbstractCegarLoop]: Abstraction has 3885 states and 6099 transitions. [2019-11-15 22:51:05,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 6099 transitions. [2019-11-15 22:51:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-15 22:51:05,671 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:05,671 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:51:05,672 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:05,672 INFO L82 PathProgramCache]: Analyzing trace with hash -474621622, now seen corresponding path program 1 times [2019-11-15 22:51:05,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:05,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111180975] [2019-11-15 22:51:05,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:05,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:05,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-15 22:51:05,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111180975] [2019-11-15 22:51:05,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:05,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:05,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037622254] [2019-11-15 22:51:05,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:05,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:05,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:05,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:05,773 INFO L87 Difference]: Start difference. First operand 3885 states and 6099 transitions. Second operand 4 states. [2019-11-15 22:51:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:06,446 INFO L93 Difference]: Finished difference Result 8399 states and 13032 transitions. [2019-11-15 22:51:06,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:06,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-15 22:51:06,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:06,456 INFO L225 Difference]: With dead ends: 8399 [2019-11-15 22:51:06,456 INFO L226 Difference]: Without dead ends: 4533 [2019-11-15 22:51:06,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:06,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2019-11-15 22:51:06,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 3765. [2019-11-15 22:51:06,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3765 states. [2019-11-15 22:51:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 5871 transitions. [2019-11-15 22:51:06,568 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 5871 transitions. Word has length 179 [2019-11-15 22:51:06,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:06,568 INFO L462 AbstractCegarLoop]: Abstraction has 3765 states and 5871 transitions. [2019-11-15 22:51:06,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 5871 transitions. [2019-11-15 22:51:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-15 22:51:06,577 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:06,577 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:51:06,577 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:06,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:06,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2087807271, now seen corresponding path program 1 times [2019-11-15 22:51:06,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:06,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490957313] [2019-11-15 22:51:06,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:06,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:06,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 22:51:06,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490957313] [2019-11-15 22:51:06,708 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:06,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:51:06,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109377154] [2019-11-15 22:51:06,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:51:06,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:06,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:51:06,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:06,709 INFO L87 Difference]: Start difference. First operand 3765 states and 5871 transitions. Second operand 5 states. [2019-11-15 22:51:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:07,242 INFO L93 Difference]: Finished difference Result 9049 states and 14119 transitions. [2019-11-15 22:51:07,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:07,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-11-15 22:51:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:07,252 INFO L225 Difference]: With dead ends: 9049 [2019-11-15 22:51:07,252 INFO L226 Difference]: Without dead ends: 5303 [2019-11-15 22:51:07,255 INFO L600 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-11-15 22:51:07,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5303 states. [2019-11-15 22:51:07,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5303 to 4239. [2019-11-15 22:51:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4239 states. [2019-11-15 22:51:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 6729 transitions. [2019-11-15 22:51:07,361 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 6729 transitions. Word has length 179 [2019-11-15 22:51:07,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:07,362 INFO L462 AbstractCegarLoop]: Abstraction has 4239 states and 6729 transitions. [2019-11-15 22:51:07,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:51:07,362 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 6729 transitions. [2019-11-15 22:51:07,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-15 22:51:07,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:07,371 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:51:07,371 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:07,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:07,371 INFO L82 PathProgramCache]: Analyzing trace with hash -728365523, now seen corresponding path program 2 times [2019-11-15 22:51:07,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:07,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720462156] [2019-11-15 22:51:07,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:07,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:07,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 22:51:07,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720462156] [2019-11-15 22:51:07,447 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:07,447 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:07,447 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126193182] [2019-11-15 22:51:07,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:07,448 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:07,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:07,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:07,448 INFO L87 Difference]: Start difference. First operand 4239 states and 6729 transitions. Second operand 4 states. [2019-11-15 22:51:07,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:07,983 INFO L93 Difference]: Finished difference Result 7579 states and 11932 transitions. [2019-11-15 22:51:07,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:07,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-15 22:51:07,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:08,005 INFO L225 Difference]: With dead ends: 7579 [2019-11-15 22:51:08,005 INFO L226 Difference]: Without dead ends: 5405 [2019-11-15 22:51:08,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:08,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2019-11-15 22:51:08,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 4383. [2019-11-15 22:51:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2019-11-15 22:51:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 6933 transitions. [2019-11-15 22:51:08,130 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 6933 transitions. Word has length 179 [2019-11-15 22:51:08,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:08,131 INFO L462 AbstractCegarLoop]: Abstraction has 4383 states and 6933 transitions. [2019-11-15 22:51:08,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 6933 transitions. [2019-11-15 22:51:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-15 22:51:08,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:08,138 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1] [2019-11-15 22:51:08,138 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:08,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:08,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1570855393, now seen corresponding path program 1 times [2019-11-15 22:51:08,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:08,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660354723] [2019-11-15 22:51:08,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:08,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:08,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:51:08,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660354723] [2019-11-15 22:51:08,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:08,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:08,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97736754] [2019-11-15 22:51:08,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:08,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:08,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:08,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:08,215 INFO L87 Difference]: Start difference. First operand 4383 states and 6933 transitions. Second operand 4 states. [2019-11-15 22:51:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:08,782 INFO L93 Difference]: Finished difference Result 6977 states and 10941 transitions. [2019-11-15 22:51:08,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:08,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-15 22:51:08,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:08,795 INFO L225 Difference]: With dead ends: 6977 [2019-11-15 22:51:08,796 INFO L226 Difference]: Without dead ends: 4731 [2019-11-15 22:51:08,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2019-11-15 22:51:08,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 4383. [2019-11-15 22:51:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2019-11-15 22:51:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 6921 transitions. [2019-11-15 22:51:08,917 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 6921 transitions. Word has length 179 [2019-11-15 22:51:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:08,918 INFO L462 AbstractCegarLoop]: Abstraction has 4383 states and 6921 transitions. [2019-11-15 22:51:08,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 6921 transitions. [2019-11-15 22:51:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-15 22:51:08,924 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:08,924 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:51:08,925 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:08,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:08,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1414237136, now seen corresponding path program 1 times [2019-11-15 22:51:08,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:08,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253253253] [2019-11-15 22:51:08,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:08,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:08,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 22:51:09,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253253253] [2019-11-15 22:51:09,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:09,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:09,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751874391] [2019-11-15 22:51:09,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:09,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:09,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:09,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:09,001 INFO L87 Difference]: Start difference. First operand 4383 states and 6921 transitions. Second operand 4 states. [2019-11-15 22:51:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:09,487 INFO L93 Difference]: Finished difference Result 7651 states and 12004 transitions. [2019-11-15 22:51:09,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:09,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-15 22:51:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:09,507 INFO L225 Difference]: With dead ends: 7651 [2019-11-15 22:51:09,507 INFO L226 Difference]: Without dead ends: 5405 [2019-11-15 22:51:09,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2019-11-15 22:51:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 4395. [2019-11-15 22:51:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4395 states. [2019-11-15 22:51:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 6933 transitions. [2019-11-15 22:51:09,633 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 6933 transitions. Word has length 180 [2019-11-15 22:51:09,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:09,634 INFO L462 AbstractCegarLoop]: Abstraction has 4395 states and 6933 transitions. [2019-11-15 22:51:09,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6933 transitions. [2019-11-15 22:51:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-15 22:51:09,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:09,641 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:51:09,641 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:09,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:09,641 INFO L82 PathProgramCache]: Analyzing trace with hash -304880533, now seen corresponding path program 1 times [2019-11-15 22:51:09,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:09,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137041589] [2019-11-15 22:51:09,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:09,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:09,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:09,808 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 22:51:09,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137041589] [2019-11-15 22:51:09,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:09,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:51:09,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771583613] [2019-11-15 22:51:09,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:51:09,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:09,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:51:09,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:09,811 INFO L87 Difference]: Start difference. First operand 4395 states and 6933 transitions. Second operand 5 states. [2019-11-15 22:51:10,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:10,369 INFO L93 Difference]: Finished difference Result 9973 states and 15697 transitions. [2019-11-15 22:51:10,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:10,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-11-15 22:51:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:10,374 INFO L225 Difference]: With dead ends: 9973 [2019-11-15 22:51:10,374 INFO L226 Difference]: Without dead ends: 5597 [2019-11-15 22:51:10,377 INFO L600 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-11-15 22:51:10,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2019-11-15 22:51:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 4263. [2019-11-15 22:51:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2019-11-15 22:51:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6753 transitions. [2019-11-15 22:51:10,499 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6753 transitions. Word has length 180 [2019-11-15 22:51:10,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:10,499 INFO L462 AbstractCegarLoop]: Abstraction has 4263 states and 6753 transitions. [2019-11-15 22:51:10,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:51:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6753 transitions. [2019-11-15 22:51:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-15 22:51:10,506 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:10,506 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1] [2019-11-15 22:51:10,506 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:10,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:10,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1891043653, now seen corresponding path program 1 times [2019-11-15 22:51:10,507 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:10,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062714860] [2019-11-15 22:51:10,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:10,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:10,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:51:10,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062714860] [2019-11-15 22:51:10,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:10,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:10,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147997854] [2019-11-15 22:51:10,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:10,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:10,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:10,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:10,578 INFO L87 Difference]: Start difference. First operand 4263 states and 6753 transitions. Second operand 4 states. [2019-11-15 22:51:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:11,008 INFO L93 Difference]: Finished difference Result 6797 states and 10671 transitions. [2019-11-15 22:51:11,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:11,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-15 22:51:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:11,012 INFO L225 Difference]: With dead ends: 6797 [2019-11-15 22:51:11,012 INFO L226 Difference]: Without dead ends: 4611 [2019-11-15 22:51:11,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4611 states. [2019-11-15 22:51:11,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4611 to 4263. [2019-11-15 22:51:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2019-11-15 22:51:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6741 transitions. [2019-11-15 22:51:11,135 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6741 transitions. Word has length 180 [2019-11-15 22:51:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:11,136 INFO L462 AbstractCegarLoop]: Abstraction has 4263 states and 6741 transitions. [2019-11-15 22:51:11,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6741 transitions. [2019-11-15 22:51:11,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-15 22:51:11,142 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:11,143 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:51:11,143 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:11,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:11,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1166712722, now seen corresponding path program 1 times [2019-11-15 22:51:11,143 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:11,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017318654] [2019-11-15 22:51:11,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:11,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:11,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 22:51:11,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017318654] [2019-11-15 22:51:11,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:11,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:11,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251097816] [2019-11-15 22:51:11,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:11,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:11,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:11,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:11,218 INFO L87 Difference]: Start difference. First operand 4263 states and 6741 transitions. Second operand 4 states. [2019-11-15 22:51:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:11,665 INFO L93 Difference]: Finished difference Result 7409 states and 11635 transitions. [2019-11-15 22:51:11,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:11,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-15 22:51:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:11,672 INFO L225 Difference]: With dead ends: 7409 [2019-11-15 22:51:11,672 INFO L226 Difference]: Without dead ends: 5223 [2019-11-15 22:51:11,674 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:11,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5223 states. [2019-11-15 22:51:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5223 to 4275. [2019-11-15 22:51:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-11-15 22:51:11,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6753 transitions. [2019-11-15 22:51:11,776 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6753 transitions. Word has length 181 [2019-11-15 22:51:11,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:11,777 INFO L462 AbstractCegarLoop]: Abstraction has 4275 states and 6753 transitions. [2019-11-15 22:51:11,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6753 transitions. [2019-11-15 22:51:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-15 22:51:11,784 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:11,784 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1] [2019-11-15 22:51:11,785 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:11,785 INFO L82 PathProgramCache]: Analyzing trace with hash 181086524, now seen corresponding path program 1 times [2019-11-15 22:51:11,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:11,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12492859] [2019-11-15 22:51:11,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:11,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:11,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:51:11,933 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12492859] [2019-11-15 22:51:11,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:11,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:11,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370746416] [2019-11-15 22:51:11,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:11,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:11,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:11,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:11,935 INFO L87 Difference]: Start difference. First operand 4275 states and 6753 transitions. Second operand 4 states. [2019-11-15 22:51:12,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:12,312 INFO L93 Difference]: Finished difference Result 6755 states and 10599 transitions. [2019-11-15 22:51:12,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:12,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-15 22:51:12,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:12,315 INFO L225 Difference]: With dead ends: 6755 [2019-11-15 22:51:12,315 INFO L226 Difference]: Without dead ends: 4563 [2019-11-15 22:51:12,317 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4563 states. [2019-11-15 22:51:12,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4563 to 4275. [2019-11-15 22:51:12,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-11-15 22:51:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6741 transitions. [2019-11-15 22:51:12,398 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6741 transitions. Word has length 181 [2019-11-15 22:51:12,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:12,399 INFO L462 AbstractCegarLoop]: Abstraction has 4275 states and 6741 transitions. [2019-11-15 22:51:12,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6741 transitions. [2019-11-15 22:51:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-15 22:51:12,403 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:12,403 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:51:12,403 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:12,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:12,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1939913077, now seen corresponding path program 1 times [2019-11-15 22:51:12,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:12,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014190005] [2019-11-15 22:51:12,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:12,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:12,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-15 22:51:12,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014190005] [2019-11-15 22:51:12,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:12,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:12,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072378365] [2019-11-15 22:51:12,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:12,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:12,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:12,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:12,479 INFO L87 Difference]: Start difference. First operand 4275 states and 6741 transitions. Second operand 4 states. [2019-11-15 22:51:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:13,151 INFO L93 Difference]: Finished difference Result 7355 states and 11539 transitions. [2019-11-15 22:51:13,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:13,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-15 22:51:13,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:13,156 INFO L225 Difference]: With dead ends: 7355 [2019-11-15 22:51:13,156 INFO L226 Difference]: Without dead ends: 5163 [2019-11-15 22:51:13,160 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2019-11-15 22:51:13,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 4287. [2019-11-15 22:51:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-15 22:51:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6753 transitions. [2019-11-15 22:51:13,286 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6753 transitions. Word has length 182 [2019-11-15 22:51:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:13,286 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6753 transitions. [2019-11-15 22:51:13,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6753 transitions. [2019-11-15 22:51:13,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-15 22:51:13,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:13,295 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:51:13,295 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:13,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:13,295 INFO L82 PathProgramCache]: Analyzing trace with hash 298033814, now seen corresponding path program 1 times [2019-11-15 22:51:13,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:13,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794813406] [2019-11-15 22:51:13,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:13,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:13,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:51:13,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794813406] [2019-11-15 22:51:13,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:13,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:13,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131965289] [2019-11-15 22:51:13,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:13,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:13,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:13,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:13,377 INFO L87 Difference]: Start difference. First operand 4287 states and 6753 transitions. Second operand 4 states. [2019-11-15 22:51:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:13,782 INFO L93 Difference]: Finished difference Result 8843 states and 13886 transitions. [2019-11-15 22:51:13,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:13,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-15 22:51:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:13,786 INFO L225 Difference]: With dead ends: 8843 [2019-11-15 22:51:13,786 INFO L226 Difference]: Without dead ends: 4575 [2019-11-15 22:51:13,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-11-15 22:51:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4287. [2019-11-15 22:51:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-15 22:51:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6741 transitions. [2019-11-15 22:51:13,873 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6741 transitions. Word has length 185 [2019-11-15 22:51:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:13,873 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6741 transitions. [2019-11-15 22:51:13,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6741 transitions. [2019-11-15 22:51:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-15 22:51:13,876 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:13,877 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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] [2019-11-15 22:51:13,877 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:13,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:13,877 INFO L82 PathProgramCache]: Analyzing trace with hash 104383426, now seen corresponding path program 1 times [2019-11-15 22:51:13,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:13,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297812189] [2019-11-15 22:51:13,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:13,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:13,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:13,999 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:51:13,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297812189] [2019-11-15 22:51:13,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:13,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:14,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808897921] [2019-11-15 22:51:14,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:14,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:14,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:14,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:14,001 INFO L87 Difference]: Start difference. First operand 4287 states and 6741 transitions. Second operand 4 states. [2019-11-15 22:51:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:14,541 INFO L93 Difference]: Finished difference Result 8843 states and 13862 transitions. [2019-11-15 22:51:14,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:14,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-15 22:51:14,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:14,546 INFO L225 Difference]: With dead ends: 8843 [2019-11-15 22:51:14,546 INFO L226 Difference]: Without dead ends: 4575 [2019-11-15 22:51:14,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-11-15 22:51:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4287. [2019-11-15 22:51:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-15 22:51:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6729 transitions. [2019-11-15 22:51:14,676 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6729 transitions. Word has length 185 [2019-11-15 22:51:14,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:14,676 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6729 transitions. [2019-11-15 22:51:14,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6729 transitions. [2019-11-15 22:51:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 22:51:14,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:14,680 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:51:14,681 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:14,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:14,681 INFO L82 PathProgramCache]: Analyzing trace with hash -556828801, now seen corresponding path program 1 times [2019-11-15 22:51:14,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:14,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218820931] [2019-11-15 22:51:14,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:14,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:14,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:51:14,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218820931] [2019-11-15 22:51:14,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:14,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:14,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058391291] [2019-11-15 22:51:14,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:14,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:14,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:14,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:14,759 INFO L87 Difference]: Start difference. First operand 4287 states and 6729 transitions. Second operand 4 states. [2019-11-15 22:51:15,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:15,204 INFO L93 Difference]: Finished difference Result 8795 states and 13772 transitions. [2019-11-15 22:51:15,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:15,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-15 22:51:15,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:15,208 INFO L225 Difference]: With dead ends: 8795 [2019-11-15 22:51:15,208 INFO L226 Difference]: Without dead ends: 4527 [2019-11-15 22:51:15,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4527 states. [2019-11-15 22:51:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4527 to 4287. [2019-11-15 22:51:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-15 22:51:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6717 transitions. [2019-11-15 22:51:15,297 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6717 transitions. Word has length 186 [2019-11-15 22:51:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:15,297 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6717 transitions. [2019-11-15 22:51:15,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:15,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6717 transitions. [2019-11-15 22:51:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 22:51:15,300 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:15,300 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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] [2019-11-15 22:51:15,300 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:15,300 INFO L82 PathProgramCache]: Analyzing trace with hash -829120181, now seen corresponding path program 1 times [2019-11-15 22:51:15,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:15,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995022843] [2019-11-15 22:51:15,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:15,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:15,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:51:15,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995022843] [2019-11-15 22:51:15,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:15,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:15,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782563530] [2019-11-15 22:51:15,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:15,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:15,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:15,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:15,387 INFO L87 Difference]: Start difference. First operand 4287 states and 6717 transitions. Second operand 4 states. [2019-11-15 22:51:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:15,739 INFO L93 Difference]: Finished difference Result 8735 states and 13670 transitions. [2019-11-15 22:51:15,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:15,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-15 22:51:15,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:15,743 INFO L225 Difference]: With dead ends: 8735 [2019-11-15 22:51:15,743 INFO L226 Difference]: Without dead ends: 4467 [2019-11-15 22:51:15,747 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2019-11-15 22:51:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 4287. [2019-11-15 22:51:15,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-15 22:51:15,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6705 transitions. [2019-11-15 22:51:15,853 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6705 transitions. Word has length 186 [2019-11-15 22:51:15,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:15,853 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6705 transitions. [2019-11-15 22:51:15,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:15,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6705 transitions. [2019-11-15 22:51:15,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-15 22:51:15,857 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:15,857 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:51:15,857 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:15,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:15,857 INFO L82 PathProgramCache]: Analyzing trace with hash 127197068, now seen corresponding path program 1 times [2019-11-15 22:51:15,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:15,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474028128] [2019-11-15 22:51:15,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:15,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:15,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 22:51:15,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474028128] [2019-11-15 22:51:15,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:15,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:15,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179665238] [2019-11-15 22:51:15,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:15,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:15,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:15,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:15,949 INFO L87 Difference]: Start difference. First operand 4287 states and 6705 transitions. Second operand 4 states. [2019-11-15 22:51:16,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:16,513 INFO L93 Difference]: Finished difference Result 9299 states and 14546 transitions. [2019-11-15 22:51:16,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:16,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-15 22:51:16,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:16,517 INFO L225 Difference]: With dead ends: 9299 [2019-11-15 22:51:16,517 INFO L226 Difference]: Without dead ends: 5031 [2019-11-15 22:51:16,520 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:16,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5031 states. [2019-11-15 22:51:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5031 to 4647. [2019-11-15 22:51:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4647 states. [2019-11-15 22:51:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4647 states to 4647 states and 7341 transitions. [2019-11-15 22:51:16,614 INFO L78 Accepts]: Start accepts. Automaton has 4647 states and 7341 transitions. Word has length 188 [2019-11-15 22:51:16,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:16,614 INFO L462 AbstractCegarLoop]: Abstraction has 4647 states and 7341 transitions. [2019-11-15 22:51:16,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 4647 states and 7341 transitions. [2019-11-15 22:51:16,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-15 22:51:16,617 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:16,617 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 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-11-15 22:51:16,618 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:16,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:16,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1739670347, now seen corresponding path program 1 times [2019-11-15 22:51:16,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:16,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441821466] [2019-11-15 22:51:16,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:16,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:16,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 22:51:16,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441821466] [2019-11-15 22:51:16,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:16,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:16,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299082227] [2019-11-15 22:51:16,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:16,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:16,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:16,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:16,698 INFO L87 Difference]: Start difference. First operand 4647 states and 7341 transitions. Second operand 4 states. [2019-11-15 22:51:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:17,063 INFO L93 Difference]: Finished difference Result 9455 states and 14918 transitions. [2019-11-15 22:51:17,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:17,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-15 22:51:17,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:17,067 INFO L225 Difference]: With dead ends: 9455 [2019-11-15 22:51:17,067 INFO L226 Difference]: Without dead ends: 4827 [2019-11-15 22:51:17,069 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2019-11-15 22:51:17,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 4647. [2019-11-15 22:51:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4647 states. [2019-11-15 22:51:17,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4647 states to 4647 states and 7329 transitions. [2019-11-15 22:51:17,182 INFO L78 Accepts]: Start accepts. Automaton has 4647 states and 7329 transitions. Word has length 190 [2019-11-15 22:51:17,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:17,182 INFO L462 AbstractCegarLoop]: Abstraction has 4647 states and 7329 transitions. [2019-11-15 22:51:17,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 4647 states and 7329 transitions. [2019-11-15 22:51:17,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-15 22:51:17,185 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:17,185 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 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-11-15 22:51:17,185 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:17,185 INFO L82 PathProgramCache]: Analyzing trace with hash 55283532, now seen corresponding path program 1 times [2019-11-15 22:51:17,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:17,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518500105] [2019-11-15 22:51:17,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:17,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:17,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-15 22:51:17,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518500105] [2019-11-15 22:51:17,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:17,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:17,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326174190] [2019-11-15 22:51:17,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:17,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:17,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:17,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:17,263 INFO L87 Difference]: Start difference. First operand 4647 states and 7329 transitions. Second operand 4 states. [2019-11-15 22:51:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:17,643 INFO L93 Difference]: Finished difference Result 9431 states and 14870 transitions. [2019-11-15 22:51:17,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:17,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-15 22:51:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:17,649 INFO L225 Difference]: With dead ends: 9431 [2019-11-15 22:51:17,649 INFO L226 Difference]: Without dead ends: 4803 [2019-11-15 22:51:17,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2019-11-15 22:51:17,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 4647. [2019-11-15 22:51:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4647 states. [2019-11-15 22:51:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4647 states to 4647 states and 7317 transitions. [2019-11-15 22:51:17,772 INFO L78 Accepts]: Start accepts. Automaton has 4647 states and 7317 transitions. Word has length 191 [2019-11-15 22:51:17,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:17,772 INFO L462 AbstractCegarLoop]: Abstraction has 4647 states and 7317 transitions. [2019-11-15 22:51:17,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:17,772 INFO L276 IsEmpty]: Start isEmpty. Operand 4647 states and 7317 transitions. [2019-11-15 22:51:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-15 22:51:17,775 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:17,775 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1] [2019-11-15 22:51:17,775 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash -24309129, now seen corresponding path program 1 times [2019-11-15 22:51:17,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:17,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650075155] [2019-11-15 22:51:17,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:17,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:17,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-15 22:51:17,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650075155] [2019-11-15 22:51:17,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:17,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:17,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900227840] [2019-11-15 22:51:17,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:17,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:17,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:17,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:17,849 INFO L87 Difference]: Start difference. First operand 4647 states and 7317 transitions. Second operand 4 states. [2019-11-15 22:51:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:18,287 INFO L93 Difference]: Finished difference Result 7637 states and 11943 transitions. [2019-11-15 22:51:18,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:18,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-15 22:51:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:18,291 INFO L225 Difference]: With dead ends: 7637 [2019-11-15 22:51:18,291 INFO L226 Difference]: Without dead ends: 5259 [2019-11-15 22:51:18,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:18,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2019-11-15 22:51:18,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 4719. [2019-11-15 22:51:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4719 states. [2019-11-15 22:51:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4719 states to 4719 states and 7413 transitions. [2019-11-15 22:51:18,455 INFO L78 Accepts]: Start accepts. Automaton has 4719 states and 7413 transitions. Word has length 192 [2019-11-15 22:51:18,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:18,455 INFO L462 AbstractCegarLoop]: Abstraction has 4719 states and 7413 transitions. [2019-11-15 22:51:18,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 4719 states and 7413 transitions. [2019-11-15 22:51:18,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 22:51:18,458 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:18,458 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1] [2019-11-15 22:51:18,458 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:18,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1063325402, now seen corresponding path program 1 times [2019-11-15 22:51:18,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:18,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093849202] [2019-11-15 22:51:18,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:18,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:18,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-15 22:51:18,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093849202] [2019-11-15 22:51:18,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:18,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:18,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100333066] [2019-11-15 22:51:18,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:18,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:18,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:18,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:18,529 INFO L87 Difference]: Start difference. First operand 4719 states and 7413 transitions. Second operand 4 states. [2019-11-15 22:51:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:18,948 INFO L93 Difference]: Finished difference Result 7637 states and 11925 transitions. [2019-11-15 22:51:18,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:18,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-15 22:51:18,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:18,953 INFO L225 Difference]: With dead ends: 7637 [2019-11-15 22:51:18,954 INFO L226 Difference]: Without dead ends: 5259 [2019-11-15 22:51:18,955 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2019-11-15 22:51:19,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 4725. [2019-11-15 22:51:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-15 22:51:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 7413 transitions. [2019-11-15 22:51:19,066 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 7413 transitions. Word has length 193 [2019-11-15 22:51:19,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:19,066 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 7413 transitions. [2019-11-15 22:51:19,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:19,066 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 7413 transitions. [2019-11-15 22:51:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 22:51:19,069 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:19,069 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 1] [2019-11-15 22:51:19,069 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:19,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:19,069 INFO L82 PathProgramCache]: Analyzing trace with hash 885688148, now seen corresponding path program 1 times [2019-11-15 22:51:19,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:19,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124274405] [2019-11-15 22:51:19,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:19,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:19,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:19,142 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 22:51:19,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124274405] [2019-11-15 22:51:19,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:19,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:51:19,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732028814] [2019-11-15 22:51:19,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:19,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:51:19,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:19,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:19,144 INFO L87 Difference]: Start difference. First operand 4725 states and 7413 transitions. Second operand 4 states. [2019-11-15 22:51:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:19,649 INFO L93 Difference]: Finished difference Result 8219 states and 12823 transitions. [2019-11-15 22:51:19,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:19,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-15 22:51:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:19,654 INFO L225 Difference]: With dead ends: 8219 [2019-11-15 22:51:19,654 INFO L226 Difference]: Without dead ends: 5841 [2019-11-15 22:51:19,656 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:51:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5841 states. [2019-11-15 22:51:19,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5841 to 4869. [2019-11-15 22:51:19,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4869 states. [2019-11-15 22:51:19,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 7617 transitions. [2019-11-15 22:51:19,760 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 7617 transitions. Word has length 193 [2019-11-15 22:51:19,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:19,760 INFO L462 AbstractCegarLoop]: Abstraction has 4869 states and 7617 transitions. [2019-11-15 22:51:19,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 7617 transitions. [2019-11-15 22:51:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-15 22:51:19,763 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:19,764 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:51:19,764 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:19,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:19,764 INFO L82 PathProgramCache]: Analyzing trace with hash 990290520, now seen corresponding path program 1 times [2019-11-15 22:51:19,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:51:19,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714422333] [2019-11-15 22:51:19,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:19,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:51:19,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:51:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:51:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:51:20,008 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:51:20,009 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:51:20,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:51:20 BoogieIcfgContainer [2019-11-15 22:51:20,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:51:20,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:51:20,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:51:20,137 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:51:20,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:50:33" (3/4) ... [2019-11-15 22:51:20,140 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:51:20,140 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:51:20,141 INFO L168 Benchmark]: Toolchain (without parser) took 48655.90 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 835.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 638.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:51:20,142 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:51:20,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:51:20,142 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:51:20,142 INFO L168 Benchmark]: Boogie Preprocessor took 136.41 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:51:20,143 INFO L168 Benchmark]: RCFGBuilder took 1300.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:51:20,143 INFO L168 Benchmark]: TraceAbstraction took 46324.99 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 671.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -109.8 MB). Peak memory consumption was 561.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:51:20,143 INFO L168 Benchmark]: Witness Printer took 4.10 ms. Allocated memory is still 1.9 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:51:20,145 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 779.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 136.41 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1300.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46324.99 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 671.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -109.8 MB). Peak memory consumption was 561.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.10 ms. Allocated memory is still 1.9 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: 1727]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-3:0}] [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 VAL [init=1, SSLv3_server_data={-3:0}] [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) VAL [init=1, SSLv3_server_data={-3:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-3:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-3:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-3:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={-3:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND TRUE s->state == 8656 [L1579] EXPR s->session [L1579] EXPR s->s3 [L1579] EXPR (s->s3)->tmp.new_cipher [L1579] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1580] COND FALSE !(! tmp___9) [L1586] ret = __VERIFIER_nondet_int() [L1587] COND TRUE blastFlag == 2 [L1588] blastFlag = 3 VAL [init=1, SSLv3_server_data={-3:0}] [L1592] COND FALSE !(ret <= 0) [L1597] s->state = 8672 [L1598] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1599] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-3:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1235] COND TRUE s->state == 8672 [L1608] ret = __VERIFIER_nondet_int() [L1609] COND TRUE blastFlag == 3 [L1610] blastFlag = 4 VAL [init=1, SSLv3_server_data={-3:0}] [L1614] COND FALSE !(ret <= 0) [L1619] s->state = 8448 [L1620] s->hit VAL [init=1, SSLv3_server_data={-3:0}] [L1620] COND TRUE s->hit [L1621] EXPR s->s3 [L1621] (s->s3)->tmp.next_state = 8640 [L1625] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={-3:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND TRUE s->state == 8640 [L1559] ret = __VERIFIER_nondet_int() [L1560] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={-3:0}] [L1727] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 46.2s, OverallIterations: 71, TraceHistogramMax: 8, AutomataDifference: 32.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 15220 SDtfs, 5733 SDslu, 22785 SDs, 0 SdLazy, 15387 SolverSat, 921 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 567 GetRequests, 311 SyntacticMatches, 38 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4869occurred in iteration=70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 70 MinimizatonAttempts, 16905 StatesRemovedByMinimization, 68 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 8375 NumberOfCodeBlocks, 8375 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 8111 ConstructedInterpolants, 80 QuantifiedInterpolants, 4122067 SizeOfPredicates, 13 NumberOfNonLiveVariables, 603 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 71 InterpolantComputations, 69 PerfectInterpolantSequences, 9360/9630 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... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 22:51:22,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:51:22,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:51:22,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:51:22,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:51:22,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:51:22,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:51:22,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:51:22,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:51:22,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:51:22,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:51:22,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:51:22,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:51:22,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:51:22,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:51:22,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:51:22,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:51:22,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:51:22,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:51:22,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:51:22,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:51:22,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:51:22,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:51:22,188 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:51:22,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:51:22,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:51:22,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:51:22,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:51:22,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:51:22,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:51:22,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:51:22,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:51:22,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:51:22,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:51:22,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:51:22,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:51:22,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:51:22,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:51:22,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:51:22,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:51:22,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:51:22,200 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 22:51:22,213 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:51:22,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:51:22,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:51:22,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:51:22,214 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:51:22,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:51:22,215 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:51:22,215 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:51:22,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:51:22,216 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:51:22,216 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:51:22,216 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:51:22,216 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:51:22,216 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:51:22,217 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:51:22,217 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:51:22,217 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:51:22,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:51:22,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:51:22,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:51:22,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:51:22,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:51:22,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:51:22,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:51:22,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:51:22,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:51:22,219 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:51:22,219 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:51:22,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:51:22,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:51:22,220 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_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/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 -> 17194510d9b99ec25b25421f731ec156f7460313 [2019-11-15 22:51:22,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:51:22,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:51:22,286 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:51:22,287 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:51:22,288 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:51:22,288 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c [2019-11-15 22:51:22,343 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/data/f16784456/0b2e7533c65649428997dbd9f311c2db/FLAG26da13fc1 [2019-11-15 22:51:22,820 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:51:22,827 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c [2019-11-15 22:51:22,859 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/data/f16784456/0b2e7533c65649428997dbd9f311c2db/FLAG26da13fc1 [2019-11-15 22:51:23,073 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/data/f16784456/0b2e7533c65649428997dbd9f311c2db [2019-11-15 22:51:23,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:51:23,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:51:23,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:51:23,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:51:23,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:51:23,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:51:23" (1/1) ... [2019-11-15 22:51:23,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34da0011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:51:23, skipping insertion in model container [2019-11-15 22:51:23,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:51:23" (1/1) ... [2019-11-15 22:51:23,095 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:51:23,172 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:51:23,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:51:23,772 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:51:23,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:51:23,928 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:51:23,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:51:23 WrapperNode [2019-11-15 22:51:23,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:51:23,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:51:23,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:51:23,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:51:23,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:51:23" (1/1) ... [2019-11-15 22:51:23,978 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:51:23" (1/1) ... [2019-11-15 22:51:24,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:51:24,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:51:24,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:51:24,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:51:24,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:51:23" (1/1) ... [2019-11-15 22:51:24,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:51:23" (1/1) ... [2019-11-15 22:51:24,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:51:23" (1/1) ... [2019-11-15 22:51:24,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:51:23" (1/1) ... [2019-11-15 22:51:24,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:51:23" (1/1) ... [2019-11-15 22:51:24,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:51:23" (1/1) ... [2019-11-15 22:51:24,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:51:23" (1/1) ... [2019-11-15 22:51:24,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:51:24,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:51:24,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:51:24,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:51:24,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:51:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:51:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:51:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:51:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:51:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:51:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:51:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:51:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:51:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:51:24,571 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:51:27,031 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 22:51:27,031 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 22:51:27,032 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:51:27,034 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:51:27,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:51:27 BoogieIcfgContainer [2019-11-15 22:51:27,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:51:27,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:51:27,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:51:27,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:51:27,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:51:23" (1/3) ... [2019-11-15 22:51:27,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102e3ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:51:27, skipping insertion in model container [2019-11-15 22:51:27,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:51:23" (2/3) ... [2019-11-15 22:51:27,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102e3ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:51:27, skipping insertion in model container [2019-11-15 22:51:27,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:51:27" (3/3) ... [2019-11-15 22:51:27,040 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-2.c [2019-11-15 22:51:27,047 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:51:27,058 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:51:27,067 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:51:27,086 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:51:27,086 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:51:27,086 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:51:27,087 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:51:27,087 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:51:27,087 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:51:27,087 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:51:27,087 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:51:27,111 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 22:51:27,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 22:51:27,119 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:27,120 INFO L380 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] [2019-11-15 22:51:27,122 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:27,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:27,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-11-15 22:51:27,138 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:51:27,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [476862546] [2019-11-15 22:51:27,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:51:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:27,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:51:27,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:51:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:51:27,388 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:51:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:51:27,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [476862546] [2019-11-15 22:51:27,417 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:27,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:51:27,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000273348] [2019-11-15 22:51:27,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:27,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:51:27,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:27,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:27,440 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-15 22:51:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:27,697 INFO L93 Difference]: Finished difference Result 564 states and 962 transitions. [2019-11-15 22:51:27,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:27,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 22:51:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:27,731 INFO L225 Difference]: With dead ends: 564 [2019-11-15 22:51:27,731 INFO L226 Difference]: Without dead ends: 385 [2019-11-15 22:51:27,736 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-15 22:51:27,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-11-15 22:51:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-15 22:51:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2019-11-15 22:51:27,827 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 35 [2019-11-15 22:51:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:27,828 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2019-11-15 22:51:27,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2019-11-15 22:51:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 22:51:27,832 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:27,832 INFO L380 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] [2019-11-15 22:51:28,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:51:28,040 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:28,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1008290477, now seen corresponding path program 1 times [2019-11-15 22:51:28,041 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:51:28,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1760331281] [2019-11-15 22:51:28,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:51:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:28,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:51:28,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:51:28,296 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:51:28,296 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:51:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:51:28,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1760331281] [2019-11-15 22:51:28,320 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:28,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:51:28,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082379388] [2019-11-15 22:51:28,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:28,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:51:28,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:28,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:28,323 INFO L87 Difference]: Start difference. First operand 383 states and 584 transitions. Second operand 4 states. [2019-11-15 22:51:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:28,812 INFO L93 Difference]: Finished difference Result 878 states and 1351 transitions. [2019-11-15 22:51:28,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:28,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 22:51:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:28,819 INFO L225 Difference]: With dead ends: 878 [2019-11-15 22:51:28,819 INFO L226 Difference]: Without dead ends: 627 [2019-11-15 22:51:28,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-11-15 22:51:28,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 625. [2019-11-15 22:51:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-11-15 22:51:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 948 transitions. [2019-11-15 22:51:28,885 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 948 transitions. Word has length 58 [2019-11-15 22:51:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:28,887 INFO L462 AbstractCegarLoop]: Abstraction has 625 states and 948 transitions. [2019-11-15 22:51:28,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 948 transitions. [2019-11-15 22:51:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-15 22:51:28,899 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:28,900 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:51:29,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:51:29,102 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:29,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:29,102 INFO L82 PathProgramCache]: Analyzing trace with hash 647290871, now seen corresponding path program 1 times [2019-11-15 22:51:29,103 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:51:29,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1788921425] [2019-11-15 22:51:29,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:51:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:29,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:51:29,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:51:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:51:29,418 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:51:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:51:29,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1788921425] [2019-11-15 22:51:29,457 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:29,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:51:29,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751297102] [2019-11-15 22:51:29,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:29,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:51:29,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:29,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:29,460 INFO L87 Difference]: Start difference. First operand 625 states and 948 transitions. Second operand 4 states. [2019-11-15 22:51:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:30,337 INFO L93 Difference]: Finished difference Result 1364 states and 2081 transitions. [2019-11-15 22:51:30,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:30,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-15 22:51:30,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:30,344 INFO L225 Difference]: With dead ends: 1364 [2019-11-15 22:51:30,344 INFO L226 Difference]: Without dead ends: 871 [2019-11-15 22:51:30,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2019-11-15 22:51:30,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2019-11-15 22:51:30,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2019-11-15 22:51:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1319 transitions. [2019-11-15 22:51:30,386 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1319 transitions. Word has length 110 [2019-11-15 22:51:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:30,387 INFO L462 AbstractCegarLoop]: Abstraction has 871 states and 1319 transitions. [2019-11-15 22:51:30,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1319 transitions. [2019-11-15 22:51:30,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-15 22:51:30,395 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:30,396 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:51:30,598 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:51:30,599 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:30,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:30,599 INFO L82 PathProgramCache]: Analyzing trace with hash 349104543, now seen corresponding path program 1 times [2019-11-15 22:51:30,601 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:51:30,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1457395536] [2019-11-15 22:51:30,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:51:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:30,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:51:30,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:51:30,933 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:51:30,933 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:51:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:51:30,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1457395536] [2019-11-15 22:51:30,972 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:51:30,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:51:30,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498759027] [2019-11-15 22:51:30,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:30,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:51:30,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:30,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:30,974 INFO L87 Difference]: Start difference. First operand 871 states and 1319 transitions. Second operand 4 states. [2019-11-15 22:51:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:31,618 INFO L93 Difference]: Finished difference Result 1856 states and 2820 transitions. [2019-11-15 22:51:31,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:31,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-15 22:51:31,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:31,626 INFO L225 Difference]: With dead ends: 1856 [2019-11-15 22:51:31,626 INFO L226 Difference]: Without dead ends: 1117 [2019-11-15 22:51:31,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:51:31,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-11-15 22:51:31,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1117. [2019-11-15 22:51:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2019-11-15 22:51:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1686 transitions. [2019-11-15 22:51:31,687 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1686 transitions. Word has length 147 [2019-11-15 22:51:31,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:31,688 INFO L462 AbstractCegarLoop]: Abstraction has 1117 states and 1686 transitions. [2019-11-15 22:51:31,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1686 transitions. [2019-11-15 22:51:31,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-15 22:51:31,693 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:31,693 INFO L380 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] [2019-11-15 22:51:31,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:51:31,896 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:31,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:31,897 INFO L82 PathProgramCache]: Analyzing trace with hash 959908544, now seen corresponding path program 1 times [2019-11-15 22:51:31,898 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:51:31,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2090377589] [2019-11-15 22:51:31,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:51:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:34,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:51:34,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:51:34,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:34,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:51:34,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:51:34,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:34,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:51:34,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:51:34,635 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:34,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:51:34,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:51:34,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:34,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:51:34,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:51:34,703 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 22:51:34,703 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:51:34,748 INFO L375 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 18 [2019-11-15 22:51:34,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:51:34,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:34,757 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:51:34,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:34,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:51:34,758 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 22:51:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 22:51:34,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2090377589] [2019-11-15 22:51:34,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:51:34,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:51:34,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233927061] [2019-11-15 22:51:34,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:34,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:51:34,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:34,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:51:34,811 INFO L87 Difference]: Start difference. First operand 1117 states and 1686 transitions. Second operand 4 states. [2019-11-15 22:51:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:39,070 INFO L93 Difference]: Finished difference Result 3269 states and 4957 transitions. [2019-11-15 22:51:39,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:39,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-15 22:51:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:39,085 INFO L225 Difference]: With dead ends: 3269 [2019-11-15 22:51:39,086 INFO L226 Difference]: Without dead ends: 2160 [2019-11-15 22:51:39,088 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:51:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2019-11-15 22:51:39,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 1369. [2019-11-15 22:51:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2019-11-15 22:51:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2136 transitions. [2019-11-15 22:51:39,158 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2136 transitions. Word has length 163 [2019-11-15 22:51:39,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:39,159 INFO L462 AbstractCegarLoop]: Abstraction has 1369 states and 2136 transitions. [2019-11-15 22:51:39,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2136 transitions. [2019-11-15 22:51:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-15 22:51:39,163 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:39,164 INFO L380 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:51:39,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:51:39,385 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:39,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:39,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2081031755, now seen corresponding path program 1 times [2019-11-15 22:51:39,387 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:51:39,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [156050463] [2019-11-15 22:51:39,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:51:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:42,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:51:42,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:51:42,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:42,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 22:51:42,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:51:42,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:42,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:51:42,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 22:51:42,163 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:42,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 22:51:42,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:51:42,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:42,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:51:42,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 22:51:42,220 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 91 proven. 1 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 22:51:42,221 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:51:42,268 INFO L375 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 18 [2019-11-15 22:51:42,276 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:51:42,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:42,277 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:51:42,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:42,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:51:42,279 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 22:51:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 22:51:42,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [156050463] [2019-11-15 22:51:42,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:51:42,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 22:51:42,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54642041] [2019-11-15 22:51:42,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:51:42,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:51:42,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:51:42,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:51:42,311 INFO L87 Difference]: Start difference. First operand 1369 states and 2136 transitions. Second operand 4 states. [2019-11-15 22:51:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:51:48,012 INFO L93 Difference]: Finished difference Result 3773 states and 5857 transitions. [2019-11-15 22:51:48,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:51:48,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-15 22:51:48,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:51:48,027 INFO L225 Difference]: With dead ends: 3773 [2019-11-15 22:51:48,028 INFO L226 Difference]: Without dead ends: 2412 [2019-11-15 22:51:48,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:51:48,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2019-11-15 22:51:48,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 1630. [2019-11-15 22:51:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2019-11-15 22:51:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2604 transitions. [2019-11-15 22:51:48,108 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2604 transitions. Word has length 164 [2019-11-15 22:51:48,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:51:48,108 INFO L462 AbstractCegarLoop]: Abstraction has 1630 states and 2604 transitions. [2019-11-15 22:51:48,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:51:48,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2604 transitions. [2019-11-15 22:51:48,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-15 22:51:48,113 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:51:48,113 INFO L380 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] [2019-11-15 22:51:48,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:51:48,328 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:51:48,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:51:48,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1035384371, now seen corresponding path program 1 times [2019-11-15 22:51:48,329 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:51:48,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [932741362] [2019-11-15 22:51:48,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43b816f0-8bd6-462a-9da4-835c7d9b5b9b/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:51:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:51:50,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 22:51:50,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:51:50,509 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:50,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-15 22:51:50,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:51:50,905 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-15 22:51:50,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:50,908 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_178|], 2=[|v_#memory_$Pointer$.base_174|, |v_#memory_$Pointer$.base_175|]} [2019-11-15 22:51:50,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:50,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:50,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:50,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:50,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:50,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-15 22:51:51,037 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:51:51,236 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-15 22:51:51,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:51,243 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:51:51,403 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-15 22:51:51,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:51,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-15 22:51:51,429 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:51:51,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:51,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:51:51,476 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-15 22:51:51,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,523 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:51,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:51:51,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:51:51,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:51,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:51:51,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 22:51:51,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,583 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:51,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:51:51,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:51:51,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:51,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:51:51,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 22:51:51,632 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_176|], 12=[|v_#memory_$Pointer$.base_181|]} [2019-11-15 22:51:51,640 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:51:51,781 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-15 22:51:51,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:51,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,805 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:51,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 53 [2019-11-15 22:51:51,806 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:51:51,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:51,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:51:51,842 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-15 22:51:51,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,873 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:51,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:51:51,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:51:51,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:51,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:51:51,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 22:51:51,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,930 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:51,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-15 22:51:51,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:51:51,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:51,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:51:51,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-15 22:51:51,961 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_174|], 20=[|v_#memory_$Pointer$.base_184|]} [2019-11-15 22:51:51,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:51,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-11-15 22:51:51,977 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:51:52,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:51:52,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:52,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:52,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:51:52,738 WARN L191 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-11-15 22:51:52,739 INFO L341 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-15 22:51:52,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-15 22:51:52,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:51:52,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:52,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:51:53,057 INFO L496 ElimStorePlain]: Start of recursive call 3: 58 dim-0 vars, End of recursive call: 58 dim-0 vars, and 39 xjuncts. [2019-11-15 22:52:06,556 WARN L191 SmtUtils]: Spent 13.50 s on a formula simplification. DAG size of input: 1009 DAG size of output: 395 [2019-11-15 22:52:06,557 INFO L567 ElimStorePlain]: treesize reduction 8921, result has 26.8 percent of original size [2019-11-15 22:52:06,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:52:06,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:52:06,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:52:06,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:52:06,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:52:06,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:52:06,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:52:06,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:52:06,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:52:06,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:52:06,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 62 dim-0 vars, and 1 xjuncts. [2019-11-15 22:52:06,588 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:3378 [2019-11-15 22:52:09,335 WARN L191 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 501 DAG size of output: 37 [2019-11-15 22:52:09,344 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_177|], 30=[|v_#memory_$Pointer$.base_185|]} [2019-11-15 22:52:09,360 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:52:09,535 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 22:52:09,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:52:09,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:52:09,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:52:09,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:52:09,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:52:09,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:52:09,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:52:09,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:52:09,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:52:09,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:52:09,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:52:42,840 WARN L191 SmtUtils]: Spent 33.29 s on a formula simplification. DAG size of input: 98 DAG size of output: 98 [2019-11-15 22:52:42,841 INFO L341 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-15 22:52:42,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 104 treesize of output 338 [2019-11-15 22:52:42,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:52:42,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:52:42,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:52:42,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:52:42,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:52:42,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:52:42,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:52:42,851 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:52:49,636 WARN L191 SmtUtils]: Spent 6.78 s on a formula simplification. DAG size of input: 127 DAG size of output: 40 [2019-11-15 22:52:49,636 INFO L567 ElimStorePlain]: treesize reduction 1704, result has 5.1 percent of original size [2019-11-15 22:52:49,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:52:49,637 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-15 22:52:49,680 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_196|], 30=[|v_#memory_$Pointer$.base_186|]} [2019-11-15 22:52:49,705 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 22:52:49,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:52:49,828 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 22:52:49,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:52:49,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:52:49,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:52:49,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:52:49,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:52:49,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:52:49,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:53:06,391 WARN L191 SmtUtils]: Spent 16.55 s on a formula simplification that was a NOOP. DAG size: 85 [2019-11-15 22:53:06,391 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:53:06,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 263 [2019-11-15 22:53:06,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:06,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:06,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:06,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:06,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:06,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:06,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:06,400 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:53:06,642 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 42 [2019-11-15 22:53:06,642 INFO L567 ElimStorePlain]: treesize reduction 1122, result has 7.6 percent of original size [2019-11-15 22:53:06,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:53:06,643 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-15 22:53:06,699 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_175|], 2=[|v_#memory_int_197|], 20=[|v_#memory_$Pointer$.base_187|]} [2019-11-15 22:53:06,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-15 22:53:06,713 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:53:06,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:53:06,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-11-15 22:53:06,782 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:53:06,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:53:06,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:53:06,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:53:06,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:53:07,031 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 22:53:07,031 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:53:07,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-11-15 22:53:07,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:53:07,117 INFO L496 ElimStorePlain]: Start of recursive call 4: 13 dim-0 vars, End of recursive call: 17 dim-0 vars, and 8 xjuncts. [2019-11-15 22:53:07,978 WARN L191 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 116 [2019-11-15 22:53:07,978 INFO L567 ElimStorePlain]: treesize reduction 432, result has 31.0 percent of original size [2019-11-15 22:53:07,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 16 dim-0 vars, and 1 xjuncts. [2019-11-15 22:53:07,981 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:130 [2019-11-15 22:53:08,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:53:08,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-15 22:53:08,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:53:08,128 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:53:08,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:53:08,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-15 22:53:08,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-15 22:53:08,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:53:08,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:53:08,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:53:08,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-15 22:53:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:53:08,597 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:53:08,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-15 22:53:08,686 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:53:08,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:53:08,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:53:08,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-15 22:53:08,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:53:08,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:53:09,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:53:09,032 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:53:09,036 INFO L168 Benchmark]: Toolchain (without parser) took 105959.00 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.9 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -196.1 MB). Peak memory consumption was 157.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:09,037 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:53:09,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:09,037 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.95 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-11-15 22:53:09,038 INFO L168 Benchmark]: Boogie Preprocessor took 123.07 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:09,038 INFO L168 Benchmark]: RCFGBuilder took 2872.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:09,038 INFO L168 Benchmark]: TraceAbstraction took 101999.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -138.9 MB). Peak memory consumption was 70.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:09,047 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 848.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -169.5 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.95 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 123.07 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2872.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.2 MB). Peak memory consumption was 92.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 101999.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 209.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -138.9 MB). Peak memory consumption was 70.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...