./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.10.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_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/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 24241c008259f315336df16b66c76f690577877c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/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 24241c008259f315336df16b66c76f690577877c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:37:29,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:37:29,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:37:29,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:37:29,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:37:29,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:37:29,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:37:29,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:37:29,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:37:29,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:37:29,790 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:37:29,792 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:37:29,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:37:29,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:37:29,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:37:29,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:37:29,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:37:29,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:37:29,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:37:29,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:37:29,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:37:29,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:37:29,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:37:29,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:37:29,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:37:29,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:37:29,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:37:29,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:37:29,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:37:29,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:37:29,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:37:29,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:37:29,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:37:29,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:37:29,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:37:29,815 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:37:29,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:37:29,816 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:37:29,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:37:29,817 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:37:29,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:37:29,819 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:37:29,832 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:37:29,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:37:29,834 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:37:29,834 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:37:29,834 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:37:29,834 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:37:29,835 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:37:29,835 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:37:29,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:37:29,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:37:29,836 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:37:29,836 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:37:29,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:37:29,836 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:37:29,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:37:29,837 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:37:29,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:37:29,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:37:29,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:37:29,838 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:37:29,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:37:29,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:37:29,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:37:29,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:37:29,839 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:37:29,839 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:37:29,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:37:29,840 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:37:29,840 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_025e5793-902c-482c-8ddc-5a1906b7a127/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 -> 24241c008259f315336df16b66c76f690577877c [2019-11-16 00:37:29,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:37:29,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:37:29,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:37:29,881 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:37:29,881 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:37:29,882 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c [2019-11-16 00:37:29,933 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/data/d849dd515/e8886b3214ce42fb8ae0e03f846c8a67/FLAG7001cd3d0 [2019-11-16 00:37:30,449 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:37:30,458 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c [2019-11-16 00:37:30,492 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/data/d849dd515/e8886b3214ce42fb8ae0e03f846c8a67/FLAG7001cd3d0 [2019-11-16 00:37:30,669 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/data/d849dd515/e8886b3214ce42fb8ae0e03f846c8a67 [2019-11-16 00:37:30,672 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:37:30,673 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:37:30,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:30,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:37:30,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:37:30,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:30" (1/1) ... [2019-11-16 00:37:30,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e9de890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:30, skipping insertion in model container [2019-11-16 00:37:30,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:30" (1/1) ... [2019-11-16 00:37:30,687 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:37:30,757 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:37:31,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:31,265 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:37:31,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:31,400 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:37:31,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:31 WrapperNode [2019-11-16 00:37:31,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:31,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:37:31,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:37:31,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:37:31,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:31" (1/1) ... [2019-11-16 00:37:31,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:31" (1/1) ... [2019-11-16 00:37:31,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:37:31,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:37:31,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:37:31,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:37:31,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:31" (1/1) ... [2019-11-16 00:37:31,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:31" (1/1) ... [2019-11-16 00:37:31,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:31" (1/1) ... [2019-11-16 00:37:31,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:31" (1/1) ... [2019-11-16 00:37:31,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:31" (1/1) ... [2019-11-16 00:37:31,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:31" (1/1) ... [2019-11-16 00:37:31,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:31" (1/1) ... [2019-11-16 00:37:31,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:37:31,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:37:31,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:37:31,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:37:31,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/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-16 00:37:31,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:37:31,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:37:31,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:37:31,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:37:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:37:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:37:31,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:37:31,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:37:32,046 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:37:32,925 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-16 00:37:32,926 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-16 00:37:32,927 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:37:32,927 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:37:32,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:32 BoogieIcfgContainer [2019-11-16 00:37:32,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:37:32,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:37:32,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:37:32,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:37:32,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:37:30" (1/3) ... [2019-11-16 00:37:32,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e216f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:32, skipping insertion in model container [2019-11-16 00:37:32,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:31" (2/3) ... [2019-11-16 00:37:32,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e216f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:32, skipping insertion in model container [2019-11-16 00:37:32,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:32" (3/3) ... [2019-11-16 00:37:32,940 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-2.c [2019-11-16 00:37:32,947 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:37:32,954 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:37:32,963 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:37:32,985 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:37:32,985 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:37:32,985 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:37:32,985 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:37:32,985 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:37:32,985 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:37:32,985 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:37:32,985 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:37:33,001 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-11-16 00:37:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-16 00:37:33,009 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:33,010 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:33,012 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:33,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:33,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1126320416, now seen corresponding path program 1 times [2019-11-16 00:37:33,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:33,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327827359] [2019-11-16 00:37:33,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:33,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:33,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:33,396 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-16 00:37:33,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327827359] [2019-11-16 00:37:33,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:33,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:33,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425148155] [2019-11-16 00:37:33,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:33,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:33,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:33,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:33,420 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2019-11-16 00:37:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:33,947 INFO L93 Difference]: Finished difference Result 317 states and 535 transitions. [2019-11-16 00:37:33,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:33,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-16 00:37:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:33,967 INFO L225 Difference]: With dead ends: 317 [2019-11-16 00:37:33,967 INFO L226 Difference]: Without dead ends: 160 [2019-11-16 00:37:33,971 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-16 00:37:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-16 00:37:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-11-16 00:37:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-16 00:37:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 220 transitions. [2019-11-16 00:37:34,039 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 220 transitions. Word has length 41 [2019-11-16 00:37:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:34,040 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 220 transitions. [2019-11-16 00:37:34,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 220 transitions. [2019-11-16 00:37:34,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-16 00:37:34,045 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:34,045 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:34,046 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:34,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:34,046 INFO L82 PathProgramCache]: Analyzing trace with hash -589138407, now seen corresponding path program 1 times [2019-11-16 00:37:34,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:34,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572079969] [2019-11-16 00:37:34,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:34,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:34,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:34,218 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-16 00:37:34,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572079969] [2019-11-16 00:37:34,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:34,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:34,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089476351] [2019-11-16 00:37:34,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:34,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:34,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:34,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:34,223 INFO L87 Difference]: Start difference. First operand 143 states and 220 transitions. Second operand 4 states. [2019-11-16 00:37:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:34,603 INFO L93 Difference]: Finished difference Result 284 states and 431 transitions. [2019-11-16 00:37:34,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:34,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-16 00:37:34,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:34,606 INFO L225 Difference]: With dead ends: 284 [2019-11-16 00:37:34,606 INFO L226 Difference]: Without dead ends: 160 [2019-11-16 00:37:34,607 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-16 00:37:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-16 00:37:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-11-16 00:37:34,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-16 00:37:34,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2019-11-16 00:37:34,629 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 54 [2019-11-16 00:37:34,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:34,630 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2019-11-16 00:37:34,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:34,630 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2019-11-16 00:37:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:37:34,639 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:34,639 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:34,639 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:34,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:34,641 INFO L82 PathProgramCache]: Analyzing trace with hash -873991893, now seen corresponding path program 1 times [2019-11-16 00:37:34,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:34,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376912474] [2019-11-16 00:37:34,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:34,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:34,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:34,762 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-16 00:37:34,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376912474] [2019-11-16 00:37:34,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:34,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:34,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333570839] [2019-11-16 00:37:34,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:34,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:34,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:34,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:34,764 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand 4 states. [2019-11-16 00:37:35,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:35,101 INFO L93 Difference]: Finished difference Result 283 states and 429 transitions. [2019-11-16 00:37:35,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:35,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-16 00:37:35,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:35,104 INFO L225 Difference]: With dead ends: 283 [2019-11-16 00:37:35,104 INFO L226 Difference]: Without dead ends: 159 [2019-11-16 00:37:35,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-16 00:37:35,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-16 00:37:35,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2019-11-16 00:37:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-16 00:37:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2019-11-16 00:37:35,117 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 55 [2019-11-16 00:37:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:35,118 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2019-11-16 00:37:35,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2019-11-16 00:37:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:37:35,120 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:35,120 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:35,120 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:35,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2010193898, now seen corresponding path program 1 times [2019-11-16 00:37:35,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:35,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221680949] [2019-11-16 00:37:35,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:35,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:35,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:35,195 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-16 00:37:35,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221680949] [2019-11-16 00:37:35,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:35,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:35,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956958955] [2019-11-16 00:37:35,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:35,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:35,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:35,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:35,198 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand 4 states. [2019-11-16 00:37:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:35,564 INFO L93 Difference]: Finished difference Result 281 states and 426 transitions. [2019-11-16 00:37:35,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:35,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-16 00:37:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:35,566 INFO L225 Difference]: With dead ends: 281 [2019-11-16 00:37:35,566 INFO L226 Difference]: Without dead ends: 157 [2019-11-16 00:37:35,567 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-16 00:37:35,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-16 00:37:35,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2019-11-16 00:37:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-16 00:37:35,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2019-11-16 00:37:35,580 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 55 [2019-11-16 00:37:35,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:35,582 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2019-11-16 00:37:35,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2019-11-16 00:37:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:37:35,587 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:35,587 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:35,588 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:35,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:35,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1549428566, now seen corresponding path program 1 times [2019-11-16 00:37:35,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:35,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744500566] [2019-11-16 00:37:35,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:35,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:35,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:35,690 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-16 00:37:35,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744500566] [2019-11-16 00:37:35,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:35,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:35,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471843435] [2019-11-16 00:37:35,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:35,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:35,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:35,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:35,696 INFO L87 Difference]: Start difference. First operand 143 states and 217 transitions. Second operand 4 states. [2019-11-16 00:37:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:35,999 INFO L93 Difference]: Finished difference Result 280 states and 424 transitions. [2019-11-16 00:37:35,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:35,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-16 00:37:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:36,001 INFO L225 Difference]: With dead ends: 280 [2019-11-16 00:37:36,001 INFO L226 Difference]: Without dead ends: 156 [2019-11-16 00:37:36,001 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-16 00:37:36,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-16 00:37:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-16 00:37:36,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-16 00:37:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2019-11-16 00:37:36,009 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 55 [2019-11-16 00:37:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:36,009 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2019-11-16 00:37:36,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2019-11-16 00:37:36,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-16 00:37:36,010 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:36,010 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:36,011 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:36,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:36,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1877613889, now seen corresponding path program 1 times [2019-11-16 00:37:36,011 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:36,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002409490] [2019-11-16 00:37:36,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:36,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:36,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:36,075 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-16 00:37:36,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002409490] [2019-11-16 00:37:36,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:36,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:36,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957478776] [2019-11-16 00:37:36,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:36,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:36,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:36,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:36,077 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand 4 states. [2019-11-16 00:37:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:36,350 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-11-16 00:37:36,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:36,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-16 00:37:36,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:36,354 INFO L225 Difference]: With dead ends: 280 [2019-11-16 00:37:36,354 INFO L226 Difference]: Without dead ends: 156 [2019-11-16 00:37:36,355 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-16 00:37:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-16 00:37:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-16 00:37:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-16 00:37:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2019-11-16 00:37:36,361 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 55 [2019-11-16 00:37:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:36,361 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2019-11-16 00:37:36,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2019-11-16 00:37:36,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:37:36,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:36,370 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:36,370 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:36,371 INFO L82 PathProgramCache]: Analyzing trace with hash 559324962, now seen corresponding path program 1 times [2019-11-16 00:37:36,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:36,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106531027] [2019-11-16 00:37:36,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:36,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:36,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:36,461 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-16 00:37:36,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106531027] [2019-11-16 00:37:36,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:36,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:36,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061457883] [2019-11-16 00:37:36,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:36,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:36,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:36,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:36,463 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand 4 states. [2019-11-16 00:37:36,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:36,750 INFO L93 Difference]: Finished difference Result 280 states and 422 transitions. [2019-11-16 00:37:36,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:36,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-16 00:37:36,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:36,755 INFO L225 Difference]: With dead ends: 280 [2019-11-16 00:37:36,755 INFO L226 Difference]: Without dead ends: 156 [2019-11-16 00:37:36,756 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-16 00:37:36,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-16 00:37:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-16 00:37:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-16 00:37:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2019-11-16 00:37:36,762 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 56 [2019-11-16 00:37:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:36,762 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2019-11-16 00:37:36,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2019-11-16 00:37:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-16 00:37:36,763 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:36,763 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:36,764 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:36,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:36,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1118749788, now seen corresponding path program 1 times [2019-11-16 00:37:36,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:36,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654239121] [2019-11-16 00:37:36,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:36,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:36,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:36,815 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-16 00:37:36,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654239121] [2019-11-16 00:37:36,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:36,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:36,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687419548] [2019-11-16 00:37:36,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:36,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:36,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:36,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:36,818 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand 4 states. [2019-11-16 00:37:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:37,105 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2019-11-16 00:37:37,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:37,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-16 00:37:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:37,107 INFO L225 Difference]: With dead ends: 280 [2019-11-16 00:37:37,107 INFO L226 Difference]: Without dead ends: 156 [2019-11-16 00:37:37,108 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-16 00:37:37,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-16 00:37:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-16 00:37:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-16 00:37:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2019-11-16 00:37:37,113 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 57 [2019-11-16 00:37:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:37,115 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2019-11-16 00:37:37,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2019-11-16 00:37:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-16 00:37:37,116 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:37,116 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:37,116 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1513227289, now seen corresponding path program 1 times [2019-11-16 00:37:37,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:37,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702822350] [2019-11-16 00:37:37,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:37,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:37,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:37,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:37,187 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-16 00:37:37,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702822350] [2019-11-16 00:37:37,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:37,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:37,187 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820725117] [2019-11-16 00:37:37,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:37,188 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:37,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:37,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:37,188 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand 4 states. [2019-11-16 00:37:37,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:37,409 INFO L93 Difference]: Finished difference Result 270 states and 407 transitions. [2019-11-16 00:37:37,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:37,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-16 00:37:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:37,410 INFO L225 Difference]: With dead ends: 270 [2019-11-16 00:37:37,410 INFO L226 Difference]: Without dead ends: 146 [2019-11-16 00:37:37,411 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-16 00:37:37,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-16 00:37:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2019-11-16 00:37:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-16 00:37:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2019-11-16 00:37:37,416 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 58 [2019-11-16 00:37:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:37,416 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2019-11-16 00:37:37,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2019-11-16 00:37:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-16 00:37:37,417 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:37,418 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-16 00:37:37,418 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:37,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:37,418 INFO L82 PathProgramCache]: Analyzing trace with hash -383138993, now seen corresponding path program 1 times [2019-11-16 00:37:37,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:37,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621169610] [2019-11-16 00:37:37,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:37,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:37,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:37,467 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-16 00:37:37,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621169610] [2019-11-16 00:37:37,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:37,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:37,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989203319] [2019-11-16 00:37:37,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:37,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:37,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:37,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:37,470 INFO L87 Difference]: Start difference. First operand 143 states and 212 transitions. Second operand 4 states. [2019-11-16 00:37:37,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:37,775 INFO L93 Difference]: Finished difference Result 310 states and 468 transitions. [2019-11-16 00:37:37,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:37,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-16 00:37:37,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:37,777 INFO L225 Difference]: With dead ends: 310 [2019-11-16 00:37:37,777 INFO L226 Difference]: Without dead ends: 186 [2019-11-16 00:37:37,778 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-16 00:37:37,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-16 00:37:37,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-11-16 00:37:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-16 00:37:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2019-11-16 00:37:37,783 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 58 [2019-11-16 00:37:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:37,784 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2019-11-16 00:37:37,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2019-11-16 00:37:37,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-16 00:37:37,785 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:37,785 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:37,785 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1542897590, now seen corresponding path program 1 times [2019-11-16 00:37:37,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:37,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485271964] [2019-11-16 00:37:37,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:37,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:37,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:37,838 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-16 00:37:37,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485271964] [2019-11-16 00:37:37,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:37,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:37,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723433236] [2019-11-16 00:37:37,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:37,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:37,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:37,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:37,840 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand 4 states. [2019-11-16 00:37:38,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:38,226 INFO L93 Difference]: Finished difference Result 332 states and 505 transitions. [2019-11-16 00:37:38,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:38,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-16 00:37:38,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:38,228 INFO L225 Difference]: With dead ends: 332 [2019-11-16 00:37:38,229 INFO L226 Difference]: Without dead ends: 186 [2019-11-16 00:37:38,229 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-16 00:37:38,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-16 00:37:38,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-11-16 00:37:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-16 00:37:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2019-11-16 00:37:38,235 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 71 [2019-11-16 00:37:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:38,235 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2019-11-16 00:37:38,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2019-11-16 00:37:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:37:38,237 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:38,237 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:38,237 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:38,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:38,238 INFO L82 PathProgramCache]: Analyzing trace with hash -375755494, now seen corresponding path program 1 times [2019-11-16 00:37:38,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:38,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920408450] [2019-11-16 00:37:38,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:38,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:38,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:38,308 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-16 00:37:38,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920408450] [2019-11-16 00:37:38,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:38,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:38,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297105261] [2019-11-16 00:37:38,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:38,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:38,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:38,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:38,311 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand 4 states. [2019-11-16 00:37:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:38,644 INFO L93 Difference]: Finished difference Result 331 states and 502 transitions. [2019-11-16 00:37:38,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:38,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-16 00:37:38,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:38,646 INFO L225 Difference]: With dead ends: 331 [2019-11-16 00:37:38,646 INFO L226 Difference]: Without dead ends: 185 [2019-11-16 00:37:38,647 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-16 00:37:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-16 00:37:38,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2019-11-16 00:37:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-16 00:37:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2019-11-16 00:37:38,674 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 72 [2019-11-16 00:37:38,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:38,674 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2019-11-16 00:37:38,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2019-11-16 00:37:38,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:37:38,675 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:38,675 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:38,676 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:38,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:38,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1511957499, now seen corresponding path program 1 times [2019-11-16 00:37:38,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:38,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420497546] [2019-11-16 00:37:38,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:38,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:38,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:38,736 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-16 00:37:38,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420497546] [2019-11-16 00:37:38,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:38,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:38,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905533077] [2019-11-16 00:37:38,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:38,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:38,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:38,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:38,742 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand 4 states. [2019-11-16 00:37:39,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:39,065 INFO L93 Difference]: Finished difference Result 329 states and 498 transitions. [2019-11-16 00:37:39,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:39,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-16 00:37:39,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:39,067 INFO L225 Difference]: With dead ends: 329 [2019-11-16 00:37:39,067 INFO L226 Difference]: Without dead ends: 183 [2019-11-16 00:37:39,068 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-16 00:37:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-16 00:37:39,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2019-11-16 00:37:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-16 00:37:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2019-11-16 00:37:39,073 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 72 [2019-11-16 00:37:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:39,075 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2019-11-16 00:37:39,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2019-11-16 00:37:39,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:37:39,076 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:39,076 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:39,076 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:39,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:39,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2047664965, now seen corresponding path program 1 times [2019-11-16 00:37:39,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:39,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860747191] [2019-11-16 00:37:39,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:39,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:39,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:39,124 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-16 00:37:39,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860747191] [2019-11-16 00:37:39,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:39,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:39,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646939145] [2019-11-16 00:37:39,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:39,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:39,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:39,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:39,131 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand 4 states. [2019-11-16 00:37:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:39,463 INFO L93 Difference]: Finished difference Result 328 states and 495 transitions. [2019-11-16 00:37:39,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:39,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-16 00:37:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:39,465 INFO L225 Difference]: With dead ends: 328 [2019-11-16 00:37:39,465 INFO L226 Difference]: Without dead ends: 182 [2019-11-16 00:37:39,466 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-16 00:37:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-16 00:37:39,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-16 00:37:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-16 00:37:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2019-11-16 00:37:39,470 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 72 [2019-11-16 00:37:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:39,470 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2019-11-16 00:37:39,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2019-11-16 00:37:39,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:37:39,471 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:39,471 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:39,471 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:39,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:39,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1379377490, now seen corresponding path program 1 times [2019-11-16 00:37:39,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:39,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609153228] [2019-11-16 00:37:39,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:39,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:39,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:39,516 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-16 00:37:39,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609153228] [2019-11-16 00:37:39,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:39,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:39,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943088523] [2019-11-16 00:37:39,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:39,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:39,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:39,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:39,520 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand 4 states. [2019-11-16 00:37:39,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:39,858 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2019-11-16 00:37:39,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:39,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-16 00:37:39,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:39,860 INFO L225 Difference]: With dead ends: 328 [2019-11-16 00:37:39,860 INFO L226 Difference]: Without dead ends: 182 [2019-11-16 00:37:39,860 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-16 00:37:39,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-16 00:37:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-16 00:37:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-16 00:37:39,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2019-11-16 00:37:39,865 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 72 [2019-11-16 00:37:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:39,869 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2019-11-16 00:37:39,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2019-11-16 00:37:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-16 00:37:39,870 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:39,870 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:39,870 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:39,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:39,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1175215853, now seen corresponding path program 1 times [2019-11-16 00:37:39,871 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:39,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81679841] [2019-11-16 00:37:39,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:39,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:39,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:39,911 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-16 00:37:39,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81679841] [2019-11-16 00:37:39,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:39,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:39,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800646037] [2019-11-16 00:37:39,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:39,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:39,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:39,915 INFO L87 Difference]: Start difference. First operand 165 states and 245 transitions. Second operand 4 states. [2019-11-16 00:37:40,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:40,274 INFO L93 Difference]: Finished difference Result 328 states and 491 transitions. [2019-11-16 00:37:40,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:40,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-16 00:37:40,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:40,276 INFO L225 Difference]: With dead ends: 328 [2019-11-16 00:37:40,276 INFO L226 Difference]: Without dead ends: 182 [2019-11-16 00:37:40,276 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-16 00:37:40,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-16 00:37:40,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-16 00:37:40,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-16 00:37:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2019-11-16 00:37:40,283 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 73 [2019-11-16 00:37:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:40,283 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2019-11-16 00:37:40,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2019-11-16 00:37:40,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-16 00:37:40,284 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:40,284 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:40,284 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:40,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:40,285 INFO L82 PathProgramCache]: Analyzing trace with hash 945059795, now seen corresponding path program 1 times [2019-11-16 00:37:40,285 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:40,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407648618] [2019-11-16 00:37:40,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:40,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:40,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:40,336 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-16 00:37:40,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407648618] [2019-11-16 00:37:40,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:40,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:40,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74874820] [2019-11-16 00:37:40,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:40,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:40,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:40,338 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand 4 states. [2019-11-16 00:37:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:40,640 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2019-11-16 00:37:40,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:40,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-16 00:37:40,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:40,642 INFO L225 Difference]: With dead ends: 328 [2019-11-16 00:37:40,642 INFO L226 Difference]: Without dead ends: 182 [2019-11-16 00:37:40,642 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-16 00:37:40,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-16 00:37:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-16 00:37:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-16 00:37:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2019-11-16 00:37:40,647 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 74 [2019-11-16 00:37:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:40,647 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2019-11-16 00:37:40,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2019-11-16 00:37:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:37:40,648 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:40,648 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:40,648 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:40,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1959639656, now seen corresponding path program 1 times [2019-11-16 00:37:40,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:40,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645507096] [2019-11-16 00:37:40,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:40,649 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:40,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:40,698 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-16 00:37:40,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645507096] [2019-11-16 00:37:40,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:40,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:40,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551166722] [2019-11-16 00:37:40,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:40,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:40,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:40,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:40,700 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand 4 states. [2019-11-16 00:37:41,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:41,009 INFO L93 Difference]: Finished difference Result 318 states and 474 transitions. [2019-11-16 00:37:41,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:41,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-16 00:37:41,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:41,011 INFO L225 Difference]: With dead ends: 318 [2019-11-16 00:37:41,011 INFO L226 Difference]: Without dead ends: 172 [2019-11-16 00:37:41,011 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-16 00:37:41,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-16 00:37:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2019-11-16 00:37:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-16 00:37:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2019-11-16 00:37:41,017 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 75 [2019-11-16 00:37:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:41,017 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2019-11-16 00:37:41,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2019-11-16 00:37:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:37:41,018 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:41,019 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-16 00:37:41,019 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:41,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:41,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1761634740, now seen corresponding path program 1 times [2019-11-16 00:37:41,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:41,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930733829] [2019-11-16 00:37:41,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:41,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:41,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:41,112 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-16 00:37:41,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930733829] [2019-11-16 00:37:41,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:41,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:41,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996066295] [2019-11-16 00:37:41,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:41,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:41,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:41,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:41,118 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand 4 states. [2019-11-16 00:37:41,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:41,608 INFO L93 Difference]: Finished difference Result 416 states and 623 transitions. [2019-11-16 00:37:41,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:41,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-16 00:37:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:41,611 INFO L225 Difference]: With dead ends: 416 [2019-11-16 00:37:41,611 INFO L226 Difference]: Without dead ends: 270 [2019-11-16 00:37:41,612 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-16 00:37:41,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-16 00:37:41,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 206. [2019-11-16 00:37:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-16 00:37:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-11-16 00:37:41,624 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 80 [2019-11-16 00:37:41,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:41,624 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-11-16 00:37:41,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:41,625 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-11-16 00:37:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-16 00:37:41,626 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:41,626 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-16 00:37:41,626 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:41,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:41,626 INFO L82 PathProgramCache]: Analyzing trace with hash -83732426, now seen corresponding path program 1 times [2019-11-16 00:37:41,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:41,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789797024] [2019-11-16 00:37:41,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:41,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:41,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:41,688 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-16 00:37:41,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789797024] [2019-11-16 00:37:41,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:41,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:41,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748362856] [2019-11-16 00:37:41,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:41,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:41,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:41,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:41,691 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-11-16 00:37:42,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:42,088 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2019-11-16 00:37:42,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:42,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-16 00:37:42,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:42,091 INFO L225 Difference]: With dead ends: 442 [2019-11-16 00:37:42,091 INFO L226 Difference]: Without dead ends: 255 [2019-11-16 00:37:42,091 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-16 00:37:42,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-16 00:37:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-16 00:37:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-16 00:37:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-11-16 00:37:42,099 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 80 [2019-11-16 00:37:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:42,100 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-11-16 00:37:42,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-11-16 00:37:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-16 00:37:42,101 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:42,102 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-16 00:37:42,102 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:42,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:42,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1230430550, now seen corresponding path program 1 times [2019-11-16 00:37:42,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:42,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882247328] [2019-11-16 00:37:42,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:42,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:42,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:42,207 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-16 00:37:42,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882247328] [2019-11-16 00:37:42,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:42,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:42,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828236891] [2019-11-16 00:37:42,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:42,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:42,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:42,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:42,210 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-11-16 00:37:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:42,671 INFO L93 Difference]: Finished difference Result 499 states and 773 transitions. [2019-11-16 00:37:42,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:42,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-16 00:37:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:42,673 INFO L225 Difference]: With dead ends: 499 [2019-11-16 00:37:42,673 INFO L226 Difference]: Without dead ends: 288 [2019-11-16 00:37:42,674 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-16 00:37:42,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-16 00:37:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 231. [2019-11-16 00:37:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-16 00:37:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 359 transitions. [2019-11-16 00:37:42,681 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 359 transitions. Word has length 81 [2019-11-16 00:37:42,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:42,681 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 359 transitions. [2019-11-16 00:37:42,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 359 transitions. [2019-11-16 00:37:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:37:42,683 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:42,683 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:42,683 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:42,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:42,684 INFO L82 PathProgramCache]: Analyzing trace with hash -47127035, now seen corresponding path program 1 times [2019-11-16 00:37:42,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:42,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960246661] [2019-11-16 00:37:42,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:42,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:42,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:42,750 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-16 00:37:42,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960246661] [2019-11-16 00:37:42,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:42,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:42,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292925283] [2019-11-16 00:37:42,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:42,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:42,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:42,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:42,752 INFO L87 Difference]: Start difference. First operand 231 states and 359 transitions. Second operand 4 states. [2019-11-16 00:37:43,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:43,243 INFO L93 Difference]: Finished difference Result 500 states and 773 transitions. [2019-11-16 00:37:43,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:43,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-16 00:37:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:43,247 INFO L225 Difference]: With dead ends: 500 [2019-11-16 00:37:43,247 INFO L226 Difference]: Without dead ends: 288 [2019-11-16 00:37:43,248 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-16 00:37:43,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-16 00:37:43,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 231. [2019-11-16 00:37:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-16 00:37:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 358 transitions. [2019-11-16 00:37:43,256 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 358 transitions. Word has length 93 [2019-11-16 00:37:43,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:43,256 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 358 transitions. [2019-11-16 00:37:43,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 358 transitions. [2019-11-16 00:37:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:37:43,258 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:43,258 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:43,258 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:43,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:43,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1491212995, now seen corresponding path program 1 times [2019-11-16 00:37:43,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:43,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923952183] [2019-11-16 00:37:43,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:43,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:43,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:43,317 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-16 00:37:43,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923952183] [2019-11-16 00:37:43,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:43,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:43,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85121343] [2019-11-16 00:37:43,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:43,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:43,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:43,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:43,320 INFO L87 Difference]: Start difference. First operand 231 states and 358 transitions. Second operand 4 states. [2019-11-16 00:37:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:43,660 INFO L93 Difference]: Finished difference Result 468 states and 726 transitions. [2019-11-16 00:37:43,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:43,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-16 00:37:43,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:43,662 INFO L225 Difference]: With dead ends: 468 [2019-11-16 00:37:43,662 INFO L226 Difference]: Without dead ends: 256 [2019-11-16 00:37:43,663 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-16 00:37:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-16 00:37:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 231. [2019-11-16 00:37:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-16 00:37:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 357 transitions. [2019-11-16 00:37:43,669 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 357 transitions. Word has length 93 [2019-11-16 00:37:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:43,669 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 357 transitions. [2019-11-16 00:37:43,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 357 transitions. [2019-11-16 00:37:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:37:43,671 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:43,671 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:43,671 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:43,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1251508545, now seen corresponding path program 1 times [2019-11-16 00:37:43,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:43,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408121457] [2019-11-16 00:37:43,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:43,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:43,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:43,731 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-16 00:37:43,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408121457] [2019-11-16 00:37:43,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:43,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:43,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844323426] [2019-11-16 00:37:43,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:43,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:43,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:43,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:43,734 INFO L87 Difference]: Start difference. First operand 231 states and 357 transitions. Second operand 4 states. [2019-11-16 00:37:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:44,200 INFO L93 Difference]: Finished difference Result 499 states and 768 transitions. [2019-11-16 00:37:44,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:44,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-16 00:37:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:44,203 INFO L225 Difference]: With dead ends: 499 [2019-11-16 00:37:44,203 INFO L226 Difference]: Without dead ends: 287 [2019-11-16 00:37:44,203 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-16 00:37:44,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-16 00:37:44,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 231. [2019-11-16 00:37:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-16 00:37:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 356 transitions. [2019-11-16 00:37:44,211 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 356 transitions. Word has length 94 [2019-11-16 00:37:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:44,211 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 356 transitions. [2019-11-16 00:37:44,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 356 transitions. [2019-11-16 00:37:44,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:37:44,213 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:44,213 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:44,213 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:44,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:44,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1907256746, now seen corresponding path program 1 times [2019-11-16 00:37:44,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:44,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105442295] [2019-11-16 00:37:44,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:44,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:44,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:44,277 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-16 00:37:44,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105442295] [2019-11-16 00:37:44,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:44,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:44,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102051105] [2019-11-16 00:37:44,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:44,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:44,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:44,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:44,279 INFO L87 Difference]: Start difference. First operand 231 states and 356 transitions. Second operand 4 states. [2019-11-16 00:37:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:44,710 INFO L93 Difference]: Finished difference Result 497 states and 764 transitions. [2019-11-16 00:37:44,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:44,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-16 00:37:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:44,713 INFO L225 Difference]: With dead ends: 497 [2019-11-16 00:37:44,713 INFO L226 Difference]: Without dead ends: 285 [2019-11-16 00:37:44,713 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-16 00:37:44,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-16 00:37:44,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 231. [2019-11-16 00:37:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-16 00:37:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 355 transitions. [2019-11-16 00:37:44,720 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 355 transitions. Word has length 94 [2019-11-16 00:37:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:44,720 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 355 transitions. [2019-11-16 00:37:44,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 355 transitions. [2019-11-16 00:37:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:37:44,722 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:44,722 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:44,722 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:44,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:44,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1171911914, now seen corresponding path program 1 times [2019-11-16 00:37:44,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:44,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014683191] [2019-11-16 00:37:44,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:44,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:44,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:44,786 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-16 00:37:44,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014683191] [2019-11-16 00:37:44,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:44,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:44,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079814282] [2019-11-16 00:37:44,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:44,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:44,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:44,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:44,789 INFO L87 Difference]: Start difference. First operand 231 states and 355 transitions. Second operand 4 states. [2019-11-16 00:37:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:45,256 INFO L93 Difference]: Finished difference Result 496 states and 761 transitions. [2019-11-16 00:37:45,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:45,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-16 00:37:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:45,258 INFO L225 Difference]: With dead ends: 496 [2019-11-16 00:37:45,259 INFO L226 Difference]: Without dead ends: 284 [2019-11-16 00:37:45,259 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-16 00:37:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-16 00:37:45,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 231. [2019-11-16 00:37:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-16 00:37:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 354 transitions. [2019-11-16 00:37:45,266 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 354 transitions. Word has length 94 [2019-11-16 00:37:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:45,266 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 354 transitions. [2019-11-16 00:37:45,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 354 transitions. [2019-11-16 00:37:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:37:45,268 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:45,268 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, 1, 1, 1, 1, 1] [2019-11-16 00:37:45,268 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:45,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:45,268 INFO L82 PathProgramCache]: Analyzing trace with hash 2039836755, now seen corresponding path program 1 times [2019-11-16 00:37:45,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:45,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680558175] [2019-11-16 00:37:45,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:45,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:45,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:45,349 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-16 00:37:45,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680558175] [2019-11-16 00:37:45,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:45,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:37:45,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983807350] [2019-11-16 00:37:45,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:37:45,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:45,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:37:45,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:37:45,351 INFO L87 Difference]: Start difference. First operand 231 states and 354 transitions. Second operand 5 states. [2019-11-16 00:37:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:45,911 INFO L93 Difference]: Finished difference Result 464 states and 716 transitions. [2019-11-16 00:37:45,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:37:45,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-11-16 00:37:45,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:45,913 INFO L225 Difference]: With dead ends: 464 [2019-11-16 00:37:45,913 INFO L226 Difference]: Without dead ends: 252 [2019-11-16 00:37:45,914 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-16 00:37:45,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-11-16 00:37:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2019-11-16 00:37:45,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-16 00:37:45,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 380 transitions. [2019-11-16 00:37:45,922 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 380 transitions. Word has length 94 [2019-11-16 00:37:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:45,922 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 380 transitions. [2019-11-16 00:37:45,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:37:45,923 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 380 transitions. [2019-11-16 00:37:45,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:37:45,924 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:45,924 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:45,924 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:45,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1943809876, now seen corresponding path program 1 times [2019-11-16 00:37:45,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:45,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684480278] [2019-11-16 00:37:45,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:45,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:45,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:45,990 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-16 00:37:45,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684480278] [2019-11-16 00:37:45,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:45,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:45,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331884675] [2019-11-16 00:37:45,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:45,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:45,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:45,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:45,992 INFO L87 Difference]: Start difference. First operand 251 states and 380 transitions. Second operand 4 states. [2019-11-16 00:37:46,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:46,342 INFO L93 Difference]: Finished difference Result 505 states and 766 transitions. [2019-11-16 00:37:46,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:46,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-16 00:37:46,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:46,345 INFO L225 Difference]: With dead ends: 505 [2019-11-16 00:37:46,345 INFO L226 Difference]: Without dead ends: 273 [2019-11-16 00:37:46,345 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-16 00:37:46,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-16 00:37:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 251. [2019-11-16 00:37:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-16 00:37:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 379 transitions. [2019-11-16 00:37:46,352 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 379 transitions. Word has length 94 [2019-11-16 00:37:46,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:46,353 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 379 transitions. [2019-11-16 00:37:46,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 379 transitions. [2019-11-16 00:37:46,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-16 00:37:46,354 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:46,354 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:46,355 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:46,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:46,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1615812588, now seen corresponding path program 1 times [2019-11-16 00:37:46,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:46,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065760950] [2019-11-16 00:37:46,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:46,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:46,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:46,411 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-16 00:37:46,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065760950] [2019-11-16 00:37:46,412 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:46,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:46,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676065278] [2019-11-16 00:37:46,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:46,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:46,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:46,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:46,414 INFO L87 Difference]: Start difference. First operand 251 states and 379 transitions. Second operand 4 states. [2019-11-16 00:37:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:46,788 INFO L93 Difference]: Finished difference Result 504 states and 763 transitions. [2019-11-16 00:37:46,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:46,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-16 00:37:46,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:46,791 INFO L225 Difference]: With dead ends: 504 [2019-11-16 00:37:46,791 INFO L226 Difference]: Without dead ends: 272 [2019-11-16 00:37:46,791 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-16 00:37:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-16 00:37:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2019-11-16 00:37:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-16 00:37:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 378 transitions. [2019-11-16 00:37:46,799 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 378 transitions. Word has length 94 [2019-11-16 00:37:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:46,799 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 378 transitions. [2019-11-16 00:37:46,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 378 transitions. [2019-11-16 00:37:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:37:46,800 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:46,801 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:46,801 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:46,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:46,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1225694591, now seen corresponding path program 1 times [2019-11-16 00:37:46,801 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:46,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890398155] [2019-11-16 00:37:46,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:46,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:46,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:46,856 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-16 00:37:46,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890398155] [2019-11-16 00:37:46,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:46,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:46,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139176372] [2019-11-16 00:37:46,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:46,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:46,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:46,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:46,860 INFO L87 Difference]: Start difference. First operand 251 states and 378 transitions. Second operand 4 states. [2019-11-16 00:37:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:47,331 INFO L93 Difference]: Finished difference Result 536 states and 806 transitions. [2019-11-16 00:37:47,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:47,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-16 00:37:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:47,333 INFO L225 Difference]: With dead ends: 536 [2019-11-16 00:37:47,333 INFO L226 Difference]: Without dead ends: 304 [2019-11-16 00:37:47,334 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-16 00:37:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-16 00:37:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 251. [2019-11-16 00:37:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-16 00:37:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 377 transitions. [2019-11-16 00:37:47,342 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 377 transitions. Word has length 95 [2019-11-16 00:37:47,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:47,342 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 377 transitions. [2019-11-16 00:37:47,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:47,342 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 377 transitions. [2019-11-16 00:37:47,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:37:47,344 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:47,344 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:47,344 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:47,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:47,345 INFO L82 PathProgramCache]: Analyzing trace with hash -349675585, now seen corresponding path program 1 times [2019-11-16 00:37:47,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:47,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584166839] [2019-11-16 00:37:47,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:47,400 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-16 00:37:47,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584166839] [2019-11-16 00:37:47,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:47,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:47,401 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184054210] [2019-11-16 00:37:47,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:47,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:47,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:47,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:47,402 INFO L87 Difference]: Start difference. First operand 251 states and 377 transitions. Second operand 4 states. [2019-11-16 00:37:47,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:47,707 INFO L93 Difference]: Finished difference Result 504 states and 759 transitions. [2019-11-16 00:37:47,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:47,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-16 00:37:47,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:47,709 INFO L225 Difference]: With dead ends: 504 [2019-11-16 00:37:47,709 INFO L226 Difference]: Without dead ends: 272 [2019-11-16 00:37:47,710 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-16 00:37:47,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-16 00:37:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2019-11-16 00:37:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-16 00:37:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 376 transitions. [2019-11-16 00:37:47,717 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 376 transitions. Word has length 95 [2019-11-16 00:37:47,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:47,718 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 376 transitions. [2019-11-16 00:37:47,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:47,718 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 376 transitions. [2019-11-16 00:37:47,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:37:47,719 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:47,719 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:47,720 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:47,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:47,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1893169626, now seen corresponding path program 1 times [2019-11-16 00:37:47,720 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:47,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291481960] [2019-11-16 00:37:47,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:47,796 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-16 00:37:47,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291481960] [2019-11-16 00:37:47,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:47,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:47,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744448456] [2019-11-16 00:37:47,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:47,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:47,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:47,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:47,799 INFO L87 Difference]: Start difference. First operand 251 states and 376 transitions. Second operand 4 states. [2019-11-16 00:37:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:48,163 INFO L93 Difference]: Finished difference Result 536 states and 802 transitions. [2019-11-16 00:37:48,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:48,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-16 00:37:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:48,165 INFO L225 Difference]: With dead ends: 536 [2019-11-16 00:37:48,165 INFO L226 Difference]: Without dead ends: 304 [2019-11-16 00:37:48,166 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-16 00:37:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-16 00:37:48,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 251. [2019-11-16 00:37:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-16 00:37:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 375 transitions. [2019-11-16 00:37:48,173 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 375 transitions. Word has length 96 [2019-11-16 00:37:48,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:48,174 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 375 transitions. [2019-11-16 00:37:48,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:48,174 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 375 transitions. [2019-11-16 00:37:48,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-16 00:37:48,175 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:48,175 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:48,176 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:48,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:48,176 INFO L82 PathProgramCache]: Analyzing trace with hash -506384216, now seen corresponding path program 1 times [2019-11-16 00:37:48,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:48,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954696807] [2019-11-16 00:37:48,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:48,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:48,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:48,242 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-16 00:37:48,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954696807] [2019-11-16 00:37:48,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:48,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:48,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344826218] [2019-11-16 00:37:48,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:48,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:48,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:48,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:48,244 INFO L87 Difference]: Start difference. First operand 251 states and 375 transitions. Second operand 4 states. [2019-11-16 00:37:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:48,504 INFO L93 Difference]: Finished difference Result 504 states and 755 transitions. [2019-11-16 00:37:48,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:48,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-16 00:37:48,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:48,506 INFO L225 Difference]: With dead ends: 504 [2019-11-16 00:37:48,506 INFO L226 Difference]: Without dead ends: 272 [2019-11-16 00:37:48,507 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-16 00:37:48,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-16 00:37:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2019-11-16 00:37:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-16 00:37:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 374 transitions. [2019-11-16 00:37:48,514 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 374 transitions. Word has length 96 [2019-11-16 00:37:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:48,514 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 374 transitions. [2019-11-16 00:37:48,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 374 transitions. [2019-11-16 00:37:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:37:48,515 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:48,516 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:48,516 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:48,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:48,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1563138876, now seen corresponding path program 1 times [2019-11-16 00:37:48,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:48,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111871702] [2019-11-16 00:37:48,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:48,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:48,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:48,574 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-16 00:37:48,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111871702] [2019-11-16 00:37:48,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:48,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:48,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436847428] [2019-11-16 00:37:48,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:48,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:48,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:48,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:48,576 INFO L87 Difference]: Start difference. First operand 251 states and 374 transitions. Second operand 4 states. [2019-11-16 00:37:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:49,001 INFO L93 Difference]: Finished difference Result 536 states and 798 transitions. [2019-11-16 00:37:49,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:49,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-16 00:37:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:49,003 INFO L225 Difference]: With dead ends: 536 [2019-11-16 00:37:49,003 INFO L226 Difference]: Without dead ends: 304 [2019-11-16 00:37:49,003 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-16 00:37:49,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-16 00:37:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 251. [2019-11-16 00:37:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-16 00:37:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 373 transitions. [2019-11-16 00:37:49,011 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 373 transitions. Word has length 97 [2019-11-16 00:37:49,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:49,011 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 373 transitions. [2019-11-16 00:37:49,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 373 transitions. [2019-11-16 00:37:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:37:49,012 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:49,013 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:49,013 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:49,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1603813626, now seen corresponding path program 1 times [2019-11-16 00:37:49,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:49,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510817297] [2019-11-16 00:37:49,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:49,082 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-16 00:37:49,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510817297] [2019-11-16 00:37:49,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:49,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:49,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98123688] [2019-11-16 00:37:49,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:49,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:49,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:49,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:49,084 INFO L87 Difference]: Start difference. First operand 251 states and 373 transitions. Second operand 4 states. [2019-11-16 00:37:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:49,464 INFO L93 Difference]: Finished difference Result 504 states and 751 transitions. [2019-11-16 00:37:49,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:49,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-16 00:37:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:49,466 INFO L225 Difference]: With dead ends: 504 [2019-11-16 00:37:49,467 INFO L226 Difference]: Without dead ends: 272 [2019-11-16 00:37:49,467 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-16 00:37:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-16 00:37:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 251. [2019-11-16 00:37:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-16 00:37:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 372 transitions. [2019-11-16 00:37:49,476 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 372 transitions. Word has length 97 [2019-11-16 00:37:49,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:49,477 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 372 transitions. [2019-11-16 00:37:49,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 372 transitions. [2019-11-16 00:37:49,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:37:49,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:49,478 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:49,479 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:49,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:49,479 INFO L82 PathProgramCache]: Analyzing trace with hash -287249151, now seen corresponding path program 1 times [2019-11-16 00:37:49,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:49,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703392479] [2019-11-16 00:37:49,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:49,580 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-16 00:37:49,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703392479] [2019-11-16 00:37:49,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:49,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:49,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668102515] [2019-11-16 00:37:49,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:49,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:49,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:49,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:49,582 INFO L87 Difference]: Start difference. First operand 251 states and 372 transitions. Second operand 4 states. [2019-11-16 00:37:49,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:49,961 INFO L93 Difference]: Finished difference Result 526 states and 782 transitions. [2019-11-16 00:37:49,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:49,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-16 00:37:49,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:49,963 INFO L225 Difference]: With dead ends: 526 [2019-11-16 00:37:49,963 INFO L226 Difference]: Without dead ends: 294 [2019-11-16 00:37:49,964 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-16 00:37:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-16 00:37:49,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 251. [2019-11-16 00:37:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-16 00:37:49,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 371 transitions. [2019-11-16 00:37:49,971 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 371 transitions. Word has length 98 [2019-11-16 00:37:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:49,972 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 371 transitions. [2019-11-16 00:37:49,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 371 transitions. [2019-11-16 00:37:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:37:49,973 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:49,973 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:49,973 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:49,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:49,974 INFO L82 PathProgramCache]: Analyzing trace with hash 973668099, now seen corresponding path program 1 times [2019-11-16 00:37:49,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:49,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559054299] [2019-11-16 00:37:49,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:49,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:50,040 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-16 00:37:50,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559054299] [2019-11-16 00:37:50,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:50,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:50,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697322792] [2019-11-16 00:37:50,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:50,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:50,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:50,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:50,043 INFO L87 Difference]: Start difference. First operand 251 states and 371 transitions. Second operand 4 states. [2019-11-16 00:37:50,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:50,321 INFO L93 Difference]: Finished difference Result 494 states and 735 transitions. [2019-11-16 00:37:50,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:50,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-16 00:37:50,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:50,323 INFO L225 Difference]: With dead ends: 494 [2019-11-16 00:37:50,323 INFO L226 Difference]: Without dead ends: 262 [2019-11-16 00:37:50,323 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-16 00:37:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-16 00:37:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 251. [2019-11-16 00:37:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-16 00:37:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 370 transitions. [2019-11-16 00:37:50,330 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 370 transitions. Word has length 98 [2019-11-16 00:37:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:50,330 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 370 transitions. [2019-11-16 00:37:50,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 370 transitions. [2019-11-16 00:37:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-16 00:37:50,331 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:50,332 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] [2019-11-16 00:37:50,332 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:50,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:50,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1584535859, now seen corresponding path program 1 times [2019-11-16 00:37:50,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:50,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640249968] [2019-11-16 00:37:50,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:50,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:50,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:50,394 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-16 00:37:50,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640249968] [2019-11-16 00:37:50,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:50,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:50,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330647180] [2019-11-16 00:37:50,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:50,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:50,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:50,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:50,396 INFO L87 Difference]: Start difference. First operand 251 states and 370 transitions. Second operand 4 states. [2019-11-16 00:37:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:50,832 INFO L93 Difference]: Finished difference Result 526 states and 778 transitions. [2019-11-16 00:37:50,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:50,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-16 00:37:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:50,834 INFO L225 Difference]: With dead ends: 526 [2019-11-16 00:37:50,835 INFO L226 Difference]: Without dead ends: 294 [2019-11-16 00:37:50,835 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-16 00:37:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-16 00:37:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 251. [2019-11-16 00:37:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-16 00:37:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 369 transitions. [2019-11-16 00:37:50,842 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 369 transitions. Word has length 102 [2019-11-16 00:37:50,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:50,842 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 369 transitions. [2019-11-16 00:37:50,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:50,842 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 369 transitions. [2019-11-16 00:37:50,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-16 00:37:50,843 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:50,843 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] [2019-11-16 00:37:50,844 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:50,844 INFO L82 PathProgramCache]: Analyzing trace with hash 377038799, now seen corresponding path program 1 times [2019-11-16 00:37:50,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:50,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595154155] [2019-11-16 00:37:50,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:50,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:50,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:50,924 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-16 00:37:50,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595154155] [2019-11-16 00:37:50,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:50,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:50,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673844331] [2019-11-16 00:37:50,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:50,925 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:50,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:50,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:50,926 INFO L87 Difference]: Start difference. First operand 251 states and 369 transitions. Second operand 4 states. [2019-11-16 00:37:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:51,253 INFO L93 Difference]: Finished difference Result 535 states and 795 transitions. [2019-11-16 00:37:51,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:51,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-16 00:37:51,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:51,255 INFO L225 Difference]: With dead ends: 535 [2019-11-16 00:37:51,255 INFO L226 Difference]: Without dead ends: 303 [2019-11-16 00:37:51,256 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-16 00:37:51,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-16 00:37:51,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 277. [2019-11-16 00:37:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:37:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 414 transitions. [2019-11-16 00:37:51,264 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 414 transitions. Word has length 102 [2019-11-16 00:37:51,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:51,264 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 414 transitions. [2019-11-16 00:37:51,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 414 transitions. [2019-11-16 00:37:51,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-16 00:37:51,266 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:51,266 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] [2019-11-16 00:37:51,266 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:51,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:51,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1906049320, now seen corresponding path program 1 times [2019-11-16 00:37:51,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:51,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940810863] [2019-11-16 00:37:51,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:51,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:51,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:51,332 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-16 00:37:51,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940810863] [2019-11-16 00:37:51,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:51,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:51,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684374680] [2019-11-16 00:37:51,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:51,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:51,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:51,335 INFO L87 Difference]: Start difference. First operand 277 states and 414 transitions. Second operand 4 states. [2019-11-16 00:37:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:51,749 INFO L93 Difference]: Finished difference Result 578 states and 866 transitions. [2019-11-16 00:37:51,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:51,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-16 00:37:51,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:51,751 INFO L225 Difference]: With dead ends: 578 [2019-11-16 00:37:51,752 INFO L226 Difference]: Without dead ends: 320 [2019-11-16 00:37:51,752 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-16 00:37:51,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-16 00:37:51,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 277. [2019-11-16 00:37:51,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:37:51,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 413 transitions. [2019-11-16 00:37:51,760 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 413 transitions. Word has length 105 [2019-11-16 00:37:51,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:51,761 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 413 transitions. [2019-11-16 00:37:51,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:51,761 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 413 transitions. [2019-11-16 00:37:51,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-16 00:37:51,762 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:51,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:37:51,762 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:51,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:51,763 INFO L82 PathProgramCache]: Analyzing trace with hash -560376435, now seen corresponding path program 1 times [2019-11-16 00:37:51,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:51,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506697605] [2019-11-16 00:37:51,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:51,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:51,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:51,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506697605] [2019-11-16 00:37:51,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:51,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:51,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686527093] [2019-11-16 00:37:51,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:51,823 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:51,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:51,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:51,824 INFO L87 Difference]: Start difference. First operand 277 states and 413 transitions. Second operand 4 states. [2019-11-16 00:37:52,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:52,236 INFO L93 Difference]: Finished difference Result 570 states and 851 transitions. [2019-11-16 00:37:52,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:52,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-16 00:37:52,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:52,239 INFO L225 Difference]: With dead ends: 570 [2019-11-16 00:37:52,239 INFO L226 Difference]: Without dead ends: 312 [2019-11-16 00:37:52,240 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-16 00:37:52,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-16 00:37:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 277. [2019-11-16 00:37:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:37:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 412 transitions. [2019-11-16 00:37:52,251 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 412 transitions. Word has length 106 [2019-11-16 00:37:52,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:52,251 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 412 transitions. [2019-11-16 00:37:52,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:52,251 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 412 transitions. [2019-11-16 00:37:52,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-16 00:37:52,252 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:52,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:37:52,253 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:52,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:52,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1855377922, now seen corresponding path program 1 times [2019-11-16 00:37:52,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:52,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766366008] [2019-11-16 00:37:52,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:52,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:52,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:52,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766366008] [2019-11-16 00:37:52,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:52,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:52,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857112571] [2019-11-16 00:37:52,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:52,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:52,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:52,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:52,327 INFO L87 Difference]: Start difference. First operand 277 states and 412 transitions. Second operand 4 states. [2019-11-16 00:37:52,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:52,662 INFO L93 Difference]: Finished difference Result 570 states and 849 transitions. [2019-11-16 00:37:52,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:52,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-16 00:37:52,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:52,664 INFO L225 Difference]: With dead ends: 570 [2019-11-16 00:37:52,664 INFO L226 Difference]: Without dead ends: 312 [2019-11-16 00:37:52,665 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-16 00:37:52,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-16 00:37:52,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 277. [2019-11-16 00:37:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:37:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 411 transitions. [2019-11-16 00:37:52,673 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 411 transitions. Word has length 107 [2019-11-16 00:37:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:52,673 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 411 transitions. [2019-11-16 00:37:52,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 411 transitions. [2019-11-16 00:37:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-16 00:37:52,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:52,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:37:52,675 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:52,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:52,675 INFO L82 PathProgramCache]: Analyzing trace with hash 705844290, now seen corresponding path program 1 times [2019-11-16 00:37:52,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:52,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401695844] [2019-11-16 00:37:52,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:52,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:52,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:52,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401695844] [2019-11-16 00:37:52,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:52,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:52,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982095162] [2019-11-16 00:37:52,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:52,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:52,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:52,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:52,747 INFO L87 Difference]: Start difference. First operand 277 states and 411 transitions. Second operand 4 states. [2019-11-16 00:37:53,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:53,157 INFO L93 Difference]: Finished difference Result 570 states and 847 transitions. [2019-11-16 00:37:53,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:53,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-16 00:37:53,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:53,189 INFO L225 Difference]: With dead ends: 570 [2019-11-16 00:37:53,189 INFO L226 Difference]: Without dead ends: 312 [2019-11-16 00:37:53,189 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-16 00:37:53,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-16 00:37:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 277. [2019-11-16 00:37:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:37:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 410 transitions. [2019-11-16 00:37:53,200 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 410 transitions. Word has length 108 [2019-11-16 00:37:53,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:53,201 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 410 transitions. [2019-11-16 00:37:53,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 410 transitions. [2019-11-16 00:37:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-16 00:37:53,202 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:53,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:37:53,203 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:53,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:53,203 INFO L82 PathProgramCache]: Analyzing trace with hash 71773319, now seen corresponding path program 1 times [2019-11-16 00:37:53,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:53,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046243026] [2019-11-16 00:37:53,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:53,273 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046243026] [2019-11-16 00:37:53,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:53,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:53,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392932778] [2019-11-16 00:37:53,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:53,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:53,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:53,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:53,276 INFO L87 Difference]: Start difference. First operand 277 states and 410 transitions. Second operand 4 states. [2019-11-16 00:37:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:53,708 INFO L93 Difference]: Finished difference Result 568 states and 843 transitions. [2019-11-16 00:37:53,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:53,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-16 00:37:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:53,710 INFO L225 Difference]: With dead ends: 568 [2019-11-16 00:37:53,711 INFO L226 Difference]: Without dead ends: 310 [2019-11-16 00:37:53,711 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-16 00:37:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-16 00:37:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 277. [2019-11-16 00:37:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:37:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 409 transitions. [2019-11-16 00:37:53,719 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 409 transitions. Word has length 108 [2019-11-16 00:37:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:53,719 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 409 transitions. [2019-11-16 00:37:53,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 409 transitions. [2019-11-16 00:37:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-16 00:37:53,721 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:53,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:37:53,721 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:53,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:53,722 INFO L82 PathProgramCache]: Analyzing trace with hash 493695261, now seen corresponding path program 1 times [2019-11-16 00:37:53,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:53,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835654610] [2019-11-16 00:37:53,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:53,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:53,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835654610] [2019-11-16 00:37:53,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:53,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:53,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933397296] [2019-11-16 00:37:53,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:53,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:53,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:53,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:53,785 INFO L87 Difference]: Start difference. First operand 277 states and 409 transitions. Second operand 4 states. [2019-11-16 00:37:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:54,127 INFO L93 Difference]: Finished difference Result 566 states and 838 transitions. [2019-11-16 00:37:54,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:54,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-16 00:37:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:54,130 INFO L225 Difference]: With dead ends: 566 [2019-11-16 00:37:54,130 INFO L226 Difference]: Without dead ends: 308 [2019-11-16 00:37:54,130 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-16 00:37:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-16 00:37:54,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 277. [2019-11-16 00:37:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:37:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 408 transitions. [2019-11-16 00:37:54,141 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 408 transitions. Word has length 109 [2019-11-16 00:37:54,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:54,142 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 408 transitions. [2019-11-16 00:37:54,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 408 transitions. [2019-11-16 00:37:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-16 00:37:54,143 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:54,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:37:54,143 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:54,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:54,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1501118240, now seen corresponding path program 1 times [2019-11-16 00:37:54,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:54,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983757347] [2019-11-16 00:37:54,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:54,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:54,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:54,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983757347] [2019-11-16 00:37:54,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:54,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:54,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504289181] [2019-11-16 00:37:54,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:54,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:54,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:54,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:54,205 INFO L87 Difference]: Start difference. First operand 277 states and 408 transitions. Second operand 4 states. [2019-11-16 00:37:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:54,521 INFO L93 Difference]: Finished difference Result 563 states and 832 transitions. [2019-11-16 00:37:54,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:54,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-16 00:37:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:54,523 INFO L225 Difference]: With dead ends: 563 [2019-11-16 00:37:54,523 INFO L226 Difference]: Without dead ends: 305 [2019-11-16 00:37:54,524 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-16 00:37:54,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-16 00:37:54,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 277. [2019-11-16 00:37:54,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:37:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 407 transitions. [2019-11-16 00:37:54,532 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 407 transitions. Word has length 109 [2019-11-16 00:37:54,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:54,532 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 407 transitions. [2019-11-16 00:37:54,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 407 transitions. [2019-11-16 00:37:54,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-16 00:37:54,533 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:54,534 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:37:54,534 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:54,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:54,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2063467681, now seen corresponding path program 1 times [2019-11-16 00:37:54,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:54,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091595418] [2019-11-16 00:37:54,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:54,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:54,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:54,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091595418] [2019-11-16 00:37:54,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:54,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:54,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149198055] [2019-11-16 00:37:54,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:54,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:54,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:54,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:54,610 INFO L87 Difference]: Start difference. First operand 277 states and 407 transitions. Second operand 4 states. [2019-11-16 00:37:54,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:54,915 INFO L93 Difference]: Finished difference Result 563 states and 830 transitions. [2019-11-16 00:37:54,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:54,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-16 00:37:54,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:54,917 INFO L225 Difference]: With dead ends: 563 [2019-11-16 00:37:54,917 INFO L226 Difference]: Without dead ends: 305 [2019-11-16 00:37:54,918 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-16 00:37:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-16 00:37:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 277. [2019-11-16 00:37:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:37:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 406 transitions. [2019-11-16 00:37:54,926 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 406 transitions. Word has length 111 [2019-11-16 00:37:54,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:54,926 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 406 transitions. [2019-11-16 00:37:54,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 406 transitions. [2019-11-16 00:37:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-16 00:37:54,927 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:54,927 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, 1, 1, 1, 1, 1, 1, 1, 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-16 00:37:54,928 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:54,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:54,928 INFO L82 PathProgramCache]: Analyzing trace with hash 312844043, now seen corresponding path program 1 times [2019-11-16 00:37:54,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:54,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871728923] [2019-11-16 00:37:54,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:54,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:54,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:54,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871728923] [2019-11-16 00:37:54,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:54,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:54,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725800480] [2019-11-16 00:37:54,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:54,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:54,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:54,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:54,997 INFO L87 Difference]: Start difference. First operand 277 states and 406 transitions. Second operand 4 states. [2019-11-16 00:37:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:55,329 INFO L93 Difference]: Finished difference Result 559 states and 823 transitions. [2019-11-16 00:37:55,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:55,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-11-16 00:37:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:55,331 INFO L225 Difference]: With dead ends: 559 [2019-11-16 00:37:55,331 INFO L226 Difference]: Without dead ends: 301 [2019-11-16 00:37:55,331 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-16 00:37:55,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-16 00:37:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 277. [2019-11-16 00:37:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:37:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 405 transitions. [2019-11-16 00:37:55,340 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 405 transitions. Word has length 112 [2019-11-16 00:37:55,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:55,340 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 405 transitions. [2019-11-16 00:37:55,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:55,340 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 405 transitions. [2019-11-16 00:37:55,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-16 00:37:55,341 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:55,342 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, 1, 1, 1, 1, 1, 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-16 00:37:55,342 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:55,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:55,342 INFO L82 PathProgramCache]: Analyzing trace with hash -692198915, now seen corresponding path program 1 times [2019-11-16 00:37:55,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:55,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558362295] [2019-11-16 00:37:55,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:55,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:55,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:55,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558362295] [2019-11-16 00:37:55,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:55,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:55,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985546720] [2019-11-16 00:37:55,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:55,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:55,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:55,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:55,415 INFO L87 Difference]: Start difference. First operand 277 states and 405 transitions. Second operand 4 states. [2019-11-16 00:37:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:55,708 INFO L93 Difference]: Finished difference Result 559 states and 821 transitions. [2019-11-16 00:37:55,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:55,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-11-16 00:37:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:55,710 INFO L225 Difference]: With dead ends: 559 [2019-11-16 00:37:55,710 INFO L226 Difference]: Without dead ends: 301 [2019-11-16 00:37:55,710 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-16 00:37:55,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-16 00:37:55,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 277. [2019-11-16 00:37:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:37:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 404 transitions. [2019-11-16 00:37:55,719 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 404 transitions. Word has length 112 [2019-11-16 00:37:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:55,719 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 404 transitions. [2019-11-16 00:37:55,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 404 transitions. [2019-11-16 00:37:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-16 00:37:55,720 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:55,720 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, 1, 1, 1, 1, 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-16 00:37:55,720 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:55,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1497358285, now seen corresponding path program 1 times [2019-11-16 00:37:55,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:55,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531625602] [2019-11-16 00:37:55,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:55,722 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:55,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:55,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531625602] [2019-11-16 00:37:55,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:55,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:55,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259340858] [2019-11-16 00:37:55,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:55,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:55,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:55,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:55,792 INFO L87 Difference]: Start difference. First operand 277 states and 404 transitions. Second operand 4 states. [2019-11-16 00:37:56,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:56,056 INFO L93 Difference]: Finished difference Result 557 states and 817 transitions. [2019-11-16 00:37:56,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:56,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-16 00:37:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:56,058 INFO L225 Difference]: With dead ends: 557 [2019-11-16 00:37:56,058 INFO L226 Difference]: Without dead ends: 299 [2019-11-16 00:37:56,059 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-16 00:37:56,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-16 00:37:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 277. [2019-11-16 00:37:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:37:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 403 transitions. [2019-11-16 00:37:56,067 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 403 transitions. Word has length 113 [2019-11-16 00:37:56,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:56,067 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 403 transitions. [2019-11-16 00:37:56,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 403 transitions. [2019-11-16 00:37:56,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-16 00:37:56,068 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:56,069 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, 1, 1, 1, 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-16 00:37:56,069 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:56,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:56,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1293653960, now seen corresponding path program 1 times [2019-11-16 00:37:56,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:56,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225675580] [2019-11-16 00:37:56,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:56,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:56,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:56,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225675580] [2019-11-16 00:37:56,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:56,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:56,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779344280] [2019-11-16 00:37:56,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:56,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:56,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:56,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:56,147 INFO L87 Difference]: Start difference. First operand 277 states and 403 transitions. Second operand 4 states. [2019-11-16 00:37:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:56,475 INFO L93 Difference]: Finished difference Result 557 states and 815 transitions. [2019-11-16 00:37:56,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:56,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-16 00:37:56,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:56,477 INFO L225 Difference]: With dead ends: 557 [2019-11-16 00:37:56,477 INFO L226 Difference]: Without dead ends: 299 [2019-11-16 00:37:56,477 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-16 00:37:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-16 00:37:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 277. [2019-11-16 00:37:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:37:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 402 transitions. [2019-11-16 00:37:56,487 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 402 transitions. Word has length 114 [2019-11-16 00:37:56,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:56,487 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 402 transitions. [2019-11-16 00:37:56,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:56,488 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 402 transitions. [2019-11-16 00:37:56,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-16 00:37:56,489 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:56,489 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, 1, 1, 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-16 00:37:56,489 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:56,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:56,490 INFO L82 PathProgramCache]: Analyzing trace with hash -33129394, now seen corresponding path program 1 times [2019-11-16 00:37:56,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:56,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996924324] [2019-11-16 00:37:56,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:56,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:56,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:37:56,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996924324] [2019-11-16 00:37:56,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:56,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:56,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654502829] [2019-11-16 00:37:56,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:56,578 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:56,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:56,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:56,578 INFO L87 Difference]: Start difference. First operand 277 states and 402 transitions. Second operand 4 states. [2019-11-16 00:37:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:56,895 INFO L93 Difference]: Finished difference Result 555 states and 811 transitions. [2019-11-16 00:37:56,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:56,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-16 00:37:56,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:56,897 INFO L225 Difference]: With dead ends: 555 [2019-11-16 00:37:56,897 INFO L226 Difference]: Without dead ends: 297 [2019-11-16 00:37:56,898 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-16 00:37:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-16 00:37:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 277. [2019-11-16 00:37:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-16 00:37:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 401 transitions. [2019-11-16 00:37:56,905 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 401 transitions. Word has length 115 [2019-11-16 00:37:56,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:56,905 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 401 transitions. [2019-11-16 00:37:56,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:56,905 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 401 transitions. [2019-11-16 00:37:56,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-16 00:37:56,906 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:56,906 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:56,907 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:56,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:56,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1623272394, now seen corresponding path program 1 times [2019-11-16 00:37:56,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:56,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740571174] [2019-11-16 00:37:56,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:56,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:56,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:37:56,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740571174] [2019-11-16 00:37:56,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:56,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:56,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364796277] [2019-11-16 00:37:56,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:56,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:56,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:56,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:56,977 INFO L87 Difference]: Start difference. First operand 277 states and 401 transitions. Second operand 4 states. [2019-11-16 00:37:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:57,479 INFO L93 Difference]: Finished difference Result 606 states and 890 transitions. [2019-11-16 00:37:57,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:57,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-16 00:37:57,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:57,482 INFO L225 Difference]: With dead ends: 606 [2019-11-16 00:37:57,482 INFO L226 Difference]: Without dead ends: 348 [2019-11-16 00:37:57,482 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-16 00:37:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-11-16 00:37:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 309. [2019-11-16 00:37:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-11-16 00:37:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 458 transitions. [2019-11-16 00:37:57,496 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 458 transitions. Word has length 115 [2019-11-16 00:37:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:57,497 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 458 transitions. [2019-11-16 00:37:57,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:57,497 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 458 transitions. [2019-11-16 00:37:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-16 00:37:57,498 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:57,498 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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-16 00:37:57,498 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:57,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:57,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1414686661, now seen corresponding path program 1 times [2019-11-16 00:37:57,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:57,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170946405] [2019-11-16 00:37:57,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:57,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:57,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:37:57,559 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170946405] [2019-11-16 00:37:57,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:57,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:57,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894927198] [2019-11-16 00:37:57,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:57,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:57,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:57,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:57,560 INFO L87 Difference]: Start difference. First operand 309 states and 458 transitions. Second operand 4 states. [2019-11-16 00:37:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:58,000 INFO L93 Difference]: Finished difference Result 701 states and 1050 transitions. [2019-11-16 00:37:58,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:58,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-16 00:37:58,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:58,002 INFO L225 Difference]: With dead ends: 701 [2019-11-16 00:37:58,002 INFO L226 Difference]: Without dead ends: 411 [2019-11-16 00:37:58,003 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-16 00:37:58,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-11-16 00:37:58,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 348. [2019-11-16 00:37:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-16 00:37:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 529 transitions. [2019-11-16 00:37:58,012 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 529 transitions. Word has length 116 [2019-11-16 00:37:58,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:58,012 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 529 transitions. [2019-11-16 00:37:58,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 529 transitions. [2019-11-16 00:37:58,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-16 00:37:58,013 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:58,014 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:58,014 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:58,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:58,014 INFO L82 PathProgramCache]: Analyzing trace with hash 899080889, now seen corresponding path program 1 times [2019-11-16 00:37:58,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:58,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417118475] [2019-11-16 00:37:58,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:37:58,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417118475] [2019-11-16 00:37:58,082 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:58,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:58,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666012304] [2019-11-16 00:37:58,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:58,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:58,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:58,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:58,084 INFO L87 Difference]: Start difference. First operand 348 states and 529 transitions. Second operand 4 states. [2019-11-16 00:37:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:58,531 INFO L93 Difference]: Finished difference Result 734 states and 1113 transitions. [2019-11-16 00:37:58,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:58,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-16 00:37:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:58,533 INFO L225 Difference]: With dead ends: 734 [2019-11-16 00:37:58,533 INFO L226 Difference]: Without dead ends: 405 [2019-11-16 00:37:58,534 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-16 00:37:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-11-16 00:37:58,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 347. [2019-11-16 00:37:58,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-16 00:37:58,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 528 transitions. [2019-11-16 00:37:58,544 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 528 transitions. Word has length 117 [2019-11-16 00:37:58,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:58,544 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 528 transitions. [2019-11-16 00:37:58,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 528 transitions. [2019-11-16 00:37:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-16 00:37:58,546 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:58,546 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:58,546 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:58,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:58,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2005355270, now seen corresponding path program 1 times [2019-11-16 00:37:58,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:58,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727039685] [2019-11-16 00:37:58,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:37:58,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727039685] [2019-11-16 00:37:58,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:58,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:58,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119647100] [2019-11-16 00:37:58,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:58,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:58,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:58,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:58,610 INFO L87 Difference]: Start difference. First operand 347 states and 528 transitions. Second operand 4 states. [2019-11-16 00:37:58,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:58,871 INFO L93 Difference]: Finished difference Result 701 states and 1067 transitions. [2019-11-16 00:37:58,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:58,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-16 00:37:58,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:58,873 INFO L225 Difference]: With dead ends: 701 [2019-11-16 00:37:58,873 INFO L226 Difference]: Without dead ends: 373 [2019-11-16 00:37:58,873 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-16 00:37:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-16 00:37:58,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 347. [2019-11-16 00:37:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-16 00:37:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 527 transitions. [2019-11-16 00:37:58,883 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 527 transitions. Word has length 117 [2019-11-16 00:37:58,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:58,884 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 527 transitions. [2019-11-16 00:37:58,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 527 transitions. [2019-11-16 00:37:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-16 00:37:58,884 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:58,885 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:58,885 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:58,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:58,885 INFO L82 PathProgramCache]: Analyzing trace with hash -514871743, now seen corresponding path program 1 times [2019-11-16 00:37:58,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:58,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215485025] [2019-11-16 00:37:58,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:58,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:37:58,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215485025] [2019-11-16 00:37:58,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:58,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:58,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302169833] [2019-11-16 00:37:58,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:58,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:58,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:58,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:58,960 INFO L87 Difference]: Start difference. First operand 347 states and 527 transitions. Second operand 4 states. [2019-11-16 00:37:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:59,219 INFO L93 Difference]: Finished difference Result 701 states and 1065 transitions. [2019-11-16 00:37:59,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:59,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-16 00:37:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:59,222 INFO L225 Difference]: With dead ends: 701 [2019-11-16 00:37:59,222 INFO L226 Difference]: Without dead ends: 373 [2019-11-16 00:37:59,222 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:59,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-16 00:37:59,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 347. [2019-11-16 00:37:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-16 00:37:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 526 transitions. [2019-11-16 00:37:59,232 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 526 transitions. Word has length 118 [2019-11-16 00:37:59,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:59,233 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 526 transitions. [2019-11-16 00:37:59,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 526 transitions. [2019-11-16 00:37:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-16 00:37:59,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:59,234 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:59,234 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:59,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:59,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1340700289, now seen corresponding path program 1 times [2019-11-16 00:37:59,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:59,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591400557] [2019-11-16 00:37:59,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:59,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:59,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:37:59,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591400557] [2019-11-16 00:37:59,301 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:59,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:59,301 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673013681] [2019-11-16 00:37:59,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:59,302 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:59,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:59,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:59,302 INFO L87 Difference]: Start difference. First operand 347 states and 526 transitions. Second operand 4 states. [2019-11-16 00:37:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:59,527 INFO L93 Difference]: Finished difference Result 701 states and 1063 transitions. [2019-11-16 00:37:59,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:59,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-16 00:37:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:59,529 INFO L225 Difference]: With dead ends: 701 [2019-11-16 00:37:59,529 INFO L226 Difference]: Without dead ends: 373 [2019-11-16 00:37:59,530 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-16 00:37:59,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 347. [2019-11-16 00:37:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-16 00:37:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 525 transitions. [2019-11-16 00:37:59,538 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 525 transitions. Word has length 119 [2019-11-16 00:37:59,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:59,538 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 525 transitions. [2019-11-16 00:37:59,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 525 transitions. [2019-11-16 00:37:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-16 00:37:59,539 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:59,539 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:59,540 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:59,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:59,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1407089244, now seen corresponding path program 1 times [2019-11-16 00:37:59,540 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:59,540 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000632839] [2019-11-16 00:37:59,540 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:59,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:59,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:37:59,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000632839] [2019-11-16 00:37:59,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:59,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:59,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783802853] [2019-11-16 00:37:59,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:59,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:59,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:59,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:59,602 INFO L87 Difference]: Start difference. First operand 347 states and 525 transitions. Second operand 4 states. [2019-11-16 00:37:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:59,882 INFO L93 Difference]: Finished difference Result 691 states and 1049 transitions. [2019-11-16 00:37:59,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:59,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-16 00:37:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:59,884 INFO L225 Difference]: With dead ends: 691 [2019-11-16 00:37:59,884 INFO L226 Difference]: Without dead ends: 363 [2019-11-16 00:37:59,884 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-16 00:37:59,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-16 00:37:59,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 347. [2019-11-16 00:37:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-16 00:37:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 524 transitions. [2019-11-16 00:37:59,894 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 524 transitions. Word has length 120 [2019-11-16 00:37:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:59,894 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 524 transitions. [2019-11-16 00:37:59,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 524 transitions. [2019-11-16 00:37:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-16 00:37:59,895 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:59,895 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-16 00:37:59,896 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:59,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:59,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1158786148, now seen corresponding path program 1 times [2019-11-16 00:37:59,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:59,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940399978] [2019-11-16 00:37:59,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:59,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:59,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:59,962 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-16 00:37:59,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940399978] [2019-11-16 00:37:59,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:59,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:37:59,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093461182] [2019-11-16 00:37:59,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:59,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:59,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:59,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:59,964 INFO L87 Difference]: Start difference. First operand 347 states and 524 transitions. Second operand 4 states. [2019-11-16 00:38:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:00,540 INFO L93 Difference]: Finished difference Result 777 states and 1182 transitions. [2019-11-16 00:38:00,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:00,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-16 00:38:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:00,544 INFO L225 Difference]: With dead ends: 777 [2019-11-16 00:38:00,544 INFO L226 Difference]: Without dead ends: 449 [2019-11-16 00:38:00,544 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-16 00:38:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-16 00:38:00,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 386. [2019-11-16 00:38:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-11-16 00:38:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 595 transitions. [2019-11-16 00:38:00,556 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 595 transitions. Word has length 121 [2019-11-16 00:38:00,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:00,556 INFO L462 AbstractCegarLoop]: Abstraction has 386 states and 595 transitions. [2019-11-16 00:38:00,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 595 transitions. [2019-11-16 00:38:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-16 00:38:00,558 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:00,558 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, 2, 1, 1, 1, 1, 1, 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-16 00:38:00,559 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:00,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:00,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1569164862, now seen corresponding path program 1 times [2019-11-16 00:38:00,560 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:00,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999812180] [2019-11-16 00:38:00,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:00,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:00,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:00,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999812180] [2019-11-16 00:38:00,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:00,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:00,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999138077] [2019-11-16 00:38:00,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:00,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:00,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:00,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:00,626 INFO L87 Difference]: Start difference. First operand 386 states and 595 transitions. Second operand 4 states. [2019-11-16 00:38:01,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:01,078 INFO L93 Difference]: Finished difference Result 810 states and 1245 transitions. [2019-11-16 00:38:01,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:01,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-16 00:38:01,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:01,080 INFO L225 Difference]: With dead ends: 810 [2019-11-16 00:38:01,080 INFO L226 Difference]: Without dead ends: 443 [2019-11-16 00:38:01,080 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-16 00:38:01,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-16 00:38:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 347. [2019-11-16 00:38:01,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-16 00:38:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 524 transitions. [2019-11-16 00:38:01,091 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 524 transitions. Word has length 122 [2019-11-16 00:38:01,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:01,092 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 524 transitions. [2019-11-16 00:38:01,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 524 transitions. [2019-11-16 00:38:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-16 00:38:01,093 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:01,093 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, 1, 1] [2019-11-16 00:38:01,094 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:01,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:01,094 INFO L82 PathProgramCache]: Analyzing trace with hash 317587356, now seen corresponding path program 1 times [2019-11-16 00:38:01,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:01,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548661246] [2019-11-16 00:38:01,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:01,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:01,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:38:01,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548661246] [2019-11-16 00:38:01,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:01,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:01,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927032664] [2019-11-16 00:38:01,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:01,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:01,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:01,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:01,163 INFO L87 Difference]: Start difference. First operand 347 states and 524 transitions. Second operand 4 states. [2019-11-16 00:38:01,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:01,469 INFO L93 Difference]: Finished difference Result 690 states and 1046 transitions. [2019-11-16 00:38:01,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:01,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-11-16 00:38:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:01,470 INFO L225 Difference]: With dead ends: 690 [2019-11-16 00:38:01,471 INFO L226 Difference]: Without dead ends: 362 [2019-11-16 00:38:01,471 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-16 00:38:01,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-11-16 00:38:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 350. [2019-11-16 00:38:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-16 00:38:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 527 transitions. [2019-11-16 00:38:01,478 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 527 transitions. Word has length 123 [2019-11-16 00:38:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:01,478 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 527 transitions. [2019-11-16 00:38:01,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 527 transitions. [2019-11-16 00:38:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-16 00:38:01,479 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:01,479 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:01,479 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:01,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:01,479 INFO L82 PathProgramCache]: Analyzing trace with hash 870150571, now seen corresponding path program 1 times [2019-11-16 00:38:01,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:01,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026288015] [2019-11-16 00:38:01,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:01,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:01,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:38:01,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026288015] [2019-11-16 00:38:01,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:01,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:01,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355418742] [2019-11-16 00:38:01,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:01,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:01,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:01,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:01,543 INFO L87 Difference]: Start difference. First operand 350 states and 527 transitions. Second operand 4 states. [2019-11-16 00:38:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:01,853 INFO L93 Difference]: Finished difference Result 720 states and 1084 transitions. [2019-11-16 00:38:01,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:01,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-16 00:38:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:01,855 INFO L225 Difference]: With dead ends: 720 [2019-11-16 00:38:01,855 INFO L226 Difference]: Without dead ends: 389 [2019-11-16 00:38:01,856 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-16 00:38:01,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-11-16 00:38:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 350. [2019-11-16 00:38:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-16 00:38:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 526 transitions. [2019-11-16 00:38:01,865 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 526 transitions. Word has length 130 [2019-11-16 00:38:01,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:01,865 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 526 transitions. [2019-11-16 00:38:01,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:01,865 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 526 transitions. [2019-11-16 00:38:01,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-16 00:38:01,866 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:01,867 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, 1, 1, 1] [2019-11-16 00:38:01,867 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:01,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:01,867 INFO L82 PathProgramCache]: Analyzing trace with hash 445590493, now seen corresponding path program 1 times [2019-11-16 00:38:01,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:01,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110538760] [2019-11-16 00:38:01,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:01,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:01,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:01,937 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-16 00:38:01,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110538760] [2019-11-16 00:38:01,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:01,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:01,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960220775] [2019-11-16 00:38:01,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:01,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:01,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:01,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:01,941 INFO L87 Difference]: Start difference. First operand 350 states and 526 transitions. Second operand 4 states. [2019-11-16 00:38:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:02,379 INFO L93 Difference]: Finished difference Result 743 states and 1126 transitions. [2019-11-16 00:38:02,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:02,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-16 00:38:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:02,381 INFO L225 Difference]: With dead ends: 743 [2019-11-16 00:38:02,382 INFO L226 Difference]: Without dead ends: 412 [2019-11-16 00:38:02,382 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-16 00:38:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-11-16 00:38:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 378. [2019-11-16 00:38:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-11-16 00:38:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 575 transitions. [2019-11-16 00:38:02,394 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 575 transitions. Word has length 130 [2019-11-16 00:38:02,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:02,395 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 575 transitions. [2019-11-16 00:38:02,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:02,395 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 575 transitions. [2019-11-16 00:38:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-16 00:38:02,396 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:02,396 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:02,396 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:02,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:02,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1346479044, now seen corresponding path program 1 times [2019-11-16 00:38:02,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:02,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860961116] [2019-11-16 00:38:02,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:02,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:02,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:38:02,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860961116] [2019-11-16 00:38:02,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:02,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:02,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454127961] [2019-11-16 00:38:02,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:02,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:02,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:02,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:02,455 INFO L87 Difference]: Start difference. First operand 378 states and 575 transitions. Second operand 4 states. [2019-11-16 00:38:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:02,906 INFO L93 Difference]: Finished difference Result 776 states and 1180 transitions. [2019-11-16 00:38:02,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:02,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-11-16 00:38:02,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:02,909 INFO L225 Difference]: With dead ends: 776 [2019-11-16 00:38:02,909 INFO L226 Difference]: Without dead ends: 417 [2019-11-16 00:38:02,910 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-16 00:38:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-11-16 00:38:02,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 378. [2019-11-16 00:38:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-11-16 00:38:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 574 transitions. [2019-11-16 00:38:02,923 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 574 transitions. Word has length 131 [2019-11-16 00:38:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:02,923 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 574 transitions. [2019-11-16 00:38:02,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:02,924 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 574 transitions. [2019-11-16 00:38:02,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-16 00:38:02,924 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:02,925 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:02,925 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:02,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:02,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1414750288, now seen corresponding path program 1 times [2019-11-16 00:38:02,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:02,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649220834] [2019-11-16 00:38:02,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:02,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:02,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:02,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649220834] [2019-11-16 00:38:02,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:02,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:02,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245960982] [2019-11-16 00:38:02,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:02,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:02,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:02,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:02,992 INFO L87 Difference]: Start difference. First operand 378 states and 574 transitions. Second operand 4 states. [2019-11-16 00:38:03,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:03,369 INFO L93 Difference]: Finished difference Result 833 states and 1273 transitions. [2019-11-16 00:38:03,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:03,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-11-16 00:38:03,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:03,371 INFO L225 Difference]: With dead ends: 833 [2019-11-16 00:38:03,371 INFO L226 Difference]: Without dead ends: 474 [2019-11-16 00:38:03,371 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-16 00:38:03,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-11-16 00:38:03,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 390. [2019-11-16 00:38:03,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-11-16 00:38:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 591 transitions. [2019-11-16 00:38:03,388 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 591 transitions. Word has length 131 [2019-11-16 00:38:03,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:03,388 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 591 transitions. [2019-11-16 00:38:03,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:03,388 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 591 transitions. [2019-11-16 00:38:03,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-16 00:38:03,389 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:03,389 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:03,390 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:03,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:03,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1330677734, now seen corresponding path program 1 times [2019-11-16 00:38:03,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:03,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922568216] [2019-11-16 00:38:03,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:03,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:03,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:38:03,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922568216] [2019-11-16 00:38:03,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:03,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:03,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179761957] [2019-11-16 00:38:03,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:03,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:03,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:03,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:03,484 INFO L87 Difference]: Start difference. First operand 390 states and 591 transitions. Second operand 4 states. [2019-11-16 00:38:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:03,824 INFO L93 Difference]: Finished difference Result 800 states and 1212 transitions. [2019-11-16 00:38:03,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:03,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-16 00:38:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:03,826 INFO L225 Difference]: With dead ends: 800 [2019-11-16 00:38:03,826 INFO L226 Difference]: Without dead ends: 429 [2019-11-16 00:38:03,827 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-16 00:38:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-16 00:38:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 390. [2019-11-16 00:38:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-11-16 00:38:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 590 transitions. [2019-11-16 00:38:03,835 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 590 transitions. Word has length 132 [2019-11-16 00:38:03,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:03,836 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 590 transitions. [2019-11-16 00:38:03,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 590 transitions. [2019-11-16 00:38:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-16 00:38:03,836 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:03,837 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:03,837 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:03,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:03,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1643757001, now seen corresponding path program 1 times [2019-11-16 00:38:03,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:03,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837580980] [2019-11-16 00:38:03,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:03,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:03,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:03,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837580980] [2019-11-16 00:38:03,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:03,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:03,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525671529] [2019-11-16 00:38:03,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:03,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:03,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:03,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:03,896 INFO L87 Difference]: Start difference. First operand 390 states and 590 transitions. Second operand 4 states. [2019-11-16 00:38:04,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:04,279 INFO L93 Difference]: Finished difference Result 845 states and 1287 transitions. [2019-11-16 00:38:04,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:04,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-16 00:38:04,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:04,281 INFO L225 Difference]: With dead ends: 845 [2019-11-16 00:38:04,281 INFO L226 Difference]: Without dead ends: 474 [2019-11-16 00:38:04,282 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-16 00:38:04,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-11-16 00:38:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 391. [2019-11-16 00:38:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-11-16 00:38:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 591 transitions. [2019-11-16 00:38:04,293 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 591 transitions. Word has length 132 [2019-11-16 00:38:04,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:04,293 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 591 transitions. [2019-11-16 00:38:04,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 591 transitions. [2019-11-16 00:38:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-16 00:38:04,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:04,295 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:04,295 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:04,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1096390039, now seen corresponding path program 1 times [2019-11-16 00:38:04,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:04,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949266278] [2019-11-16 00:38:04,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:04,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:04,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:38:04,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949266278] [2019-11-16 00:38:04,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:04,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:04,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363556620] [2019-11-16 00:38:04,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:04,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:04,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:04,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:04,394 INFO L87 Difference]: Start difference. First operand 391 states and 591 transitions. Second operand 4 states. [2019-11-16 00:38:04,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:04,819 INFO L93 Difference]: Finished difference Result 792 states and 1200 transitions. [2019-11-16 00:38:04,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:04,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-16 00:38:04,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:04,822 INFO L225 Difference]: With dead ends: 792 [2019-11-16 00:38:04,822 INFO L226 Difference]: Without dead ends: 420 [2019-11-16 00:38:04,822 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-16 00:38:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-11-16 00:38:04,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 391. [2019-11-16 00:38:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-11-16 00:38:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 590 transitions. [2019-11-16 00:38:04,835 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 590 transitions. Word has length 133 [2019-11-16 00:38:04,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:04,836 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 590 transitions. [2019-11-16 00:38:04,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 590 transitions. [2019-11-16 00:38:04,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-16 00:38:04,837 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:04,837 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:04,837 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:04,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:04,838 INFO L82 PathProgramCache]: Analyzing trace with hash 704995659, now seen corresponding path program 1 times [2019-11-16 00:38:04,838 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:04,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762154997] [2019-11-16 00:38:04,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:04,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:04,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:04,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762154997] [2019-11-16 00:38:04,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:04,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:04,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930429967] [2019-11-16 00:38:04,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:04,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:04,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:04,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:04,896 INFO L87 Difference]: Start difference. First operand 391 states and 590 transitions. Second operand 4 states. [2019-11-16 00:38:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:05,312 INFO L93 Difference]: Finished difference Result 846 states and 1285 transitions. [2019-11-16 00:38:05,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:05,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-16 00:38:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:05,314 INFO L225 Difference]: With dead ends: 846 [2019-11-16 00:38:05,314 INFO L226 Difference]: Without dead ends: 474 [2019-11-16 00:38:05,315 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-16 00:38:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-11-16 00:38:05,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 392. [2019-11-16 00:38:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-11-16 00:38:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 591 transitions. [2019-11-16 00:38:05,325 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 591 transitions. Word has length 133 [2019-11-16 00:38:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:05,325 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 591 transitions. [2019-11-16 00:38:05,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 591 transitions. [2019-11-16 00:38:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-16 00:38:05,326 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:05,326 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:05,326 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:05,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:05,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1119885102, now seen corresponding path program 1 times [2019-11-16 00:38:05,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:05,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793099437] [2019-11-16 00:38:05,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:05,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:05,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:05,384 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:05,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793099437] [2019-11-16 00:38:05,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:05,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:05,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246656512] [2019-11-16 00:38:05,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:05,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:05,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:05,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:05,386 INFO L87 Difference]: Start difference. First operand 392 states and 591 transitions. Second operand 4 states. [2019-11-16 00:38:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:05,728 INFO L93 Difference]: Finished difference Result 837 states and 1273 transitions. [2019-11-16 00:38:05,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:05,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-16 00:38:05,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:05,731 INFO L225 Difference]: With dead ends: 837 [2019-11-16 00:38:05,731 INFO L226 Difference]: Without dead ends: 464 [2019-11-16 00:38:05,732 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-16 00:38:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-16 00:38:05,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 393. [2019-11-16 00:38:05,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-11-16 00:38:05,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 592 transitions. [2019-11-16 00:38:05,741 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 592 transitions. Word has length 134 [2019-11-16 00:38:05,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:05,742 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 592 transitions. [2019-11-16 00:38:05,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:05,742 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 592 transitions. [2019-11-16 00:38:05,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-16 00:38:05,742 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:05,743 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:05,743 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:05,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:05,743 INFO L82 PathProgramCache]: Analyzing trace with hash -595235943, now seen corresponding path program 1 times [2019-11-16 00:38:05,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:05,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53914386] [2019-11-16 00:38:05,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:05,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:05,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:05,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53914386] [2019-11-16 00:38:05,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:05,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:05,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342294607] [2019-11-16 00:38:05,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:05,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:05,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:05,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:05,800 INFO L87 Difference]: Start difference. First operand 393 states and 592 transitions. Second operand 4 states. [2019-11-16 00:38:06,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:06,310 INFO L93 Difference]: Finished difference Result 848 states and 1285 transitions. [2019-11-16 00:38:06,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:06,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-11-16 00:38:06,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:06,312 INFO L225 Difference]: With dead ends: 848 [2019-11-16 00:38:06,312 INFO L226 Difference]: Without dead ends: 474 [2019-11-16 00:38:06,313 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-16 00:38:06,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-11-16 00:38:06,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 393. [2019-11-16 00:38:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-11-16 00:38:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 591 transitions. [2019-11-16 00:38:06,323 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 591 transitions. Word has length 136 [2019-11-16 00:38:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:06,324 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 591 transitions. [2019-11-16 00:38:06,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 591 transitions. [2019-11-16 00:38:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-16 00:38:06,324 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:06,324 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:06,325 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:06,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:06,325 INFO L82 PathProgramCache]: Analyzing trace with hash 471179278, now seen corresponding path program 1 times [2019-11-16 00:38:06,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:06,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664229227] [2019-11-16 00:38:06,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:06,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:06,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:06,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664229227] [2019-11-16 00:38:06,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:06,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:06,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400517965] [2019-11-16 00:38:06,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:06,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:06,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:06,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:06,400 INFO L87 Difference]: Start difference. First operand 393 states and 591 transitions. Second operand 4 states. [2019-11-16 00:38:06,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:06,865 INFO L93 Difference]: Finished difference Result 848 states and 1283 transitions. [2019-11-16 00:38:06,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:06,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-11-16 00:38:06,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:06,868 INFO L225 Difference]: With dead ends: 848 [2019-11-16 00:38:06,868 INFO L226 Difference]: Without dead ends: 474 [2019-11-16 00:38:06,868 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-16 00:38:06,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-11-16 00:38:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 393. [2019-11-16 00:38:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-11-16 00:38:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 590 transitions. [2019-11-16 00:38:06,878 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 590 transitions. Word has length 137 [2019-11-16 00:38:06,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:06,878 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 590 transitions. [2019-11-16 00:38:06,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 590 transitions. [2019-11-16 00:38:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-16 00:38:06,879 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:06,879 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:06,879 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:06,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:06,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1843510868, now seen corresponding path program 1 times [2019-11-16 00:38:06,879 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:06,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279807828] [2019-11-16 00:38:06,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:06,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:06,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:06,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279807828] [2019-11-16 00:38:06,943 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:06,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:06,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51714910] [2019-11-16 00:38:06,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:06,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:06,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:06,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:06,944 INFO L87 Difference]: Start difference. First operand 393 states and 590 transitions. Second operand 4 states. [2019-11-16 00:38:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:07,304 INFO L93 Difference]: Finished difference Result 848 states and 1281 transitions. [2019-11-16 00:38:07,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:07,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-11-16 00:38:07,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:07,306 INFO L225 Difference]: With dead ends: 848 [2019-11-16 00:38:07,306 INFO L226 Difference]: Without dead ends: 474 [2019-11-16 00:38:07,307 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-16 00:38:07,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-11-16 00:38:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 393. [2019-11-16 00:38:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-11-16 00:38:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 589 transitions. [2019-11-16 00:38:07,322 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 589 transitions. Word has length 138 [2019-11-16 00:38:07,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:07,322 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 589 transitions. [2019-11-16 00:38:07,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 589 transitions. [2019-11-16 00:38:07,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-16 00:38:07,323 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:07,323 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:07,323 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:07,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:07,323 INFO L82 PathProgramCache]: Analyzing trace with hash -185651991, now seen corresponding path program 1 times [2019-11-16 00:38:07,323 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:07,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775456330] [2019-11-16 00:38:07,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:07,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:07,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:07,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775456330] [2019-11-16 00:38:07,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:07,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:07,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136270953] [2019-11-16 00:38:07,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:07,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:07,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:07,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:07,390 INFO L87 Difference]: Start difference. First operand 393 states and 589 transitions. Second operand 4 states. [2019-11-16 00:38:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:07,741 INFO L93 Difference]: Finished difference Result 838 states and 1267 transitions. [2019-11-16 00:38:07,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:07,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-11-16 00:38:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:07,743 INFO L225 Difference]: With dead ends: 838 [2019-11-16 00:38:07,743 INFO L226 Difference]: Without dead ends: 464 [2019-11-16 00:38:07,743 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-16 00:38:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-16 00:38:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 378. [2019-11-16 00:38:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-11-16 00:38:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 568 transitions. [2019-11-16 00:38:07,754 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 568 transitions. Word has length 139 [2019-11-16 00:38:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:07,754 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 568 transitions. [2019-11-16 00:38:07,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 568 transitions. [2019-11-16 00:38:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-16 00:38:07,755 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:07,755 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:07,755 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:07,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:07,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1954110510, now seen corresponding path program 1 times [2019-11-16 00:38:07,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:07,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913653193] [2019-11-16 00:38:07,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:07,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:07,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:38:07,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913653193] [2019-11-16 00:38:07,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:07,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:07,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077715982] [2019-11-16 00:38:07,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:07,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:07,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:07,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:07,824 INFO L87 Difference]: Start difference. First operand 378 states and 568 transitions. Second operand 4 states. [2019-11-16 00:38:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:08,120 INFO L93 Difference]: Finished difference Result 766 states and 1154 transitions. [2019-11-16 00:38:08,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:08,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-16 00:38:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:08,122 INFO L225 Difference]: With dead ends: 766 [2019-11-16 00:38:08,122 INFO L226 Difference]: Without dead ends: 407 [2019-11-16 00:38:08,122 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-16 00:38:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-11-16 00:38:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 378. [2019-11-16 00:38:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-11-16 00:38:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 567 transitions. [2019-11-16 00:38:08,136 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 567 transitions. Word has length 140 [2019-11-16 00:38:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:08,137 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 567 transitions. [2019-11-16 00:38:08,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 567 transitions. [2019-11-16 00:38:08,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-16 00:38:08,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:08,138 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:08,138 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:08,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:08,139 INFO L82 PathProgramCache]: Analyzing trace with hash 33753123, now seen corresponding path program 1 times [2019-11-16 00:38:08,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:08,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082195657] [2019-11-16 00:38:08,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:38:08,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082195657] [2019-11-16 00:38:08,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:08,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:08,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703238957] [2019-11-16 00:38:08,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:08,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:08,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:08,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:08,243 INFO L87 Difference]: Start difference. First operand 378 states and 567 transitions. Second operand 4 states. [2019-11-16 00:38:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:08,547 INFO L93 Difference]: Finished difference Result 758 states and 1139 transitions. [2019-11-16 00:38:08,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:08,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-16 00:38:08,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:08,548 INFO L225 Difference]: With dead ends: 758 [2019-11-16 00:38:08,549 INFO L226 Difference]: Without dead ends: 399 [2019-11-16 00:38:08,549 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-16 00:38:08,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-11-16 00:38:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 378. [2019-11-16 00:38:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-11-16 00:38:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 566 transitions. [2019-11-16 00:38:08,562 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 566 transitions. Word has length 141 [2019-11-16 00:38:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:08,563 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 566 transitions. [2019-11-16 00:38:08,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 566 transitions. [2019-11-16 00:38:08,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-16 00:38:08,564 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:08,564 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:08,564 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:08,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:08,565 INFO L82 PathProgramCache]: Analyzing trace with hash -212711369, now seen corresponding path program 1 times [2019-11-16 00:38:08,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:08,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848400787] [2019-11-16 00:38:08,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:08,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:08,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848400787] [2019-11-16 00:38:08,632 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:08,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:08,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686919628] [2019-11-16 00:38:08,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:08,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:08,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:08,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:08,634 INFO L87 Difference]: Start difference. First operand 378 states and 566 transitions. Second operand 4 states. [2019-11-16 00:38:09,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:09,026 INFO L93 Difference]: Finished difference Result 823 states and 1241 transitions. [2019-11-16 00:38:09,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:09,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-16 00:38:09,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:09,029 INFO L225 Difference]: With dead ends: 823 [2019-11-16 00:38:09,029 INFO L226 Difference]: Without dead ends: 464 [2019-11-16 00:38:09,029 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-16 00:38:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-16 00:38:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 406. [2019-11-16 00:38:09,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-11-16 00:38:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 611 transitions. [2019-11-16 00:38:09,047 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 611 transitions. Word has length 141 [2019-11-16 00:38:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:09,047 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 611 transitions. [2019-11-16 00:38:09,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 611 transitions. [2019-11-16 00:38:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-16 00:38:09,048 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:09,048 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:09,049 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:09,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:09,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1817448354, now seen corresponding path program 1 times [2019-11-16 00:38:09,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:09,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540760569] [2019-11-16 00:38:09,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:09,115 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:09,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540760569] [2019-11-16 00:38:09,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:09,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:09,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308665278] [2019-11-16 00:38:09,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:09,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:09,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:09,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:09,117 INFO L87 Difference]: Start difference. First operand 406 states and 611 transitions. Second operand 4 states. [2019-11-16 00:38:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:09,464 INFO L93 Difference]: Finished difference Result 843 states and 1272 transitions. [2019-11-16 00:38:09,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:09,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-16 00:38:09,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:09,466 INFO L225 Difference]: With dead ends: 843 [2019-11-16 00:38:09,466 INFO L226 Difference]: Without dead ends: 456 [2019-11-16 00:38:09,467 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-16 00:38:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-11-16 00:38:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 407. [2019-11-16 00:38:09,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:38:09,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2019-11-16 00:38:09,479 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 142 [2019-11-16 00:38:09,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:09,479 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2019-11-16 00:38:09,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2019-11-16 00:38:09,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-16 00:38:09,480 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:09,480 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:09,480 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:09,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:09,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1654553802, now seen corresponding path program 1 times [2019-11-16 00:38:09,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:09,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481159143] [2019-11-16 00:38:09,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:38:09,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481159143] [2019-11-16 00:38:09,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:09,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:09,552 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9504609] [2019-11-16 00:38:09,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:09,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:09,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:09,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:09,553 INFO L87 Difference]: Start difference. First operand 407 states and 612 transitions. Second operand 4 states. [2019-11-16 00:38:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:09,936 INFO L93 Difference]: Finished difference Result 811 states and 1223 transitions. [2019-11-16 00:38:09,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:09,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-11-16 00:38:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:09,939 INFO L225 Difference]: With dead ends: 811 [2019-11-16 00:38:09,940 INFO L226 Difference]: Without dead ends: 423 [2019-11-16 00:38:09,940 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-16 00:38:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-11-16 00:38:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 407. [2019-11-16 00:38:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:38:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 611 transitions. [2019-11-16 00:38:09,957 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 611 transitions. Word has length 144 [2019-11-16 00:38:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:09,957 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 611 transitions. [2019-11-16 00:38:09,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 611 transitions. [2019-11-16 00:38:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-16 00:38:09,959 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:09,959 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:09,959 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:09,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:09,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1076274671, now seen corresponding path program 1 times [2019-11-16 00:38:09,960 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:09,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332913520] [2019-11-16 00:38:09,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:09,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:38:10,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332913520] [2019-11-16 00:38:10,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:10,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:10,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564820308] [2019-11-16 00:38:10,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:10,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:10,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:10,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:10,016 INFO L87 Difference]: Start difference. First operand 407 states and 611 transitions. Second operand 4 states. [2019-11-16 00:38:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:10,259 INFO L93 Difference]: Finished difference Result 809 states and 1219 transitions. [2019-11-16 00:38:10,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:10,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-16 00:38:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:10,261 INFO L225 Difference]: With dead ends: 809 [2019-11-16 00:38:10,261 INFO L226 Difference]: Without dead ends: 421 [2019-11-16 00:38:10,262 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-16 00:38:10,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-16 00:38:10,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 407. [2019-11-16 00:38:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-16 00:38:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 610 transitions. [2019-11-16 00:38:10,275 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 610 transitions. Word has length 145 [2019-11-16 00:38:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:10,275 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 610 transitions. [2019-11-16 00:38:10,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2019-11-16 00:38:10,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-16 00:38:10,276 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:10,276 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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-16 00:38:10,276 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:10,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:10,276 INFO L82 PathProgramCache]: Analyzing trace with hash -108566865, now seen corresponding path program 1 times [2019-11-16 00:38:10,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:10,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113026374] [2019-11-16 00:38:10,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:10,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113026374] [2019-11-16 00:38:10,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:10,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:10,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031590056] [2019-11-16 00:38:10,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:10,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:10,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:10,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:10,348 INFO L87 Difference]: Start difference. First operand 407 states and 610 transitions. Second operand 4 states. [2019-11-16 00:38:10,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:10,770 INFO L93 Difference]: Finished difference Result 841 states and 1264 transitions. [2019-11-16 00:38:10,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:10,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-16 00:38:10,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:10,772 INFO L225 Difference]: With dead ends: 841 [2019-11-16 00:38:10,772 INFO L226 Difference]: Without dead ends: 453 [2019-11-16 00:38:10,773 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-16 00:38:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-16 00:38:10,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 410. [2019-11-16 00:38:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-16 00:38:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 615 transitions. [2019-11-16 00:38:10,797 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 615 transitions. Word has length 145 [2019-11-16 00:38:10,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:10,797 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 615 transitions. [2019-11-16 00:38:10,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:10,797 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2019-11-16 00:38:10,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-16 00:38:10,798 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:10,798 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:10,798 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:10,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:10,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1574770376, now seen corresponding path program 1 times [2019-11-16 00:38:10,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:10,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163615145] [2019-11-16 00:38:10,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:10,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:38:10,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163615145] [2019-11-16 00:38:10,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:10,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:10,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104905379] [2019-11-16 00:38:10,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:10,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:10,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:10,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:10,853 INFO L87 Difference]: Start difference. First operand 410 states and 615 transitions. Second operand 4 states. [2019-11-16 00:38:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:11,149 INFO L93 Difference]: Finished difference Result 835 states and 1254 transitions. [2019-11-16 00:38:11,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:11,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-16 00:38:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:11,150 INFO L225 Difference]: With dead ends: 835 [2019-11-16 00:38:11,151 INFO L226 Difference]: Without dead ends: 444 [2019-11-16 00:38:11,151 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-16 00:38:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-11-16 00:38:11,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 410. [2019-11-16 00:38:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-16 00:38:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 614 transitions. [2019-11-16 00:38:11,162 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 614 transitions. Word has length 145 [2019-11-16 00:38:11,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:11,163 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 614 transitions. [2019-11-16 00:38:11,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:11,163 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 614 transitions. [2019-11-16 00:38:11,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-16 00:38:11,163 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:11,163 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:11,164 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:11,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:11,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1377203136, now seen corresponding path program 1 times [2019-11-16 00:38:11,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:11,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225788055] [2019-11-16 00:38:11,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:11,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:11,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:11,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225788055] [2019-11-16 00:38:11,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:11,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:11,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153921339] [2019-11-16 00:38:11,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:11,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:11,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:11,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:11,236 INFO L87 Difference]: Start difference. First operand 410 states and 614 transitions. Second operand 4 states. [2019-11-16 00:38:11,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:11,644 INFO L93 Difference]: Finished difference Result 855 states and 1283 transitions. [2019-11-16 00:38:11,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:11,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-16 00:38:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:11,646 INFO L225 Difference]: With dead ends: 855 [2019-11-16 00:38:11,646 INFO L226 Difference]: Without dead ends: 464 [2019-11-16 00:38:11,646 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-16 00:38:11,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-16 00:38:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 410. [2019-11-16 00:38:11,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-16 00:38:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 613 transitions. [2019-11-16 00:38:11,666 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 613 transitions. Word has length 146 [2019-11-16 00:38:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:11,666 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 613 transitions. [2019-11-16 00:38:11,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 613 transitions. [2019-11-16 00:38:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-16 00:38:11,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:11,668 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:11,668 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:11,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:11,669 INFO L82 PathProgramCache]: Analyzing trace with hash 170382927, now seen corresponding path program 1 times [2019-11-16 00:38:11,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:11,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206802606] [2019-11-16 00:38:11,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:11,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:11,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:38:11,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206802606] [2019-11-16 00:38:11,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:11,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:11,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141317628] [2019-11-16 00:38:11,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:11,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:11,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:11,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:11,734 INFO L87 Difference]: Start difference. First operand 410 states and 613 transitions. Second operand 4 states. [2019-11-16 00:38:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:12,057 INFO L93 Difference]: Finished difference Result 835 states and 1250 transitions. [2019-11-16 00:38:12,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:12,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-16 00:38:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:12,058 INFO L225 Difference]: With dead ends: 835 [2019-11-16 00:38:12,058 INFO L226 Difference]: Without dead ends: 444 [2019-11-16 00:38:12,059 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-16 00:38:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-11-16 00:38:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 410. [2019-11-16 00:38:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-16 00:38:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 612 transitions. [2019-11-16 00:38:12,071 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 612 transitions. Word has length 146 [2019-11-16 00:38:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:12,071 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 612 transitions. [2019-11-16 00:38:12,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 612 transitions. [2019-11-16 00:38:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-16 00:38:12,072 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:12,072 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, 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-16 00:38:12,073 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:12,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:12,073 INFO L82 PathProgramCache]: Analyzing trace with hash 738012533, now seen corresponding path program 1 times [2019-11-16 00:38:12,073 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:12,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387449454] [2019-11-16 00:38:12,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:12,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:12,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:12,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387449454] [2019-11-16 00:38:12,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:12,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:12,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174538705] [2019-11-16 00:38:12,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:12,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:12,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:12,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:12,142 INFO L87 Difference]: Start difference. First operand 410 states and 612 transitions. Second operand 4 states. [2019-11-16 00:38:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:12,478 INFO L93 Difference]: Finished difference Result 847 states and 1266 transitions. [2019-11-16 00:38:12,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:12,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-16 00:38:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:12,480 INFO L225 Difference]: With dead ends: 847 [2019-11-16 00:38:12,481 INFO L226 Difference]: Without dead ends: 456 [2019-11-16 00:38:12,481 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-16 00:38:12,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-11-16 00:38:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 410. [2019-11-16 00:38:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-16 00:38:12,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 611 transitions. [2019-11-16 00:38:12,496 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 611 transitions. Word has length 147 [2019-11-16 00:38:12,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:12,497 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 611 transitions. [2019-11-16 00:38:12,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 611 transitions. [2019-11-16 00:38:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-16 00:38:12,498 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:12,498 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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-16 00:38:12,498 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:12,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:12,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1344308336, now seen corresponding path program 1 times [2019-11-16 00:38:12,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:12,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121977654] [2019-11-16 00:38:12,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:12,500 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:12,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:12,569 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:12,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121977654] [2019-11-16 00:38:12,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:12,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:12,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580942781] [2019-11-16 00:38:12,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:12,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:12,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:12,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:12,570 INFO L87 Difference]: Start difference. First operand 410 states and 611 transitions. Second operand 4 states. [2019-11-16 00:38:12,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:12,871 INFO L93 Difference]: Finished difference Result 844 states and 1260 transitions. [2019-11-16 00:38:12,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:12,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-16 00:38:12,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:12,872 INFO L225 Difference]: With dead ends: 844 [2019-11-16 00:38:12,872 INFO L226 Difference]: Without dead ends: 453 [2019-11-16 00:38:12,873 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-16 00:38:12,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-16 00:38:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 411. [2019-11-16 00:38:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-16 00:38:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 612 transitions. [2019-11-16 00:38:12,891 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 612 transitions. Word has length 147 [2019-11-16 00:38:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:12,891 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 612 transitions. [2019-11-16 00:38:12,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 612 transitions. [2019-11-16 00:38:12,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-16 00:38:12,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:12,893 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:12,893 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:12,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:12,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1108758579, now seen corresponding path program 1 times [2019-11-16 00:38:12,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:12,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390018688] [2019-11-16 00:38:12,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:12,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:12,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:38:12,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390018688] [2019-11-16 00:38:12,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:12,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:12,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398275348] [2019-11-16 00:38:12,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:12,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:12,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:12,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:12,958 INFO L87 Difference]: Start difference. First operand 411 states and 612 transitions. Second operand 4 states. [2019-11-16 00:38:13,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:13,281 INFO L93 Difference]: Finished difference Result 837 states and 1248 transitions. [2019-11-16 00:38:13,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:13,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-16 00:38:13,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:13,282 INFO L225 Difference]: With dead ends: 837 [2019-11-16 00:38:13,282 INFO L226 Difference]: Without dead ends: 445 [2019-11-16 00:38:13,283 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-16 00:38:13,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-11-16 00:38:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 411. [2019-11-16 00:38:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-16 00:38:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 611 transitions. [2019-11-16 00:38:13,304 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 611 transitions. Word has length 147 [2019-11-16 00:38:13,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:13,304 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 611 transitions. [2019-11-16 00:38:13,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 611 transitions. [2019-11-16 00:38:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-16 00:38:13,305 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:13,306 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:13,306 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:13,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:13,306 INFO L82 PathProgramCache]: Analyzing trace with hash -506259172, now seen corresponding path program 1 times [2019-11-16 00:38:13,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:13,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269723043] [2019-11-16 00:38:13,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:13,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:13,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:13,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269723043] [2019-11-16 00:38:13,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:13,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:13,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817837678] [2019-11-16 00:38:13,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:13,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:13,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:13,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:13,381 INFO L87 Difference]: Start difference. First operand 411 states and 611 transitions. Second operand 4 states. [2019-11-16 00:38:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:13,715 INFO L93 Difference]: Finished difference Result 841 states and 1253 transitions. [2019-11-16 00:38:13,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:13,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-16 00:38:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:13,716 INFO L225 Difference]: With dead ends: 841 [2019-11-16 00:38:13,716 INFO L226 Difference]: Without dead ends: 449 [2019-11-16 00:38:13,717 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-16 00:38:13,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-16 00:38:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 412. [2019-11-16 00:38:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-11-16 00:38:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 612 transitions. [2019-11-16 00:38:13,730 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 612 transitions. Word has length 148 [2019-11-16 00:38:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:13,730 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 612 transitions. [2019-11-16 00:38:13,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:13,730 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 612 transitions. [2019-11-16 00:38:13,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-16 00:38:13,731 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:13,731 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:13,731 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:13,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:13,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1511302130, now seen corresponding path program 1 times [2019-11-16 00:38:13,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:13,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482232613] [2019-11-16 00:38:13,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:13,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:13,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:13,778 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:13,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482232613] [2019-11-16 00:38:13,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:13,779 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:13,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837108820] [2019-11-16 00:38:13,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:13,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:13,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:13,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:13,780 INFO L87 Difference]: Start difference. First operand 412 states and 612 transitions. Second operand 4 states. [2019-11-16 00:38:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:14,125 INFO L93 Difference]: Finished difference Result 842 states and 1253 transitions. [2019-11-16 00:38:14,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:14,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-16 00:38:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:14,126 INFO L225 Difference]: With dead ends: 842 [2019-11-16 00:38:14,126 INFO L226 Difference]: Without dead ends: 449 [2019-11-16 00:38:14,127 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-16 00:38:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-16 00:38:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 413. [2019-11-16 00:38:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-16 00:38:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 613 transitions. [2019-11-16 00:38:14,141 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 613 transitions. Word has length 148 [2019-11-16 00:38:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:14,142 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 613 transitions. [2019-11-16 00:38:14,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 613 transitions. [2019-11-16 00:38:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-16 00:38:14,143 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:14,143 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:14,143 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:14,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:14,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1488136470, now seen corresponding path program 1 times [2019-11-16 00:38:14,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:14,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867117725] [2019-11-16 00:38:14,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-16 00:38:14,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867117725] [2019-11-16 00:38:14,213 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:14,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:14,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678960469] [2019-11-16 00:38:14,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:14,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:14,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:14,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:14,214 INFO L87 Difference]: Start difference. First operand 413 states and 613 transitions. Second operand 4 states. [2019-11-16 00:38:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:14,490 INFO L93 Difference]: Finished difference Result 831 states and 1238 transitions. [2019-11-16 00:38:14,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:14,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-16 00:38:14,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:14,491 INFO L225 Difference]: With dead ends: 831 [2019-11-16 00:38:14,491 INFO L226 Difference]: Without dead ends: 437 [2019-11-16 00:38:14,492 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-16 00:38:14,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-16 00:38:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 413. [2019-11-16 00:38:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-16 00:38:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 612 transitions. [2019-11-16 00:38:14,505 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 612 transitions. Word has length 148 [2019-11-16 00:38:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:14,505 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 612 transitions. [2019-11-16 00:38:14,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 612 transitions. [2019-11-16 00:38:14,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-16 00:38:14,506 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:14,506 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:14,506 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:14,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:14,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1119754174, now seen corresponding path program 1 times [2019-11-16 00:38:14,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:14,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885642078] [2019-11-16 00:38:14,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:14,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885642078] [2019-11-16 00:38:14,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:14,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:14,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649575082] [2019-11-16 00:38:14,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:14,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:14,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:14,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:14,582 INFO L87 Difference]: Start difference. First operand 413 states and 612 transitions. Second operand 4 states. [2019-11-16 00:38:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:14,920 INFO L93 Difference]: Finished difference Result 841 states and 1249 transitions. [2019-11-16 00:38:14,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:14,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-16 00:38:14,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:14,921 INFO L225 Difference]: With dead ends: 841 [2019-11-16 00:38:14,921 INFO L226 Difference]: Without dead ends: 447 [2019-11-16 00:38:14,922 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-16 00:38:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-11-16 00:38:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 414. [2019-11-16 00:38:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-16 00:38:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 613 transitions. [2019-11-16 00:38:14,936 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 613 transitions. Word has length 149 [2019-11-16 00:38:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:14,937 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 613 transitions. [2019-11-16 00:38:14,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 613 transitions. [2019-11-16 00:38:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-16 00:38:14,937 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:14,938 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, 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-16 00:38:14,938 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:14,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:14,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1331396152, now seen corresponding path program 1 times [2019-11-16 00:38:14,938 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:14,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457962896] [2019-11-16 00:38:14,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:14,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457962896] [2019-11-16 00:38:14,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:14,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:14,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413455352] [2019-11-16 00:38:14,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:14,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:14,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:14,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:14,994 INFO L87 Difference]: Start difference. First operand 414 states and 613 transitions. Second operand 4 states. [2019-11-16 00:38:15,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:15,283 INFO L93 Difference]: Finished difference Result 848 states and 1256 transitions. [2019-11-16 00:38:15,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:15,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-16 00:38:15,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:15,284 INFO L225 Difference]: With dead ends: 848 [2019-11-16 00:38:15,285 INFO L226 Difference]: Without dead ends: 453 [2019-11-16 00:38:15,285 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-16 00:38:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-16 00:38:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 414. [2019-11-16 00:38:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-16 00:38:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 612 transitions. [2019-11-16 00:38:15,300 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 612 transitions. Word has length 150 [2019-11-16 00:38:15,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:15,300 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 612 transitions. [2019-11-16 00:38:15,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 612 transitions. [2019-11-16 00:38:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-16 00:38:15,301 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:15,301 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:15,301 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:15,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:15,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1822138889, now seen corresponding path program 1 times [2019-11-16 00:38:15,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:15,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239824188] [2019-11-16 00:38:15,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:15,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:15,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:15,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239824188] [2019-11-16 00:38:15,376 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:15,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:15,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236823469] [2019-11-16 00:38:15,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:15,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:15,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:15,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:15,377 INFO L87 Difference]: Start difference. First operand 414 states and 612 transitions. Second operand 4 states. [2019-11-16 00:38:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:15,660 INFO L93 Difference]: Finished difference Result 842 states and 1247 transitions. [2019-11-16 00:38:15,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:15,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-16 00:38:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:15,661 INFO L225 Difference]: With dead ends: 842 [2019-11-16 00:38:15,661 INFO L226 Difference]: Without dead ends: 447 [2019-11-16 00:38:15,661 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-16 00:38:15,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-11-16 00:38:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 415. [2019-11-16 00:38:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-11-16 00:38:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 613 transitions. [2019-11-16 00:38:15,675 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 613 transitions. Word has length 150 [2019-11-16 00:38:15,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:15,675 INFO L462 AbstractCegarLoop]: Abstraction has 415 states and 613 transitions. [2019-11-16 00:38:15,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 613 transitions. [2019-11-16 00:38:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-16 00:38:15,677 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:15,677 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:15,677 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:15,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:15,677 INFO L82 PathProgramCache]: Analyzing trace with hash 2067168413, now seen corresponding path program 1 times [2019-11-16 00:38:15,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:15,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975141997] [2019-11-16 00:38:15,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:15,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:15,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:15,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975141997] [2019-11-16 00:38:15,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:15,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:15,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890798925] [2019-11-16 00:38:15,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:15,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:15,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:15,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:15,750 INFO L87 Difference]: Start difference. First operand 415 states and 613 transitions. Second operand 4 states. [2019-11-16 00:38:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:16,032 INFO L93 Difference]: Finished difference Result 841 states and 1245 transitions. [2019-11-16 00:38:16,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:16,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-16 00:38:16,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:16,033 INFO L225 Difference]: With dead ends: 841 [2019-11-16 00:38:16,033 INFO L226 Difference]: Without dead ends: 445 [2019-11-16 00:38:16,034 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-16 00:38:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-11-16 00:38:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 416. [2019-11-16 00:38:16,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-16 00:38:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 614 transitions. [2019-11-16 00:38:16,047 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 614 transitions. Word has length 151 [2019-11-16 00:38:16,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:16,047 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 614 transitions. [2019-11-16 00:38:16,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 614 transitions. [2019-11-16 00:38:16,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-16 00:38:16,048 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:16,048 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, 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-16 00:38:16,048 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:16,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:16,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2125668935, now seen corresponding path program 1 times [2019-11-16 00:38:16,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:16,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085353849] [2019-11-16 00:38:16,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:16,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085353849] [2019-11-16 00:38:16,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:16,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:16,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63435667] [2019-11-16 00:38:16,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:16,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:16,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:16,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:16,123 INFO L87 Difference]: Start difference. First operand 416 states and 614 transitions. Second operand 4 states. [2019-11-16 00:38:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:16,453 INFO L93 Difference]: Finished difference Result 850 states and 1254 transitions. [2019-11-16 00:38:16,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:16,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-16 00:38:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:16,454 INFO L225 Difference]: With dead ends: 850 [2019-11-16 00:38:16,454 INFO L226 Difference]: Without dead ends: 453 [2019-11-16 00:38:16,454 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-16 00:38:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-16 00:38:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 416. [2019-11-16 00:38:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-16 00:38:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 613 transitions. [2019-11-16 00:38:16,468 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 613 transitions. Word has length 152 [2019-11-16 00:38:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:16,468 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 613 transitions. [2019-11-16 00:38:16,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 613 transitions. [2019-11-16 00:38:16,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-16 00:38:16,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:16,469 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, 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-16 00:38:16,469 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:16,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:16,469 INFO L82 PathProgramCache]: Analyzing trace with hash -701372173, now seen corresponding path program 1 times [2019-11-16 00:38:16,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:16,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492609937] [2019-11-16 00:38:16,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:16,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492609937] [2019-11-16 00:38:16,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:16,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:16,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789264856] [2019-11-16 00:38:16,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:16,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:16,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:16,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:16,516 INFO L87 Difference]: Start difference. First operand 416 states and 613 transitions. Second operand 4 states. [2019-11-16 00:38:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:16,814 INFO L93 Difference]: Finished difference Result 846 states and 1247 transitions. [2019-11-16 00:38:16,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:16,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-16 00:38:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:16,816 INFO L225 Difference]: With dead ends: 846 [2019-11-16 00:38:16,816 INFO L226 Difference]: Without dead ends: 449 [2019-11-16 00:38:16,816 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-16 00:38:16,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-16 00:38:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 416. [2019-11-16 00:38:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-16 00:38:16,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 612 transitions. [2019-11-16 00:38:16,839 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 612 transitions. Word has length 153 [2019-11-16 00:38:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:16,840 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 612 transitions. [2019-11-16 00:38:16,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 612 transitions. [2019-11-16 00:38:16,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-16 00:38:16,841 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:16,841 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, 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-16 00:38:16,841 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:16,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1706415131, now seen corresponding path program 1 times [2019-11-16 00:38:16,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:16,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637553973] [2019-11-16 00:38:16,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:16,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637553973] [2019-11-16 00:38:16,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:16,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:16,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859655814] [2019-11-16 00:38:16,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:16,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:16,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:16,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:16,913 INFO L87 Difference]: Start difference. First operand 416 states and 612 transitions. Second operand 4 states. [2019-11-16 00:38:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:17,253 INFO L93 Difference]: Finished difference Result 846 states and 1245 transitions. [2019-11-16 00:38:17,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:17,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-16 00:38:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:17,254 INFO L225 Difference]: With dead ends: 846 [2019-11-16 00:38:17,254 INFO L226 Difference]: Without dead ends: 449 [2019-11-16 00:38:17,255 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-16 00:38:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-16 00:38:17,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 416. [2019-11-16 00:38:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-16 00:38:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 611 transitions. [2019-11-16 00:38:17,269 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 611 transitions. Word has length 153 [2019-11-16 00:38:17,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:17,269 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 611 transitions. [2019-11-16 00:38:17,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:17,270 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 611 transitions. [2019-11-16 00:38:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-16 00:38:17,270 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:17,271 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, 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-16 00:38:17,271 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:17,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:17,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1421677387, now seen corresponding path program 1 times [2019-11-16 00:38:17,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:17,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826212957] [2019-11-16 00:38:17,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:17,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:17,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:17,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826212957] [2019-11-16 00:38:17,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:17,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:17,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087357859] [2019-11-16 00:38:17,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:17,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:17,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:17,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:17,320 INFO L87 Difference]: Start difference. First operand 416 states and 611 transitions. Second operand 4 states. [2019-11-16 00:38:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:17,601 INFO L93 Difference]: Finished difference Result 844 states and 1241 transitions. [2019-11-16 00:38:17,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:17,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-16 00:38:17,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:17,602 INFO L225 Difference]: With dead ends: 844 [2019-11-16 00:38:17,602 INFO L226 Difference]: Without dead ends: 447 [2019-11-16 00:38:17,603 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-16 00:38:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-11-16 00:38:17,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 416. [2019-11-16 00:38:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-16 00:38:17,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 610 transitions. [2019-11-16 00:38:17,618 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 610 transitions. Word has length 154 [2019-11-16 00:38:17,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:17,619 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 610 transitions. [2019-11-16 00:38:17,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 610 transitions. [2019-11-16 00:38:17,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-16 00:38:17,619 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:17,619 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:38:17,620 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:17,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:17,620 INFO L82 PathProgramCache]: Analyzing trace with hash -997861344, now seen corresponding path program 1 times [2019-11-16 00:38:17,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:17,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994462982] [2019-11-16 00:38:17,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:17,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:17,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:17,667 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:17,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994462982] [2019-11-16 00:38:17,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:17,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:17,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829716827] [2019-11-16 00:38:17,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:17,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:17,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:17,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:17,668 INFO L87 Difference]: Start difference. First operand 416 states and 610 transitions. Second operand 4 states. [2019-11-16 00:38:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:17,959 INFO L93 Difference]: Finished difference Result 844 states and 1239 transitions. [2019-11-16 00:38:17,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:17,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-16 00:38:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:17,961 INFO L225 Difference]: With dead ends: 844 [2019-11-16 00:38:17,961 INFO L226 Difference]: Without dead ends: 447 [2019-11-16 00:38:17,962 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-16 00:38:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-11-16 00:38:17,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 416. [2019-11-16 00:38:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-16 00:38:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 609 transitions. [2019-11-16 00:38:17,985 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 609 transitions. Word has length 155 [2019-11-16 00:38:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:17,986 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 609 transitions. [2019-11-16 00:38:17,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 609 transitions. [2019-11-16 00:38:17,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-16 00:38:17,987 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:17,987 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] [2019-11-16 00:38:17,988 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:17,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:17,988 INFO L82 PathProgramCache]: Analyzing trace with hash -124137697, now seen corresponding path program 1 times [2019-11-16 00:38:17,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:17,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236043062] [2019-11-16 00:38:17,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:17,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:17,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:18,058 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-16 00:38:18,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236043062] [2019-11-16 00:38:18,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:18,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:18,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820877548] [2019-11-16 00:38:18,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:18,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:18,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:18,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:18,060 INFO L87 Difference]: Start difference. First operand 416 states and 609 transitions. Second operand 4 states. [2019-11-16 00:38:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:18,409 INFO L93 Difference]: Finished difference Result 879 states and 1298 transitions. [2019-11-16 00:38:18,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:18,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-16 00:38:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:18,410 INFO L225 Difference]: With dead ends: 879 [2019-11-16 00:38:18,410 INFO L226 Difference]: Without dead ends: 482 [2019-11-16 00:38:18,410 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-16 00:38:18,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-16 00:38:18,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 446. [2019-11-16 00:38:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-11-16 00:38:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 662 transitions. [2019-11-16 00:38:18,427 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 662 transitions. Word has length 155 [2019-11-16 00:38:18,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:18,427 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 662 transitions. [2019-11-16 00:38:18,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:18,427 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 662 transitions. [2019-11-16 00:38:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-16 00:38:18,428 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:18,428 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:38:18,428 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:18,429 INFO L82 PathProgramCache]: Analyzing trace with hash 546507110, now seen corresponding path program 1 times [2019-11-16 00:38:18,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:18,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744782791] [2019-11-16 00:38:18,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:18,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:18,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:18,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744782791] [2019-11-16 00:38:18,491 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:18,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:18,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886107847] [2019-11-16 00:38:18,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:18,491 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:18,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:18,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:18,492 INFO L87 Difference]: Start difference. First operand 446 states and 662 transitions. Second operand 4 states. [2019-11-16 00:38:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:18,832 INFO L93 Difference]: Finished difference Result 902 states and 1341 transitions. [2019-11-16 00:38:18,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:18,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-16 00:38:18,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:18,833 INFO L225 Difference]: With dead ends: 902 [2019-11-16 00:38:18,833 INFO L226 Difference]: Without dead ends: 475 [2019-11-16 00:38:18,833 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-16 00:38:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-11-16 00:38:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 408. [2019-11-16 00:38:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-16 00:38:18,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 604 transitions. [2019-11-16 00:38:18,850 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 604 transitions. Word has length 156 [2019-11-16 00:38:18,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:18,850 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 604 transitions. [2019-11-16 00:38:18,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:18,850 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 604 transitions. [2019-11-16 00:38:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-16 00:38:18,850 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:18,850 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:18,851 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:18,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:18,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1470535360, now seen corresponding path program 1 times [2019-11-16 00:38:18,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:18,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327160976] [2019-11-16 00:38:18,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:18,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:18,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-16 00:38:18,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327160976] [2019-11-16 00:38:18,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:18,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:18,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746491594] [2019-11-16 00:38:18,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:18,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:18,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:18,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:18,894 INFO L87 Difference]: Start difference. First operand 408 states and 604 transitions. Second operand 4 states. [2019-11-16 00:38:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:19,185 INFO L93 Difference]: Finished difference Result 864 states and 1282 transitions. [2019-11-16 00:38:19,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:19,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-16 00:38:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:19,187 INFO L225 Difference]: With dead ends: 864 [2019-11-16 00:38:19,187 INFO L226 Difference]: Without dead ends: 475 [2019-11-16 00:38:19,187 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-16 00:38:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-11-16 00:38:19,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 424. [2019-11-16 00:38:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-11-16 00:38:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 625 transitions. [2019-11-16 00:38:19,203 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 625 transitions. Word has length 158 [2019-11-16 00:38:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:19,203 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 625 transitions. [2019-11-16 00:38:19,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 625 transitions. [2019-11-16 00:38:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-16 00:38:19,203 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:19,204 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:19,204 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:19,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:19,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1312208839, now seen corresponding path program 1 times [2019-11-16 00:38:19,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:19,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500104403] [2019-11-16 00:38:19,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:19,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:19,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-16 00:38:19,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500104403] [2019-11-16 00:38:19,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:19,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:19,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72024023] [2019-11-16 00:38:19,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:19,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:19,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:19,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:19,248 INFO L87 Difference]: Start difference. First operand 424 states and 625 transitions. Second operand 4 states. [2019-11-16 00:38:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:19,560 INFO L93 Difference]: Finished difference Result 878 states and 1300 transitions. [2019-11-16 00:38:19,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:19,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-16 00:38:19,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:19,561 INFO L225 Difference]: With dead ends: 878 [2019-11-16 00:38:19,561 INFO L226 Difference]: Without dead ends: 473 [2019-11-16 00:38:19,562 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-16 00:38:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-11-16 00:38:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 425. [2019-11-16 00:38:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-11-16 00:38:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 626 transitions. [2019-11-16 00:38:19,587 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 626 transitions. Word has length 159 [2019-11-16 00:38:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:19,587 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 626 transitions. [2019-11-16 00:38:19,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 626 transitions. [2019-11-16 00:38:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-16 00:38:19,588 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:19,588 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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-16 00:38:19,589 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash 557596907, now seen corresponding path program 1 times [2019-11-16 00:38:19,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:19,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667258675] [2019-11-16 00:38:19,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:19,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:19,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-16 00:38:19,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667258675] [2019-11-16 00:38:19,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:19,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:19,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125164230] [2019-11-16 00:38:19,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:19,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:19,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:19,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:19,662 INFO L87 Difference]: Start difference. First operand 425 states and 626 transitions. Second operand 3 states. [2019-11-16 00:38:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:19,758 INFO L93 Difference]: Finished difference Result 1233 states and 1829 transitions. [2019-11-16 00:38:19,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:19,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-11-16 00:38:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:19,760 INFO L225 Difference]: With dead ends: 1233 [2019-11-16 00:38:19,760 INFO L226 Difference]: Without dead ends: 827 [2019-11-16 00:38:19,761 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-16 00:38:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2019-11-16 00:38:19,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 825. [2019-11-16 00:38:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-11-16 00:38:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1220 transitions. [2019-11-16 00:38:19,798 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1220 transitions. Word has length 159 [2019-11-16 00:38:19,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:19,798 INFO L462 AbstractCegarLoop]: Abstraction has 825 states and 1220 transitions. [2019-11-16 00:38:19,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1220 transitions. [2019-11-16 00:38:19,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-16 00:38:19,799 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:19,799 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1] [2019-11-16 00:38:19,799 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:19,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:19,800 INFO L82 PathProgramCache]: Analyzing trace with hash 769642896, now seen corresponding path program 1 times [2019-11-16 00:38:19,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:19,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264297954] [2019-11-16 00:38:19,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:19,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:19,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:19,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264297954] [2019-11-16 00:38:19,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:19,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:19,872 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004263600] [2019-11-16 00:38:19,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:19,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:19,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:19,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:19,873 INFO L87 Difference]: Start difference. First operand 825 states and 1220 transitions. Second operand 4 states. [2019-11-16 00:38:20,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:20,306 INFO L93 Difference]: Finished difference Result 1727 states and 2556 transitions. [2019-11-16 00:38:20,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:20,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-16 00:38:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:20,309 INFO L225 Difference]: With dead ends: 1727 [2019-11-16 00:38:20,309 INFO L226 Difference]: Without dead ends: 921 [2019-11-16 00:38:20,310 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-16 00:38:20,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-11-16 00:38:20,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 877. [2019-11-16 00:38:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-11-16 00:38:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1300 transitions. [2019-11-16 00:38:20,362 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1300 transitions. Word has length 160 [2019-11-16 00:38:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:20,362 INFO L462 AbstractCegarLoop]: Abstraction has 877 states and 1300 transitions. [2019-11-16 00:38:20,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1300 transitions. [2019-11-16 00:38:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-16 00:38:20,364 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:20,364 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] [2019-11-16 00:38:20,364 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:20,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:20,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1675384265, now seen corresponding path program 1 times [2019-11-16 00:38:20,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:20,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289447508] [2019-11-16 00:38:20,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:20,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:20,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:20,502 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-16 00:38:20,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289447508] [2019-11-16 00:38:20,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:20,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:38:20,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186448254] [2019-11-16 00:38:20,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:38:20,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:20,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:38:20,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:20,505 INFO L87 Difference]: Start difference. First operand 877 states and 1300 transitions. Second operand 5 states. [2019-11-16 00:38:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:21,102 INFO L93 Difference]: Finished difference Result 1887 states and 2812 transitions. [2019-11-16 00:38:21,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:38:21,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-11-16 00:38:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:21,107 INFO L225 Difference]: With dead ends: 1887 [2019-11-16 00:38:21,107 INFO L226 Difference]: Without dead ends: 1029 [2019-11-16 00:38:21,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:38:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-11-16 00:38:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 943. [2019-11-16 00:38:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-11-16 00:38:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1418 transitions. [2019-11-16 00:38:21,159 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1418 transitions. Word has length 160 [2019-11-16 00:38:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:21,159 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1418 transitions. [2019-11-16 00:38:21,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:38:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1418 transitions. [2019-11-16 00:38:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-16 00:38:21,161 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:21,161 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1] [2019-11-16 00:38:21,161 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:21,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:21,162 INFO L82 PathProgramCache]: Analyzing trace with hash -175567548, now seen corresponding path program 1 times [2019-11-16 00:38:21,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:21,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261641351] [2019-11-16 00:38:21,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:21,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:21,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-16 00:38:21,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261641351] [2019-11-16 00:38:21,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:21,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:21,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945330718] [2019-11-16 00:38:21,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:21,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:21,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:21,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:21,238 INFO L87 Difference]: Start difference. First operand 943 states and 1418 transitions. Second operand 4 states. [2019-11-16 00:38:21,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:21,568 INFO L93 Difference]: Finished difference Result 1903 states and 2860 transitions. [2019-11-16 00:38:21,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:21,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-16 00:38:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:21,570 INFO L225 Difference]: With dead ends: 1903 [2019-11-16 00:38:21,570 INFO L226 Difference]: Without dead ends: 975 [2019-11-16 00:38:21,570 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-16 00:38:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2019-11-16 00:38:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 941. [2019-11-16 00:38:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2019-11-16 00:38:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1414 transitions. [2019-11-16 00:38:21,603 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1414 transitions. Word has length 161 [2019-11-16 00:38:21,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:21,603 INFO L462 AbstractCegarLoop]: Abstraction has 941 states and 1414 transitions. [2019-11-16 00:38:21,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1414 transitions. [2019-11-16 00:38:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-16 00:38:21,604 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:21,604 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:21,604 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:21,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:21,604 INFO L82 PathProgramCache]: Analyzing trace with hash 936613975, now seen corresponding path program 1 times [2019-11-16 00:38:21,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:21,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176856800] [2019-11-16 00:38:21,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:21,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:21,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:38:21,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176856800] [2019-11-16 00:38:21,667 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:21,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:21,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955293538] [2019-11-16 00:38:21,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:21,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:21,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:21,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:21,669 INFO L87 Difference]: Start difference. First operand 941 states and 1414 transitions. Second operand 4 states. [2019-11-16 00:38:21,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:21,993 INFO L93 Difference]: Finished difference Result 1917 states and 2878 transitions. [2019-11-16 00:38:21,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:21,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-16 00:38:21,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:21,995 INFO L225 Difference]: With dead ends: 1917 [2019-11-16 00:38:21,995 INFO L226 Difference]: Without dead ends: 995 [2019-11-16 00:38:21,995 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-16 00:38:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2019-11-16 00:38:22,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 941. [2019-11-16 00:38:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2019-11-16 00:38:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1412 transitions. [2019-11-16 00:38:22,029 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1412 transitions. Word has length 163 [2019-11-16 00:38:22,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:22,029 INFO L462 AbstractCegarLoop]: Abstraction has 941 states and 1412 transitions. [2019-11-16 00:38:22,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1412 transitions. [2019-11-16 00:38:22,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-16 00:38:22,030 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:22,030 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:22,030 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:22,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:22,030 INFO L82 PathProgramCache]: Analyzing trace with hash 294976514, now seen corresponding path program 1 times [2019-11-16 00:38:22,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:22,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449022275] [2019-11-16 00:38:22,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:22,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:22,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:38:22,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449022275] [2019-11-16 00:38:22,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:22,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:22,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062860034] [2019-11-16 00:38:22,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:22,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:22,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:22,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:22,108 INFO L87 Difference]: Start difference. First operand 941 states and 1412 transitions. Second operand 4 states. [2019-11-16 00:38:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:22,422 INFO L93 Difference]: Finished difference Result 1913 states and 2870 transitions. [2019-11-16 00:38:22,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:22,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-16 00:38:22,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:22,423 INFO L225 Difference]: With dead ends: 1913 [2019-11-16 00:38:22,423 INFO L226 Difference]: Without dead ends: 991 [2019-11-16 00:38:22,424 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-16 00:38:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-11-16 00:38:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 941. [2019-11-16 00:38:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2019-11-16 00:38:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1410 transitions. [2019-11-16 00:38:22,456 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1410 transitions. Word has length 164 [2019-11-16 00:38:22,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:22,456 INFO L462 AbstractCegarLoop]: Abstraction has 941 states and 1410 transitions. [2019-11-16 00:38:22,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1410 transitions. [2019-11-16 00:38:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-16 00:38:22,457 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:22,457 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-16 00:38:22,457 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:22,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:22,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2130185036, now seen corresponding path program 1 times [2019-11-16 00:38:22,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:22,458 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73101134] [2019-11-16 00:38:22,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:22,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:22,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-16 00:38:22,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73101134] [2019-11-16 00:38:22,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:22,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:22,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004482890] [2019-11-16 00:38:22,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:22,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:22,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:22,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:22,520 INFO L87 Difference]: Start difference. First operand 941 states and 1410 transitions. Second operand 3 states. [2019-11-16 00:38:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:22,652 INFO L93 Difference]: Finished difference Result 2321 states and 3491 transitions. [2019-11-16 00:38:22,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:22,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-16 00:38:22,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:22,653 INFO L225 Difference]: With dead ends: 2321 [2019-11-16 00:38:22,654 INFO L226 Difference]: Without dead ends: 1399 [2019-11-16 00:38:22,654 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-16 00:38:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-11-16 00:38:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1399. [2019-11-16 00:38:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1399 states. [2019-11-16 00:38:22,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 2096 transitions. [2019-11-16 00:38:22,731 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 2096 transitions. Word has length 164 [2019-11-16 00:38:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:22,731 INFO L462 AbstractCegarLoop]: Abstraction has 1399 states and 2096 transitions. [2019-11-16 00:38:22,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 2096 transitions. [2019-11-16 00:38:22,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-16 00:38:22,733 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:22,733 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, 1] [2019-11-16 00:38:22,733 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:22,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1370865435, now seen corresponding path program 1 times [2019-11-16 00:38:22,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:22,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093836463] [2019-11-16 00:38:22,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:22,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:22,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:38:22,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093836463] [2019-11-16 00:38:22,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:22,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:22,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27687098] [2019-11-16 00:38:22,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:22,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:22,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:22,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:22,789 INFO L87 Difference]: Start difference. First operand 1399 states and 2096 transitions. Second operand 3 states. [2019-11-16 00:38:22,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:22,921 INFO L93 Difference]: Finished difference Result 3235 states and 4858 transitions. [2019-11-16 00:38:22,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:22,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-16 00:38:22,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:22,923 INFO L225 Difference]: With dead ends: 3235 [2019-11-16 00:38:22,923 INFO L226 Difference]: Without dead ends: 1855 [2019-11-16 00:38:22,924 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-16 00:38:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2019-11-16 00:38:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1851. [2019-11-16 00:38:23,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1851 states. [2019-11-16 00:38:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2775 transitions. [2019-11-16 00:38:23,025 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2775 transitions. Word has length 165 [2019-11-16 00:38:23,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:23,025 INFO L462 AbstractCegarLoop]: Abstraction has 1851 states and 2775 transitions. [2019-11-16 00:38:23,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2775 transitions. [2019-11-16 00:38:23,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-16 00:38:23,027 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:23,027 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, 1, 1] [2019-11-16 00:38:23,027 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:23,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:23,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2108531887, now seen corresponding path program 1 times [2019-11-16 00:38:23,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:23,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105951449] [2019-11-16 00:38:23,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:23,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:23,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:38:23,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105951449] [2019-11-16 00:38:23,092 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:23,092 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:23,092 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19822781] [2019-11-16 00:38:23,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:23,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:23,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:23,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:23,093 INFO L87 Difference]: Start difference. First operand 1851 states and 2775 transitions. Second operand 3 states. [2019-11-16 00:38:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:23,217 INFO L93 Difference]: Finished difference Result 4100 states and 6158 transitions. [2019-11-16 00:38:23,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:23,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-16 00:38:23,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:23,219 INFO L225 Difference]: With dead ends: 4100 [2019-11-16 00:38:23,219 INFO L226 Difference]: Without dead ends: 2268 [2019-11-16 00:38:23,220 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-16 00:38:23,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2019-11-16 00:38:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 2264. [2019-11-16 00:38:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-11-16 00:38:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 3399 transitions. [2019-11-16 00:38:23,337 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 3399 transitions. Word has length 166 [2019-11-16 00:38:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:23,337 INFO L462 AbstractCegarLoop]: Abstraction has 2264 states and 3399 transitions. [2019-11-16 00:38:23,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 3399 transitions. [2019-11-16 00:38:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-16 00:38:23,339 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:23,339 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, 1, 1] [2019-11-16 00:38:23,339 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:23,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1674026289, now seen corresponding path program 1 times [2019-11-16 00:38:23,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:23,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860725397] [2019-11-16 00:38:23,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:23,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:23,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-16 00:38:23,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860725397] [2019-11-16 00:38:23,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:23,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:23,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936320476] [2019-11-16 00:38:23,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:23,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:23,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:23,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:23,381 INFO L87 Difference]: Start difference. First operand 2264 states and 3399 transitions. Second operand 3 states. [2019-11-16 00:38:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:23,510 INFO L93 Difference]: Finished difference Result 4536 states and 6813 transitions. [2019-11-16 00:38:23,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:23,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-16 00:38:23,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:23,512 INFO L225 Difference]: With dead ends: 4536 [2019-11-16 00:38:23,512 INFO L226 Difference]: Without dead ends: 2291 [2019-11-16 00:38:23,513 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-16 00:38:23,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2019-11-16 00:38:23,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2019-11-16 00:38:23,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-11-16 00:38:23,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3434 transitions. [2019-11-16 00:38:23,600 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3434 transitions. Word has length 166 [2019-11-16 00:38:23,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:23,600 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 3434 transitions. [2019-11-16 00:38:23,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:23,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3434 transitions. [2019-11-16 00:38:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-16 00:38:23,601 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:23,601 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, 1, 1] [2019-11-16 00:38:23,601 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:23,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:23,602 INFO L82 PathProgramCache]: Analyzing trace with hash -689815373, now seen corresponding path program 1 times [2019-11-16 00:38:23,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:23,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747208571] [2019-11-16 00:38:23,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:23,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:23,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-16 00:38:23,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747208571] [2019-11-16 00:38:23,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:23,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:38:23,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744695194] [2019-11-16 00:38:23,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:38:23,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:23,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:38:23,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:38:23,647 INFO L87 Difference]: Start difference. First operand 2291 states and 3434 transitions. Second operand 3 states. [2019-11-16 00:38:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:23,747 INFO L93 Difference]: Finished difference Result 4109 states and 6162 transitions. [2019-11-16 00:38:23,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:38:23,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-16 00:38:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:23,749 INFO L225 Difference]: With dead ends: 4109 [2019-11-16 00:38:23,749 INFO L226 Difference]: Without dead ends: 1837 [2019-11-16 00:38:23,750 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-16 00:38:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2019-11-16 00:38:23,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1837. [2019-11-16 00:38:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-11-16 00:38:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2749 transitions. [2019-11-16 00:38:23,848 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2749 transitions. Word has length 166 [2019-11-16 00:38:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:23,848 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2749 transitions. [2019-11-16 00:38:23,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:38:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2749 transitions. [2019-11-16 00:38:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-16 00:38:23,849 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:23,850 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] [2019-11-16 00:38:23,850 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:23,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:23,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1229383242, now seen corresponding path program 1 times [2019-11-16 00:38:23,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:23,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184724364] [2019-11-16 00:38:23,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:23,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:23,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:38:23,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184724364] [2019-11-16 00:38:23,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:23,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:23,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715360155] [2019-11-16 00:38:23,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:23,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:23,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:23,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:23,918 INFO L87 Difference]: Start difference. First operand 1837 states and 2749 transitions. Second operand 4 states. [2019-11-16 00:38:24,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:24,420 INFO L93 Difference]: Finished difference Result 3798 states and 5661 transitions. [2019-11-16 00:38:24,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:24,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-11-16 00:38:24,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:24,422 INFO L225 Difference]: With dead ends: 3798 [2019-11-16 00:38:24,422 INFO L226 Difference]: Without dead ends: 1982 [2019-11-16 00:38:24,423 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-16 00:38:24,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-11-16 00:38:24,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1837. [2019-11-16 00:38:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-11-16 00:38:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2745 transitions. [2019-11-16 00:38:24,496 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2745 transitions. Word has length 170 [2019-11-16 00:38:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:24,496 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2745 transitions. [2019-11-16 00:38:24,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2745 transitions. [2019-11-16 00:38:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-16 00:38:24,497 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:24,497 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] [2019-11-16 00:38:24,498 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:24,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:24,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2007517807, now seen corresponding path program 1 times [2019-11-16 00:38:24,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:24,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060268079] [2019-11-16 00:38:24,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:24,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:24,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:38:24,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060268079] [2019-11-16 00:38:24,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:24,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:24,579 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551270535] [2019-11-16 00:38:24,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:24,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:24,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:24,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:24,580 INFO L87 Difference]: Start difference. First operand 1837 states and 2745 transitions. Second operand 4 states. [2019-11-16 00:38:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:25,198 INFO L93 Difference]: Finished difference Result 3798 states and 5653 transitions. [2019-11-16 00:38:25,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:25,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-11-16 00:38:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:25,200 INFO L225 Difference]: With dead ends: 3798 [2019-11-16 00:38:25,200 INFO L226 Difference]: Without dead ends: 1982 [2019-11-16 00:38:25,201 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-16 00:38:25,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-11-16 00:38:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1837. [2019-11-16 00:38:25,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-11-16 00:38:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2741 transitions. [2019-11-16 00:38:25,280 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2741 transitions. Word has length 171 [2019-11-16 00:38:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:25,281 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2741 transitions. [2019-11-16 00:38:25,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2741 transitions. [2019-11-16 00:38:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-16 00:38:25,282 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:25,282 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, 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] [2019-11-16 00:38:25,282 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:25,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:25,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2113095517, now seen corresponding path program 1 times [2019-11-16 00:38:25,283 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:25,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067729694] [2019-11-16 00:38:25,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:25,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:25,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-16 00:38:25,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067729694] [2019-11-16 00:38:25,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:25,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:25,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114593113] [2019-11-16 00:38:25,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:25,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:25,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:25,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:25,350 INFO L87 Difference]: Start difference. First operand 1837 states and 2741 transitions. Second operand 4 states. [2019-11-16 00:38:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:25,749 INFO L93 Difference]: Finished difference Result 3722 states and 5541 transitions. [2019-11-16 00:38:25,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:25,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-11-16 00:38:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:25,750 INFO L225 Difference]: With dead ends: 3722 [2019-11-16 00:38:25,751 INFO L226 Difference]: Without dead ends: 1906 [2019-11-16 00:38:25,751 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-16 00:38:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2019-11-16 00:38:25,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1837. [2019-11-16 00:38:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-11-16 00:38:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2737 transitions. [2019-11-16 00:38:25,822 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2737 transitions. Word has length 172 [2019-11-16 00:38:25,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:25,823 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2737 transitions. [2019-11-16 00:38:25,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:25,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2737 transitions. [2019-11-16 00:38:25,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-16 00:38:25,824 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:25,824 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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] [2019-11-16 00:38:25,824 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:25,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:25,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2055442264, now seen corresponding path program 1 times [2019-11-16 00:38:25,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:25,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787508395] [2019-11-16 00:38:25,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:25,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:25,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-16 00:38:25,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787508395] [2019-11-16 00:38:25,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:25,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:25,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678053288] [2019-11-16 00:38:25,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:25,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:25,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:25,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:25,889 INFO L87 Difference]: Start difference. First operand 1837 states and 2737 transitions. Second operand 4 states. [2019-11-16 00:38:26,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:26,298 INFO L93 Difference]: Finished difference Result 3750 states and 5581 transitions. [2019-11-16 00:38:26,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:26,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-11-16 00:38:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:26,300 INFO L225 Difference]: With dead ends: 3750 [2019-11-16 00:38:26,300 INFO L226 Difference]: Without dead ends: 1934 [2019-11-16 00:38:26,301 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-16 00:38:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2019-11-16 00:38:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1837. [2019-11-16 00:38:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-11-16 00:38:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2733 transitions. [2019-11-16 00:38:26,371 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2733 transitions. Word has length 172 [2019-11-16 00:38:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:26,372 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2733 transitions. [2019-11-16 00:38:26,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2733 transitions. [2019-11-16 00:38:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-16 00:38:26,373 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:26,373 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] [2019-11-16 00:38:26,373 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:26,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:26,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1981654735, now seen corresponding path program 1 times [2019-11-16 00:38:26,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:26,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209337692] [2019-11-16 00:38:26,373 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:26,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:26,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:26,434 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:38:26,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209337692] [2019-11-16 00:38:26,435 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:26,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:26,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381465420] [2019-11-16 00:38:26,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:26,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:26,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:26,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:26,436 INFO L87 Difference]: Start difference. First operand 1837 states and 2733 transitions. Second operand 4 states. [2019-11-16 00:38:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:26,830 INFO L93 Difference]: Finished difference Result 3798 states and 5629 transitions. [2019-11-16 00:38:26,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:26,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-11-16 00:38:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:26,832 INFO L225 Difference]: With dead ends: 3798 [2019-11-16 00:38:26,832 INFO L226 Difference]: Without dead ends: 1982 [2019-11-16 00:38:26,833 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-16 00:38:26,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2019-11-16 00:38:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1837. [2019-11-16 00:38:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-11-16 00:38:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2729 transitions. [2019-11-16 00:38:26,904 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2729 transitions. Word has length 172 [2019-11-16 00:38:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:26,904 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2729 transitions. [2019-11-16 00:38:26,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2729 transitions. [2019-11-16 00:38:26,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-16 00:38:26,905 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:26,906 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, 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] [2019-11-16 00:38:26,906 INFO L410 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:26,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:26,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1389460540, now seen corresponding path program 1 times [2019-11-16 00:38:26,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:26,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585615958] [2019-11-16 00:38:26,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:26,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:26,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:26,966 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-16 00:38:26,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585615958] [2019-11-16 00:38:26,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:26,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:26,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300011945] [2019-11-16 00:38:26,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:26,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:26,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:26,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:26,968 INFO L87 Difference]: Start difference. First operand 1837 states and 2729 transitions. Second operand 4 states. [2019-11-16 00:38:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:27,438 INFO L93 Difference]: Finished difference Result 3714 states and 5509 transitions. [2019-11-16 00:38:27,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:27,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-11-16 00:38:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:27,439 INFO L225 Difference]: With dead ends: 3714 [2019-11-16 00:38:27,439 INFO L226 Difference]: Without dead ends: 1898 [2019-11-16 00:38:27,440 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-16 00:38:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-11-16 00:38:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1837. [2019-11-16 00:38:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-11-16 00:38:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2725 transitions. [2019-11-16 00:38:27,517 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2725 transitions. Word has length 173 [2019-11-16 00:38:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:27,518 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2725 transitions. [2019-11-16 00:38:27,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2725 transitions. [2019-11-16 00:38:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-16 00:38:27,519 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:27,519 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 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] [2019-11-16 00:38:27,519 INFO L410 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:27,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:27,519 INFO L82 PathProgramCache]: Analyzing trace with hash 618915105, now seen corresponding path program 1 times [2019-11-16 00:38:27,519 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:27,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362525839] [2019-11-16 00:38:27,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:27,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:27,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-16 00:38:27,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362525839] [2019-11-16 00:38:27,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:27,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:27,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103789662] [2019-11-16 00:38:27,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:27,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:27,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:27,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:27,576 INFO L87 Difference]: Start difference. First operand 1837 states and 2725 transitions. Second operand 4 states. [2019-11-16 00:38:27,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:27,950 INFO L93 Difference]: Finished difference Result 3742 states and 5549 transitions. [2019-11-16 00:38:27,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:27,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-11-16 00:38:27,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:27,952 INFO L225 Difference]: With dead ends: 3742 [2019-11-16 00:38:27,952 INFO L226 Difference]: Without dead ends: 1926 [2019-11-16 00:38:27,953 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-16 00:38:27,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2019-11-16 00:38:28,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1837. [2019-11-16 00:38:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-11-16 00:38:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2721 transitions. [2019-11-16 00:38:28,058 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2721 transitions. Word has length 173 [2019-11-16 00:38:28,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:28,058 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2721 transitions. [2019-11-16 00:38:28,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2721 transitions. [2019-11-16 00:38:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-16 00:38:28,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:28,059 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] [2019-11-16 00:38:28,059 INFO L410 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:28,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:28,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1493298604, now seen corresponding path program 1 times [2019-11-16 00:38:28,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:28,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752560333] [2019-11-16 00:38:28,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:28,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:28,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:38:28,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752560333] [2019-11-16 00:38:28,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:28,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:28,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297741223] [2019-11-16 00:38:28,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:28,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:28,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:28,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:28,121 INFO L87 Difference]: Start difference. First operand 1837 states and 2721 transitions. Second operand 4 states. [2019-11-16 00:38:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:28,483 INFO L93 Difference]: Finished difference Result 3758 states and 5557 transitions. [2019-11-16 00:38:28,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:28,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-11-16 00:38:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:28,485 INFO L225 Difference]: With dead ends: 3758 [2019-11-16 00:38:28,485 INFO L226 Difference]: Without dead ends: 1942 [2019-11-16 00:38:28,486 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-16 00:38:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2019-11-16 00:38:28,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1837. [2019-11-16 00:38:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-11-16 00:38:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2717 transitions. [2019-11-16 00:38:28,559 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2717 transitions. Word has length 173 [2019-11-16 00:38:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:28,559 INFO L462 AbstractCegarLoop]: Abstraction has 1837 states and 2717 transitions. [2019-11-16 00:38:28,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2717 transitions. [2019-11-16 00:38:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-16 00:38:28,560 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:28,560 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] [2019-11-16 00:38:28,561 INFO L410 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:28,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:28,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1144465868, now seen corresponding path program 1 times [2019-11-16 00:38:28,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:28,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588354949] [2019-11-16 00:38:28,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:28,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:28,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-16 00:38:28,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588354949] [2019-11-16 00:38:28,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:28,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:38:28,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909059594] [2019-11-16 00:38:28,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:38:28,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:28,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:38:28,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:28,667 INFO L87 Difference]: Start difference. First operand 1837 states and 2717 transitions. Second operand 5 states. [2019-11-16 00:38:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:29,141 INFO L93 Difference]: Finished difference Result 4097 states and 6083 transitions. [2019-11-16 00:38:29,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:29,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-11-16 00:38:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:29,143 INFO L225 Difference]: With dead ends: 4097 [2019-11-16 00:38:29,143 INFO L226 Difference]: Without dead ends: 2281 [2019-11-16 00:38:29,144 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-16 00:38:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2019-11-16 00:38:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 1996. [2019-11-16 00:38:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-11-16 00:38:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 3004 transitions. [2019-11-16 00:38:29,230 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 3004 transitions. Word has length 175 [2019-11-16 00:38:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:29,230 INFO L462 AbstractCegarLoop]: Abstraction has 1996 states and 3004 transitions. [2019-11-16 00:38:29,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:38:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 3004 transitions. [2019-11-16 00:38:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-16 00:38:29,231 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:29,231 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] [2019-11-16 00:38:29,231 INFO L410 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:29,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:29,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1112170898, now seen corresponding path program 1 times [2019-11-16 00:38:29,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:29,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304298201] [2019-11-16 00:38:29,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:29,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:29,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-16 00:38:29,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304298201] [2019-11-16 00:38:29,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:29,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:38:29,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550459855] [2019-11-16 00:38:29,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:38:29,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:29,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:38:29,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:29,324 INFO L87 Difference]: Start difference. First operand 1996 states and 3004 transitions. Second operand 5 states. [2019-11-16 00:38:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:29,803 INFO L93 Difference]: Finished difference Result 4368 states and 6590 transitions. [2019-11-16 00:38:29,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:29,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-11-16 00:38:29,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:29,805 INFO L225 Difference]: With dead ends: 4368 [2019-11-16 00:38:29,805 INFO L226 Difference]: Without dead ends: 2393 [2019-11-16 00:38:29,806 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-16 00:38:29,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2019-11-16 00:38:29,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 2106. [2019-11-16 00:38:29,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2019-11-16 00:38:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 3226 transitions. [2019-11-16 00:38:29,885 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 3226 transitions. Word has length 176 [2019-11-16 00:38:29,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:29,885 INFO L462 AbstractCegarLoop]: Abstraction has 2106 states and 3226 transitions. [2019-11-16 00:38:29,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:38:29,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 3226 transitions. [2019-11-16 00:38:29,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-16 00:38:29,886 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:29,886 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, 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] [2019-11-16 00:38:29,887 INFO L410 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:29,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:29,887 INFO L82 PathProgramCache]: Analyzing trace with hash -817941638, now seen corresponding path program 1 times [2019-11-16 00:38:29,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:29,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634540829] [2019-11-16 00:38:29,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:29,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:29,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:38:29,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634540829] [2019-11-16 00:38:29,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:29,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:29,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951650110] [2019-11-16 00:38:29,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:29,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:29,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:29,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:29,971 INFO L87 Difference]: Start difference. First operand 2106 states and 3226 transitions. Second operand 4 states. [2019-11-16 00:38:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:30,365 INFO L93 Difference]: Finished difference Result 4273 states and 6533 transitions. [2019-11-16 00:38:30,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:30,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-16 00:38:30,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:30,367 INFO L225 Difference]: With dead ends: 4273 [2019-11-16 00:38:30,367 INFO L226 Difference]: Without dead ends: 2188 [2019-11-16 00:38:30,369 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-16 00:38:30,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2188 states. [2019-11-16 00:38:30,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2188 to 2106. [2019-11-16 00:38:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2019-11-16 00:38:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 3223 transitions. [2019-11-16 00:38:30,464 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 3223 transitions. Word has length 177 [2019-11-16 00:38:30,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:30,465 INFO L462 AbstractCegarLoop]: Abstraction has 2106 states and 3223 transitions. [2019-11-16 00:38:30,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 3223 transitions. [2019-11-16 00:38:30,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-16 00:38:30,466 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:30,466 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, 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] [2019-11-16 00:38:30,466 INFO L410 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:30,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:30,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1410442171, now seen corresponding path program 1 times [2019-11-16 00:38:30,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:30,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259930625] [2019-11-16 00:38:30,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:30,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:30,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:30,529 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-16 00:38:30,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259930625] [2019-11-16 00:38:30,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:30,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:30,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440685804] [2019-11-16 00:38:30,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:30,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:30,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:30,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:30,530 INFO L87 Difference]: Start difference. First operand 2106 states and 3223 transitions. Second operand 4 states. [2019-11-16 00:38:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:30,889 INFO L93 Difference]: Finished difference Result 4267 states and 6521 transitions. [2019-11-16 00:38:30,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:30,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-16 00:38:30,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:30,892 INFO L225 Difference]: With dead ends: 4267 [2019-11-16 00:38:30,892 INFO L226 Difference]: Without dead ends: 2182 [2019-11-16 00:38:30,893 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-16 00:38:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2019-11-16 00:38:30,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 2106. [2019-11-16 00:38:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2019-11-16 00:38:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 3220 transitions. [2019-11-16 00:38:31,015 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 3220 transitions. Word has length 178 [2019-11-16 00:38:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:31,015 INFO L462 AbstractCegarLoop]: Abstraction has 2106 states and 3220 transitions. [2019-11-16 00:38:31,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:31,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 3220 transitions. [2019-11-16 00:38:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-16 00:38:31,016 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:31,016 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:38:31,016 INFO L410 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:31,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:31,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1394677973, now seen corresponding path program 1 times [2019-11-16 00:38:31,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:31,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447070795] [2019-11-16 00:38:31,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:31,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:31,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:38:31,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447070795] [2019-11-16 00:38:31,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061341262] [2019-11-16 00:38:31,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/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-16 00:38:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:31,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-16 00:38:31,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:31,681 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:31,681 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-16 00:38:31,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:31,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:31,723 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_165|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-11-16 00:38:31,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:31,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:31,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:31,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:31,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:31,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:31,768 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-16 00:38:31,769 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:31,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:31,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:31,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:31,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:31,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:31,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:31,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:31,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, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-16 00:38:31,806 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:31,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:31,868 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:38:31,868 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 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-16 00:38:31,869 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:31,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:31,888 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-16 00:38:31,888 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-16 00:38:31,948 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:38:31,948 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-16 00:38:31,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:31,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:31,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:31,959 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:38:32,001 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:38:32,001 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-16 00:38:32,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:32,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:38:32,013 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_168|]} [2019-11-16 00:38:32,022 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-16 00:38:32,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:32,099 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-16 00:38:32,100 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-16 00:38:32,100 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:32,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,109 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-16 00:38:32,147 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:38:32,147 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-16 00:38:32,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:32,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:38:32,207 INFO L341 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-16 00:38:32,207 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-16 00:38:32,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:32,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-16 00:38:32,222 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-11-16 00:38:32,224 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-16 00:38:32,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:32,279 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-16 00:38:32,279 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-16 00:38:32,280 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:32,289 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,289 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-16 00:38:32,299 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-11-16 00:38:32,306 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 49 treesize of output 37 [2019-11-16 00:38:32,306 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-16 00:38:32,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:32,464 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-16 00:38:32,464 INFO L341 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-16 00:38:32,465 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-11-16 00:38:32,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:32,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:32,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:32,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:32,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-16 00:38:32,631 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2019-11-16 00:38:32,632 INFO L567 ElimStorePlain]: treesize reduction 1115, result has 4.6 percent of original size [2019-11-16 00:38:32,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,632 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-16 00:38:32,638 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-11-16 00:38:32,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-16 00:38:32,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:32,720 INFO L341 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-16 00:38:32,721 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-16 00:38:32,721 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:32,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,730 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-16 00:38:32,740 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_161|], 12=[|v_#memory_$Pointer$.base_174|]} [2019-11-16 00:38:32,751 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 77 [2019-11-16 00:38:32,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:32,874 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-11-16 00:38:32,874 INFO L341 Elim1Store]: treesize reduction 36, result has 84.9 percent of original size [2019-11-16 00:38:32,875 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 248 [2019-11-16 00:38:32,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,879 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,916 INFO L567 ElimStorePlain]: treesize reduction 254, result has 17.5 percent of original size [2019-11-16 00:38:32,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,916 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:151, output treesize:53 [2019-11-16 00:38:32,925 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|, |v_#memory_int_178|], 2=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.base_163|], 6=[|v_#memory_$Pointer$.base_164|, |v_#memory_$Pointer$.offset_159|], 12=[|v_#memory_$Pointer$.base_175|]} [2019-11-16 00:38:32,936 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 19 treesize of output 1 [2019-11-16 00:38:32,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,992 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:32,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-11-16 00:38:33,002 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:33,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:33,051 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-16 00:38:33,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:33,125 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:33,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:33,186 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:33,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:33,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,298 INFO L341 Elim1Store]: treesize reduction 77, result has 47.6 percent of original size [2019-11-16 00:38:33,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 257 treesize of output 218 [2019-11-16 00:38:33,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,301 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2019-11-16 00:38:33,397 INFO L567 ElimStorePlain]: treesize reduction 371, result has 41.1 percent of original size [2019-11-16 00:38:33,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 186 [2019-11-16 00:38:33,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 134 [2019-11-16 00:38:33,429 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:33,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:33,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,620 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-11-16 00:38:33,620 INFO L341 Elim1Store]: treesize reduction 152, result has 48.3 percent of original size [2019-11-16 00:38:33,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 179 treesize of output 194 [2019-11-16 00:38:33,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,624 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:33,686 INFO L567 ElimStorePlain]: treesize reduction 96, result has 56.8 percent of original size [2019-11-16 00:38:33,687 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:33,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:33,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:33,710 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:336, output treesize:92 [2019-11-16 00:38:33,739 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_163|], 6=[|v_#memory_$Pointer$.base_176|], 12=[|v_#memory_int_179|]} [2019-11-16 00:38:33,743 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 53 treesize of output 41 [2019-11-16 00:38:33,743 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-16 00:38:33,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:33,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:33,768 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 45 [2019-11-16 00:38:33,768 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:33,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:33,789 INFO L341 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-11-16 00:38:33,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2019-11-16 00:38:33,790 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:33,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:33,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:33,797 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:38 [2019-11-16 00:38:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:38:34,160 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:38:34,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-16 00:38:34,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284150538] [2019-11-16 00:38:34,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:38:34,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:34,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:38:34,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:38:34,162 INFO L87 Difference]: Start difference. First operand 2106 states and 3220 transitions. Second operand 10 states. [2019-11-16 00:38:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:37,660 INFO L93 Difference]: Finished difference Result 9018 states and 13687 transitions. [2019-11-16 00:38:37,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:38:37,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2019-11-16 00:38:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:37,672 INFO L225 Difference]: With dead ends: 9018 [2019-11-16 00:38:37,672 INFO L226 Difference]: Without dead ends: 6933 [2019-11-16 00:38:37,675 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:38:37,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6933 states. [2019-11-16 00:38:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6933 to 4627. [2019-11-16 00:38:37,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4627 states. [2019-11-16 00:38:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4627 states to 4627 states and 7197 transitions. [2019-11-16 00:38:37,987 INFO L78 Accepts]: Start accepts. Automaton has 4627 states and 7197 transitions. Word has length 189 [2019-11-16 00:38:37,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:37,988 INFO L462 AbstractCegarLoop]: Abstraction has 4627 states and 7197 transitions. [2019-11-16 00:38:37,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:38:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 4627 states and 7197 transitions. [2019-11-16 00:38:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-16 00:38:37,993 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:37,994 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:38,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:38,200 INFO L410 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:38,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:38,200 INFO L82 PathProgramCache]: Analyzing trace with hash -261029862, now seen corresponding path program 1 times [2019-11-16 00:38:38,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:38,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839501350] [2019-11-16 00:38:38,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:38,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:38,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-16 00:38:38,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839501350] [2019-11-16 00:38:38,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:38,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:38,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681974533] [2019-11-16 00:38:38,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:38,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:38,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:38,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:38,288 INFO L87 Difference]: Start difference. First operand 4627 states and 7197 transitions. Second operand 4 states. [2019-11-16 00:38:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:39,093 INFO L93 Difference]: Finished difference Result 9443 states and 14648 transitions. [2019-11-16 00:38:39,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:39,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-16 00:38:39,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:39,108 INFO L225 Difference]: With dead ends: 9443 [2019-11-16 00:38:39,108 INFO L226 Difference]: Without dead ends: 4837 [2019-11-16 00:38:39,112 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-16 00:38:39,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4837 states. [2019-11-16 00:38:39,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4837 to 4627. [2019-11-16 00:38:39,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4627 states. [2019-11-16 00:38:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4627 states to 4627 states and 7189 transitions. [2019-11-16 00:38:39,392 INFO L78 Accepts]: Start accepts. Automaton has 4627 states and 7189 transitions. Word has length 197 [2019-11-16 00:38:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:39,393 INFO L462 AbstractCegarLoop]: Abstraction has 4627 states and 7189 transitions. [2019-11-16 00:38:39,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:39,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4627 states and 7189 transitions. [2019-11-16 00:38:39,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-16 00:38:39,396 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:39,397 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:39,397 INFO L410 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:39,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:39,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1822723231, now seen corresponding path program 1 times [2019-11-16 00:38:39,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:39,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796519124] [2019-11-16 00:38:39,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:39,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:39,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-16 00:38:39,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796519124] [2019-11-16 00:38:39,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:39,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:38:39,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812224896] [2019-11-16 00:38:39,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:38:39,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:39,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:38:39,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:38:39,503 INFO L87 Difference]: Start difference. First operand 4627 states and 7189 transitions. Second operand 4 states. [2019-11-16 00:38:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:40,057 INFO L93 Difference]: Finished difference Result 9427 states and 14616 transitions. [2019-11-16 00:38:40,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:40,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-16 00:38:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:40,063 INFO L225 Difference]: With dead ends: 9427 [2019-11-16 00:38:40,063 INFO L226 Difference]: Without dead ends: 4821 [2019-11-16 00:38:40,067 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-16 00:38:40,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4821 states. [2019-11-16 00:38:40,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4821 to 4627. [2019-11-16 00:38:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4627 states. [2019-11-16 00:38:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4627 states to 4627 states and 7181 transitions. [2019-11-16 00:38:40,321 INFO L78 Accepts]: Start accepts. Automaton has 4627 states and 7181 transitions. Word has length 198 [2019-11-16 00:38:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:40,321 INFO L462 AbstractCegarLoop]: Abstraction has 4627 states and 7181 transitions. [2019-11-16 00:38:40,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:38:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 4627 states and 7181 transitions. [2019-11-16 00:38:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-16 00:38:40,324 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:40,324 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:40,324 INFO L410 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:40,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:40,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1499491772, now seen corresponding path program 1 times [2019-11-16 00:38:40,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:40,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217446732] [2019-11-16 00:38:40,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:40,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:40,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-11-16 00:38:40,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217446732] [2019-11-16 00:38:40,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:40,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:38:40,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624744053] [2019-11-16 00:38:40,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:38:40,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:40,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:38:40,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:38:40,483 INFO L87 Difference]: Start difference. First operand 4627 states and 7181 transitions. Second operand 6 states. [2019-11-16 00:38:41,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:41,617 INFO L93 Difference]: Finished difference Result 10623 states and 16473 transitions. [2019-11-16 00:38:41,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:38:41,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 202 [2019-11-16 00:38:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:41,621 INFO L225 Difference]: With dead ends: 10623 [2019-11-16 00:38:41,621 INFO L226 Difference]: Without dead ends: 6017 [2019-11-16 00:38:41,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:38:41,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2019-11-16 00:38:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 4695. [2019-11-16 00:38:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4695 states. [2019-11-16 00:38:41,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 7285 transitions. [2019-11-16 00:38:41,829 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 7285 transitions. Word has length 202 [2019-11-16 00:38:41,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:41,829 INFO L462 AbstractCegarLoop]: Abstraction has 4695 states and 7285 transitions. [2019-11-16 00:38:41,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:38:41,829 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 7285 transitions. [2019-11-16 00:38:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-16 00:38:41,833 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:41,833 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:41,833 INFO L410 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:41,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:41,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2085109685, now seen corresponding path program 1 times [2019-11-16 00:38:41,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:41,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454095652] [2019-11-16 00:38:41,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:41,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:41,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-11-16 00:38:41,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454095652] [2019-11-16 00:38:41,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:41,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:38:41,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945420950] [2019-11-16 00:38:41,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:38:41,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:41,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:38:41,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:38:41,971 INFO L87 Difference]: Start difference. First operand 4695 states and 7285 transitions. Second operand 6 states. [2019-11-16 00:38:43,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:43,053 INFO L93 Difference]: Finished difference Result 10323 states and 15909 transitions. [2019-11-16 00:38:43,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:38:43,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-11-16 00:38:43,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:43,057 INFO L225 Difference]: With dead ends: 10323 [2019-11-16 00:38:43,057 INFO L226 Difference]: Without dead ends: 5649 [2019-11-16 00:38:43,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:38:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5649 states. [2019-11-16 00:38:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5649 to 4699. [2019-11-16 00:38:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4699 states. [2019-11-16 00:38:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4699 states to 4699 states and 7273 transitions. [2019-11-16 00:38:43,243 INFO L78 Accepts]: Start accepts. Automaton has 4699 states and 7273 transitions. Word has length 203 [2019-11-16 00:38:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:43,243 INFO L462 AbstractCegarLoop]: Abstraction has 4699 states and 7273 transitions. [2019-11-16 00:38:43,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:38:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 4699 states and 7273 transitions. [2019-11-16 00:38:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-16 00:38:43,246 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:43,246 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:43,246 INFO L410 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:43,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:43,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1958552144, now seen corresponding path program 1 times [2019-11-16 00:38:43,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:43,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955934269] [2019-11-16 00:38:43,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:43,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:43,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-16 00:38:43,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955934269] [2019-11-16 00:38:43,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:43,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:38:43,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225519547] [2019-11-16 00:38:43,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:38:43,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:43,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:38:43,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:43,389 INFO L87 Difference]: Start difference. First operand 4699 states and 7273 transitions. Second operand 5 states. [2019-11-16 00:38:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:44,105 INFO L93 Difference]: Finished difference Result 10291 states and 15927 transitions. [2019-11-16 00:38:44,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:44,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-11-16 00:38:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:44,109 INFO L225 Difference]: With dead ends: 10291 [2019-11-16 00:38:44,109 INFO L226 Difference]: Without dead ends: 5613 [2019-11-16 00:38:44,112 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-16 00:38:44,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5613 states. [2019-11-16 00:38:44,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5613 to 4995. [2019-11-16 00:38:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4995 states. [2019-11-16 00:38:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4995 states to 4995 states and 7793 transitions. [2019-11-16 00:38:44,312 INFO L78 Accepts]: Start accepts. Automaton has 4995 states and 7793 transitions. Word has length 209 [2019-11-16 00:38:44,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:44,313 INFO L462 AbstractCegarLoop]: Abstraction has 4995 states and 7793 transitions. [2019-11-16 00:38:44,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:38:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 4995 states and 7793 transitions. [2019-11-16 00:38:44,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-16 00:38:44,352 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:44,352 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:44,353 INFO L410 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:44,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:44,353 INFO L82 PathProgramCache]: Analyzing trace with hash 2001012022, now seen corresponding path program 1 times [2019-11-16 00:38:44,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:44,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770300989] [2019-11-16 00:38:44,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:44,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:44,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-16 00:38:44,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770300989] [2019-11-16 00:38:44,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:44,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:38:44,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604701245] [2019-11-16 00:38:44,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:38:44,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:44,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:38:44,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:44,487 INFO L87 Difference]: Start difference. First operand 4995 states and 7793 transitions. Second operand 5 states. [2019-11-16 00:38:45,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:45,377 INFO L93 Difference]: Finished difference Result 10563 states and 16399 transitions. [2019-11-16 00:38:45,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:38:45,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-11-16 00:38:45,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:45,382 INFO L225 Difference]: With dead ends: 10563 [2019-11-16 00:38:45,382 INFO L226 Difference]: Without dead ends: 5589 [2019-11-16 00:38:45,384 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-16 00:38:45,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5589 states. [2019-11-16 00:38:45,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5589 to 4983. [2019-11-16 00:38:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4983 states. [2019-11-16 00:38:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4983 states to 4983 states and 7765 transitions. [2019-11-16 00:38:45,570 INFO L78 Accepts]: Start accepts. Automaton has 4983 states and 7765 transitions. Word has length 210 [2019-11-16 00:38:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:45,570 INFO L462 AbstractCegarLoop]: Abstraction has 4983 states and 7765 transitions. [2019-11-16 00:38:45,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:38:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 4983 states and 7765 transitions. [2019-11-16 00:38:45,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-16 00:38:45,573 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:45,573 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:45,573 INFO L410 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:45,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:45,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1442165383, now seen corresponding path program 1 times [2019-11-16 00:38:45,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:45,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719813299] [2019-11-16 00:38:45,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:45,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:45,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 307 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-11-16 00:38:45,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719813299] [2019-11-16 00:38:45,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409606125] [2019-11-16 00:38:45,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:45,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:38:45,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:45,987 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 8 [2019-11-16 00:38:45,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:45,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:45,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:45,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-16 00:38:46,001 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_177|, |v_#memory_$Pointer$.offset_164|], 5=[|v_#memory_int_180|]} [2019-11-16 00:38:46,008 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 81 treesize of output 63 [2019-11-16 00:38:46,009 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-16 00:38:46,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:46,013 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 63 treesize of output 51 [2019-11-16 00:38:46,014 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:46,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:46,044 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:46,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-16 00:38:46,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:46,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:46,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:46,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:46,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:46,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:46,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:46,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:46,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:46,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:46,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:46,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:46,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:46,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:46,262 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) 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.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) 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-16 00:38:46,266 INFO L168 Benchmark]: Toolchain (without parser) took 75593.10 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 940.7 MB in the beginning and 1.5 GB in the end (delta: -534.6 MB). Peak memory consumption was 679.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:46,266 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:38:46,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:46,267 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.03 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-16 00:38:46,267 INFO L168 Benchmark]: Boogie Preprocessor took 118.06 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:46,267 INFO L168 Benchmark]: RCFGBuilder took 1298.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.4 MB in the end (delta: 96.9 MB). Peak memory consumption was 96.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:46,267 INFO L168 Benchmark]: TraceAbstraction took 73332.25 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 992.5 MB in the beginning and 1.5 GB in the end (delta: -482.7 MB). Peak memory consumption was 596.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:38:46,269 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 728.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.03 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 118.06 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1298.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.4 MB in the end (delta: 96.9 MB). Peak memory consumption was 96.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 73332.25 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 992.5 MB in the beginning and 1.5 GB in the end (delta: -482.7 MB). Peak memory consumption was 596.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:38:48,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:38:48,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:38:48,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:38:48,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:38:48,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:38:48,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:38:48,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:38:48,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:38:48,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:38:48,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:38:48,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:38:48,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:38:48,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:38:48,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:38:48,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:38:48,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:38:48,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:38:48,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:38:48,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:38:48,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:38:48,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:38:48,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:38:48,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:38:48,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:38:48,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:38:48,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:38:48,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:38:48,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:38:48,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:38:48,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:38:48,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:38:48,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:38:48,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:38:48,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:38:48,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:38:48,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:38:48,474 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:38:48,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:38:48,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:38:48,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:38:48,476 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:38:48,501 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:38:48,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:38:48,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:38:48,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:38:48,504 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:38:48,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:38:48,504 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:38:48,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:38:48,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:38:48,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:38:48,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:38:48,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:38:48,507 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:38:48,507 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:38:48,507 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:38:48,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:38:48,508 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:38:48,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:38:48,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:38:48,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:38:48,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:38:48,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:38:48,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:38:48,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:38:48,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:38:48,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:38:48,510 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:38:48,511 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:38:48,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:38:48,511 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:38:48,511 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_025e5793-902c-482c-8ddc-5a1906b7a127/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 -> 24241c008259f315336df16b66c76f690577877c [2019-11-16 00:38:48,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:38:48,555 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:38:48,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:38:48,560 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:38:48,560 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:38:48,561 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c [2019-11-16 00:38:48,621 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/data/5bf3d8b62/6e47128def4d4b9e941e4871370b28e5/FLAG2b434450f [2019-11-16 00:38:49,208 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:38:49,208 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c [2019-11-16 00:38:49,237 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/data/5bf3d8b62/6e47128def4d4b9e941e4871370b28e5/FLAG2b434450f [2019-11-16 00:38:49,468 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/data/5bf3d8b62/6e47128def4d4b9e941e4871370b28e5 [2019-11-16 00:38:49,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:38:49,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:38:49,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:38:49,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:38:49,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:38:49,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:38:49" (1/1) ... [2019-11-16 00:38:49,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@213a6361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:49, skipping insertion in model container [2019-11-16 00:38:49,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:38:49" (1/1) ... [2019-11-16 00:38:49,484 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:38:49,542 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:38:50,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:38:50,046 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:38:50,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:38:50,274 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:38:50,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:50 WrapperNode [2019-11-16 00:38:50,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:38:50,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:38:50,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:38:50,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:38:50,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:50" (1/1) ... [2019-11-16 00:38:50,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:50" (1/1) ... [2019-11-16 00:38:50,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:38:50,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:38:50,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:38:50,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:38:50,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:50" (1/1) ... [2019-11-16 00:38:50,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:50" (1/1) ... [2019-11-16 00:38:50,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:50" (1/1) ... [2019-11-16 00:38:50,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:50" (1/1) ... [2019-11-16 00:38:50,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:50" (1/1) ... [2019-11-16 00:38:50,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:50" (1/1) ... [2019-11-16 00:38:50,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:50" (1/1) ... [2019-11-16 00:38:50,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:38:50,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:38:50,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:38:50,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:38:50,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/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-16 00:38:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:38:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:38:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:38:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:38:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:38:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:38:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:38:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:38:50,889 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-16 00:38:53,475 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-16 00:38:53,475 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-16 00:38:53,476 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:38:53,477 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:38:53,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:53 BoogieIcfgContainer [2019-11-16 00:38:53,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:38:53,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:38:53,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:38:53,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:38:53,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:38:49" (1/3) ... [2019-11-16 00:38:53,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353a5815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:38:53, skipping insertion in model container [2019-11-16 00:38:53,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:50" (2/3) ... [2019-11-16 00:38:53,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353a5815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:38:53, skipping insertion in model container [2019-11-16 00:38:53,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:53" (3/3) ... [2019-11-16 00:38:53,485 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-2.c [2019-11-16 00:38:53,493 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:38:53,499 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:38:53,510 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:38:53,532 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:38:53,533 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:38:53,533 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:38:53,533 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:38:53,533 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:38:53,534 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:38:53,534 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:38:53,534 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:38:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-11-16 00:38:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-16 00:38:53,560 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:53,561 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:53,563 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:53,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:53,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1126320416, now seen corresponding path program 1 times [2019-11-16 00:38:53,579 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:38:53,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1012398792] [2019-11-16 00:38:53,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/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-16 00:38:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:53,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:38:53,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:53,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:53,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:38:54,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:54,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:54,025 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-16 00:38:54,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:38:54,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:54,058 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:54,059 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 31 treesize of output 24 [2019-11-16 00:38:54,062 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:54,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:54,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:54,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:38:54,096 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 15 treesize of output 7 [2019-11-16 00:38:54,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:54,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:54,099 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-16 00:38:54,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:38:54,119 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-16 00:38:54,119 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:38:54,174 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-16 00:38:54,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1012398792] [2019-11-16 00:38:54,176 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:54,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:38:54,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842024599] [2019-11-16 00:38:54,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:38:54,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:38:54,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:38:54,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:38:54,197 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 6 states. [2019-11-16 00:39:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:03,154 INFO L93 Difference]: Finished difference Result 518 states and 878 transitions. [2019-11-16 00:39:03,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:39:03,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-16 00:39:03,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:03,172 INFO L225 Difference]: With dead ends: 518 [2019-11-16 00:39:03,172 INFO L226 Difference]: Without dead ends: 343 [2019-11-16 00:39:03,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:39:03,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-16 00:39:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 172. [2019-11-16 00:39:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-16 00:39:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 274 transitions. [2019-11-16 00:39:03,231 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 274 transitions. Word has length 41 [2019-11-16 00:39:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:03,232 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 274 transitions. [2019-11-16 00:39:03,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:39:03,232 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 274 transitions. [2019-11-16 00:39:03,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:39:03,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:03,235 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:03,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:03,447 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:03,447 INFO L82 PathProgramCache]: Analyzing trace with hash 549661886, now seen corresponding path program 1 times [2019-11-16 00:39:03,448 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:03,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1333680715] [2019-11-16 00:39:03,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/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-16 00:39:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:03,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:03,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:03,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:03,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:39:03,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:03,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:03,759 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-16 00:39:03,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:03,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:03,780 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:03,780 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 31 treesize of output 24 [2019-11-16 00:39:03,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:03,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:03,796 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:03,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:03,809 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 15 treesize of output 7 [2019-11-16 00:39:03,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:03,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:03,813 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-16 00:39:03,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:03,828 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-16 00:39:03,828 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:03,878 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-16 00:39:03,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1333680715] [2019-11-16 00:39:03,879 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:03,879 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:03,879 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229621091] [2019-11-16 00:39:03,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:03,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:03,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:03,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:03,890 INFO L87 Difference]: Start difference. First operand 172 states and 274 transitions. Second operand 6 states. [2019-11-16 00:39:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:09,271 INFO L93 Difference]: Finished difference Result 540 states and 853 transitions. [2019-11-16 00:39:09,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:39:09,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-16 00:39:09,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:09,276 INFO L225 Difference]: With dead ends: 540 [2019-11-16 00:39:09,276 INFO L226 Difference]: Without dead ends: 376 [2019-11-16 00:39:09,277 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:39:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-11-16 00:39:09,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 212. [2019-11-16 00:39:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-16 00:39:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 348 transitions. [2019-11-16 00:39:09,294 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 348 transitions. Word has length 42 [2019-11-16 00:39:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:09,294 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 348 transitions. [2019-11-16 00:39:09,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:39:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 348 transitions. [2019-11-16 00:39:09,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-16 00:39:09,298 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:09,298 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:09,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:09,501 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:09,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:09,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1857018060, now seen corresponding path program 1 times [2019-11-16 00:39:09,502 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:09,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1919209977] [2019-11-16 00:39:09,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/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-16 00:39:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:09,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:09,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:09,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:09,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:39:09,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:09,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:09,885 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-16 00:39:09,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:09,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:09,918 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:09,919 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 31 treesize of output 24 [2019-11-16 00:39:09,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:09,931 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:09,931 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:09,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:09,940 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 15 treesize of output 7 [2019-11-16 00:39:09,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:09,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:09,942 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-16 00:39:09,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:09,962 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-16 00:39:09,962 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:10,006 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-16 00:39:10,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1919209977] [2019-11-16 00:39:10,007 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:10,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:10,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240159714] [2019-11-16 00:39:10,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:10,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:10,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:10,009 INFO L87 Difference]: Start difference. First operand 212 states and 348 transitions. Second operand 6 states. [2019-11-16 00:39:15,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:15,886 INFO L93 Difference]: Finished difference Result 653 states and 1063 transitions. [2019-11-16 00:39:15,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:39:15,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-16 00:39:15,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:15,890 INFO L225 Difference]: With dead ends: 653 [2019-11-16 00:39:15,890 INFO L226 Difference]: Without dead ends: 449 [2019-11-16 00:39:15,892 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:39:15,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-16 00:39:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 276. [2019-11-16 00:39:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-11-16 00:39:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 464 transitions. [2019-11-16 00:39:15,916 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 464 transitions. Word has length 70 [2019-11-16 00:39:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:15,916 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 464 transitions. [2019-11-16 00:39:15,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:39:15,917 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 464 transitions. [2019-11-16 00:39:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-16 00:39:15,921 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:15,921 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:16,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:16,126 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:16,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:16,126 INFO L82 PathProgramCache]: Analyzing trace with hash -146838364, now seen corresponding path program 1 times [2019-11-16 00:39:16,127 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:16,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1481572120] [2019-11-16 00:39:16,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/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-16 00:39:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:16,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:16,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:16,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:16,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:39:16,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:16,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:16,592 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-16 00:39:16,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:16,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:16,617 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:16,617 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 31 treesize of output 24 [2019-11-16 00:39:16,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:16,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:16,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:16,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:16,638 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 15 treesize of output 7 [2019-11-16 00:39:16,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:16,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:16,641 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-16 00:39:16,641 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:16,665 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:16,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1481572120] [2019-11-16 00:39:16,720 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:16,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:16,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932675462] [2019-11-16 00:39:16,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:16,722 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:16,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:16,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:16,722 INFO L87 Difference]: Start difference. First operand 276 states and 464 transitions. Second operand 6 states. [2019-11-16 00:39:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:22,576 INFO L93 Difference]: Finished difference Result 745 states and 1224 transitions. [2019-11-16 00:39:22,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:39:22,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-11-16 00:39:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:22,581 INFO L225 Difference]: With dead ends: 745 [2019-11-16 00:39:22,581 INFO L226 Difference]: Without dead ends: 477 [2019-11-16 00:39:22,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:39:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-11-16 00:39:22,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 313. [2019-11-16 00:39:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-11-16 00:39:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 530 transitions. [2019-11-16 00:39:22,597 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 530 transitions. Word has length 75 [2019-11-16 00:39:22,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:22,597 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 530 transitions. [2019-11-16 00:39:22,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:39:22,598 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 530 transitions. [2019-11-16 00:39:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-16 00:39:22,601 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:22,601 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:22,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:22,805 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:22,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:22,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1158415714, now seen corresponding path program 1 times [2019-11-16 00:39:22,806 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:22,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2003851062] [2019-11-16 00:39:22,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/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-16 00:39:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:23,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:23,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:23,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:23,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:39:23,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:23,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:23,269 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-16 00:39:23,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:23,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:23,284 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:23,284 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 31 treesize of output 24 [2019-11-16 00:39:23,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:23,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:23,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:23,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:23,305 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 15 treesize of output 7 [2019-11-16 00:39:23,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:23,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:23,307 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-16 00:39:23,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:23,322 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-16 00:39:23,322 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:23,360 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-16 00:39:23,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2003851062] [2019-11-16 00:39:23,360 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:23,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:23,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795397927] [2019-11-16 00:39:23,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:23,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:23,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:23,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:23,362 INFO L87 Difference]: Start difference. First operand 313 states and 530 transitions. Second operand 6 states. [2019-11-16 00:39:29,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:29,085 INFO L93 Difference]: Finished difference Result 777 states and 1281 transitions. [2019-11-16 00:39:29,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:39:29,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-11-16 00:39:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:29,099 INFO L225 Difference]: With dead ends: 777 [2019-11-16 00:39:29,099 INFO L226 Difference]: Without dead ends: 472 [2019-11-16 00:39:29,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:39:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-11-16 00:39:29,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 313. [2019-11-16 00:39:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-11-16 00:39:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 528 transitions. [2019-11-16 00:39:29,114 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 528 transitions. Word has length 76 [2019-11-16 00:39:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:29,117 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 528 transitions. [2019-11-16 00:39:29,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:39:29,117 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 528 transitions. [2019-11-16 00:39:29,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-16 00:39:29,122 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:29,123 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-16 00:39:29,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:29,327 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:29,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:29,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1526568741, now seen corresponding path program 1 times [2019-11-16 00:39:29,328 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:29,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [220661111] [2019-11-16 00:39:29,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/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-16 00:39:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:29,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:29,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:29,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:29,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:39:29,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:29,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:29,882 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-16 00:39:29,883 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:29,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:29,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:29,900 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 31 treesize of output 24 [2019-11-16 00:39:29,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:29,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:29,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:29,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:29,912 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 15 treesize of output 7 [2019-11-16 00:39:29,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:29,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:29,915 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-16 00:39:29,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:29,928 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:39:29,928 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:39:29,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [220661111] [2019-11-16 00:39:29,971 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:29,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:29,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231125474] [2019-11-16 00:39:29,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:29,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:29,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:29,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:29,972 INFO L87 Difference]: Start difference. First operand 313 states and 528 transitions. Second operand 6 states. [2019-11-16 00:39:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:36,567 INFO L93 Difference]: Finished difference Result 817 states and 1346 transitions. [2019-11-16 00:39:36,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:39:36,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-11-16 00:39:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:36,571 INFO L225 Difference]: With dead ends: 817 [2019-11-16 00:39:36,571 INFO L226 Difference]: Without dead ends: 512 [2019-11-16 00:39:36,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:39:36,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-16 00:39:36,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 329. [2019-11-16 00:39:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-16 00:39:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 550 transitions. [2019-11-16 00:39:36,583 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 550 transitions. Word has length 83 [2019-11-16 00:39:36,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:36,583 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 550 transitions. [2019-11-16 00:39:36,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:39:36,583 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 550 transitions. [2019-11-16 00:39:36,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-16 00:39:36,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:36,585 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-16 00:39:36,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:36,789 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:36,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:36,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1245723646, now seen corresponding path program 1 times [2019-11-16 00:39:36,790 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:36,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [909621264] [2019-11-16 00:39:36,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/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-16 00:39:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:37,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:37,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:37,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:37,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:39:37,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:37,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:37,214 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-16 00:39:37,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:37,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:37,236 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:37,236 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 31 treesize of output 24 [2019-11-16 00:39:37,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:37,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:37,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:37,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:37,251 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 15 treesize of output 7 [2019-11-16 00:39:37,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:37,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:37,253 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-16 00:39:37,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:39:37,268 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:39:37,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [909621264] [2019-11-16 00:39:37,332 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:37,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:37,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769230306] [2019-11-16 00:39:37,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:37,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:37,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:37,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:37,335 INFO L87 Difference]: Start difference. First operand 329 states and 550 transitions. Second operand 6 states. [2019-11-16 00:39:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:42,133 INFO L93 Difference]: Finished difference Result 807 states and 1317 transitions. [2019-11-16 00:39:42,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:39:42,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-11-16 00:39:42,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:42,137 INFO L225 Difference]: With dead ends: 807 [2019-11-16 00:39:42,137 INFO L226 Difference]: Without dead ends: 486 [2019-11-16 00:39:42,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:39:42,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-11-16 00:39:42,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 329. [2019-11-16 00:39:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-11-16 00:39:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 545 transitions. [2019-11-16 00:39:42,149 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 545 transitions. Word has length 84 [2019-11-16 00:39:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:42,149 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 545 transitions. [2019-11-16 00:39:42,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:39:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 545 transitions. [2019-11-16 00:39:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-16 00:39:42,150 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:42,151 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:42,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:42,363 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:42,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:42,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1179437904, now seen corresponding path program 1 times [2019-11-16 00:39:42,363 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:42,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2134787616] [2019-11-16 00:39:42,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:42,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:39:42,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:42,517 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:42,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2134787616] [2019-11-16 00:39:42,526 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:42,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:39:42,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421289581] [2019-11-16 00:39:42,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:39:42,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:42,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:39:42,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:39:42,528 INFO L87 Difference]: Start difference. First operand 329 states and 545 transitions. Second operand 3 states. [2019-11-16 00:39:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:43,021 INFO L93 Difference]: Finished difference Result 966 states and 1608 transitions. [2019-11-16 00:39:43,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:39:43,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-16 00:39:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:43,026 INFO L225 Difference]: With dead ends: 966 [2019-11-16 00:39:43,026 INFO L226 Difference]: Without dead ends: 645 [2019-11-16 00:39:43,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 165 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-16 00:39:43,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-11-16 00:39:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2019-11-16 00:39:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-11-16 00:39:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1067 transitions. [2019-11-16 00:39:43,045 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1067 transitions. Word has length 84 [2019-11-16 00:39:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:43,046 INFO L462 AbstractCegarLoop]: Abstraction has 645 states and 1067 transitions. [2019-11-16 00:39:43,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:39:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1067 transitions. [2019-11-16 00:39:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:39:43,048 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:43,048 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:43,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:43,250 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:43,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:43,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1962475415, now seen corresponding path program 1 times [2019-11-16 00:39:43,251 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:43,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1871482730] [2019-11-16 00:39:43,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:43,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:39:43,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:43,406 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:43,424 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:43,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1871482730] [2019-11-16 00:39:43,424 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:43,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:39:43,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125294673] [2019-11-16 00:39:43,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:39:43,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:43,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:39:43,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:39:43,425 INFO L87 Difference]: Start difference. First operand 645 states and 1067 transitions. Second operand 4 states. [2019-11-16 00:39:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:43,510 INFO L93 Difference]: Finished difference Result 1881 states and 3120 transitions. [2019-11-16 00:39:43,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:39:43,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-16 00:39:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:43,517 INFO L225 Difference]: With dead ends: 1881 [2019-11-16 00:39:43,517 INFO L226 Difference]: Without dead ends: 1244 [2019-11-16 00:39:43,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 166 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-16 00:39:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-11-16 00:39:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1238. [2019-11-16 00:39:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1238 states. [2019-11-16 00:39:43,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 2051 transitions. [2019-11-16 00:39:43,558 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 2051 transitions. Word has length 85 [2019-11-16 00:39:43,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:43,558 INFO L462 AbstractCegarLoop]: Abstraction has 1238 states and 2051 transitions. [2019-11-16 00:39:43,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:39:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 2051 transitions. [2019-11-16 00:39:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-16 00:39:43,560 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:43,561 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:43,773 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:43,773 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:43,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:43,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1538828693, now seen corresponding path program 1 times [2019-11-16 00:39:43,774 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:43,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [680335625] [2019-11-16 00:39:43,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:44,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:44,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:44,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:44,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:39:44,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:44,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:44,297 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-16 00:39:44,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:44,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:44,312 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:44,313 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 31 treesize of output 24 [2019-11-16 00:39:44,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:44,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:44,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:44,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:44,337 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 15 treesize of output 7 [2019-11-16 00:39:44,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:44,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:44,339 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-16 00:39:44,339 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:44,360 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:44,360 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:44,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [680335625] [2019-11-16 00:39:44,404 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:44,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:44,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299485723] [2019-11-16 00:39:44,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:44,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:44,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:44,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:44,406 INFO L87 Difference]: Start difference. First operand 1238 states and 2051 transitions. Second operand 6 states. [2019-11-16 00:39:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:48,448 INFO L93 Difference]: Finished difference Result 2994 states and 4867 transitions. [2019-11-16 00:39:48,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:39:48,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-16 00:39:48,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:48,460 INFO L225 Difference]: With dead ends: 2994 [2019-11-16 00:39:48,460 INFO L226 Difference]: Without dead ends: 1764 [2019-11-16 00:39:48,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:39:48,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-11-16 00:39:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1410. [2019-11-16 00:39:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2019-11-16 00:39:48,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 2343 transitions. [2019-11-16 00:39:48,505 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 2343 transitions. Word has length 85 [2019-11-16 00:39:48,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:48,505 INFO L462 AbstractCegarLoop]: Abstraction has 1410 states and 2343 transitions. [2019-11-16 00:39:48,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:39:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2343 transitions. [2019-11-16 00:39:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-16 00:39:48,508 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:48,508 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:48,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:48,721 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:48,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:48,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1276257225, now seen corresponding path program 1 times [2019-11-16 00:39:48,721 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:48,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1025262987] [2019-11-16 00:39:48,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:49,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:49,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:49,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:49,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:39:49,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:49,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:49,091 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-16 00:39:49,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:49,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:49,102 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:49,102 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 31 treesize of output 24 [2019-11-16 00:39:49,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:49,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:49,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:49,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:49,117 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 15 treesize of output 7 [2019-11-16 00:39:49,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:49,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:49,118 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-16 00:39:49,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:49,135 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:49,215 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:39:49,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1025262987] [2019-11-16 00:39:49,215 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:49,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:49,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917243149] [2019-11-16 00:39:49,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:49,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:49,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:49,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:49,216 INFO L87 Difference]: Start difference. First operand 1410 states and 2343 transitions. Second operand 6 states. [2019-11-16 00:39:56,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:39:56,112 INFO L93 Difference]: Finished difference Result 3174 states and 5174 transitions. [2019-11-16 00:39:56,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:39:56,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-16 00:39:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:39:56,123 INFO L225 Difference]: With dead ends: 3174 [2019-11-16 00:39:56,123 INFO L226 Difference]: Without dead ends: 1762 [2019-11-16 00:39:56,125 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:39:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-11-16 00:39:56,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1418. [2019-11-16 00:39:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-11-16 00:39:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2355 transitions. [2019-11-16 00:39:56,169 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2355 transitions. Word has length 86 [2019-11-16 00:39:56,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:39:56,169 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 2355 transitions. [2019-11-16 00:39:56,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:39:56,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2355 transitions. [2019-11-16 00:39:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:39:56,172 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:39:56,172 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:39:56,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:56,384 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:39:56,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:39:56,385 INFO L82 PathProgramCache]: Analyzing trace with hash 839242534, now seen corresponding path program 1 times [2019-11-16 00:39:56,385 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:39:56,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1509361654] [2019-11-16 00:39:56,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:39:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:39:56,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:39:56,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:39:56,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:56,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:39:56,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:56,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:56,928 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-16 00:39:56,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:39:56,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:56,942 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:56,942 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 31 treesize of output 24 [2019-11-16 00:39:56,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:56,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:56,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:56,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:39:56,962 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 15 treesize of output 7 [2019-11-16 00:39:56,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:56,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:56,966 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-16 00:39:56,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:39:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:39:56,980 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:39:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:39:57,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1509361654] [2019-11-16 00:39:57,036 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:57,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:39:57,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106010210] [2019-11-16 00:39:57,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:39:57,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:57,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:39:57,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:39:57,037 INFO L87 Difference]: Start difference. First operand 1418 states and 2355 transitions. Second operand 6 states. [2019-11-16 00:40:03,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:03,094 INFO L93 Difference]: Finished difference Result 3167 states and 5162 transitions. [2019-11-16 00:40:03,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:03,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-11-16 00:40:03,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:03,104 INFO L225 Difference]: With dead ends: 3167 [2019-11-16 00:40:03,104 INFO L226 Difference]: Without dead ends: 1757 [2019-11-16 00:40:03,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-11-16 00:40:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1418. [2019-11-16 00:40:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-11-16 00:40:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2328 transitions. [2019-11-16 00:40:03,146 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2328 transitions. Word has length 97 [2019-11-16 00:40:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:03,147 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 2328 transitions. [2019-11-16 00:40:03,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:03,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2328 transitions. [2019-11-16 00:40:03,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:40:03,149 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:03,149 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:03,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:03,354 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:03,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash 795135230, now seen corresponding path program 1 times [2019-11-16 00:40:03,355 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:03,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [420471951] [2019-11-16 00:40:03,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:03,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:03,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:03,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:03,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:40:03,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:03,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:03,753 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-16 00:40:03,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:03,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:03,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:03,764 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 31 treesize of output 24 [2019-11-16 00:40:03,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:03,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:03,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:03,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:03,775 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 15 treesize of output 7 [2019-11-16 00:40:03,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:03,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:03,781 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-16 00:40:03,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:40:03,795 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:40:03,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [420471951] [2019-11-16 00:40:03,827 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:03,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:03,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649974404] [2019-11-16 00:40:03,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:03,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:03,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:03,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:03,828 INFO L87 Difference]: Start difference. First operand 1418 states and 2328 transitions. Second operand 6 states. [2019-11-16 00:40:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:08,565 INFO L93 Difference]: Finished difference Result 3335 states and 5387 transitions. [2019-11-16 00:40:08,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:08,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-11-16 00:40:08,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:08,574 INFO L225 Difference]: With dead ends: 3335 [2019-11-16 00:40:08,574 INFO L226 Difference]: Without dead ends: 1925 [2019-11-16 00:40:08,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2019-11-16 00:40:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1538. [2019-11-16 00:40:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-11-16 00:40:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2513 transitions. [2019-11-16 00:40:08,649 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2513 transitions. Word has length 97 [2019-11-16 00:40:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:08,650 INFO L462 AbstractCegarLoop]: Abstraction has 1538 states and 2513 transitions. [2019-11-16 00:40:08,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2513 transitions. [2019-11-16 00:40:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-16 00:40:08,652 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:08,652 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:08,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:08,860 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:08,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:08,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1861579846, now seen corresponding path program 1 times [2019-11-16 00:40:08,860 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:08,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1273873293] [2019-11-16 00:40:08,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:09,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:09,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:09,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:09,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:40:09,460 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:09,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:09,468 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-16 00:40:09,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:09,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:09,485 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:09,485 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 31 treesize of output 24 [2019-11-16 00:40:09,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:09,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:09,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:09,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:09,500 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 15 treesize of output 7 [2019-11-16 00:40:09,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:09,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:09,506 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-16 00:40:09,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:09,526 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:09,555 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1273873293] [2019-11-16 00:40:09,555 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:09,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:09,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048085809] [2019-11-16 00:40:09,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:09,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:09,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:09,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:09,556 INFO L87 Difference]: Start difference. First operand 1538 states and 2513 transitions. Second operand 6 states. [2019-11-16 00:40:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:14,279 INFO L93 Difference]: Finished difference Result 3407 states and 5476 transitions. [2019-11-16 00:40:14,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:14,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-11-16 00:40:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:14,288 INFO L225 Difference]: With dead ends: 3407 [2019-11-16 00:40:14,288 INFO L226 Difference]: Without dead ends: 1877 [2019-11-16 00:40:14,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-11-16 00:40:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1538. [2019-11-16 00:40:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-11-16 00:40:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2482 transitions. [2019-11-16 00:40:14,333 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2482 transitions. Word has length 97 [2019-11-16 00:40:14,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:14,333 INFO L462 AbstractCegarLoop]: Abstraction has 1538 states and 2482 transitions. [2019-11-16 00:40:14,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:14,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2482 transitions. [2019-11-16 00:40:14,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:40:14,336 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:14,336 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:40:14,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:14,541 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:14,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:14,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1206787165, now seen corresponding path program 1 times [2019-11-16 00:40:14,542 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:14,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1833984979] [2019-11-16 00:40:14,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:14,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:14,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:14,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:14,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:40:14,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:15,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:15,004 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-16 00:40:15,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:15,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:15,018 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:15,018 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 31 treesize of output 24 [2019-11-16 00:40:15,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:15,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:15,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:15,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:15,032 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 15 treesize of output 7 [2019-11-16 00:40:15,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:15,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:15,034 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-16 00:40:15,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:15,045 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:15,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1833984979] [2019-11-16 00:40:15,074 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:15,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:15,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638025837] [2019-11-16 00:40:15,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:15,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:15,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:15,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:15,075 INFO L87 Difference]: Start difference. First operand 1538 states and 2482 transitions. Second operand 6 states. [2019-11-16 00:40:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:22,814 INFO L93 Difference]: Finished difference Result 3407 states and 5413 transitions. [2019-11-16 00:40:22,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:22,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-16 00:40:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:22,822 INFO L225 Difference]: With dead ends: 3407 [2019-11-16 00:40:22,822 INFO L226 Difference]: Without dead ends: 1877 [2019-11-16 00:40:22,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:22,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-11-16 00:40:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1538. [2019-11-16 00:40:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-11-16 00:40:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2451 transitions. [2019-11-16 00:40:22,868 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2451 transitions. Word has length 98 [2019-11-16 00:40:22,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:22,868 INFO L462 AbstractCegarLoop]: Abstraction has 1538 states and 2451 transitions. [2019-11-16 00:40:22,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2451 transitions. [2019-11-16 00:40:22,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-16 00:40:22,871 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:22,871 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:23,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:23,077 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:23,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:23,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1350300481, now seen corresponding path program 1 times [2019-11-16 00:40:23,077 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:23,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [874905158] [2019-11-16 00:40:23,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:23,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:23,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:23,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:23,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:40:23,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:23,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:23,571 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-16 00:40:23,571 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:23,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:23,584 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:23,584 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 31 treesize of output 24 [2019-11-16 00:40:23,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:23,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:23,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:23,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:23,597 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 15 treesize of output 7 [2019-11-16 00:40:23,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:23,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:23,600 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-16 00:40:23,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:40:23,615 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:40:23,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [874905158] [2019-11-16 00:40:23,678 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:23,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:23,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616573003] [2019-11-16 00:40:23,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:23,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:23,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:23,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:23,679 INFO L87 Difference]: Start difference. First operand 1538 states and 2451 transitions. Second operand 6 states. [2019-11-16 00:40:30,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:30,832 INFO L93 Difference]: Finished difference Result 3405 states and 5348 transitions. [2019-11-16 00:40:30,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:30,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-16 00:40:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:30,844 INFO L225 Difference]: With dead ends: 3405 [2019-11-16 00:40:30,844 INFO L226 Difference]: Without dead ends: 1875 [2019-11-16 00:40:30,846 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:30,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2019-11-16 00:40:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1538. [2019-11-16 00:40:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-11-16 00:40:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2428 transitions. [2019-11-16 00:40:30,889 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2428 transitions. Word has length 98 [2019-11-16 00:40:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:30,889 INFO L462 AbstractCegarLoop]: Abstraction has 1538 states and 2428 transitions. [2019-11-16 00:40:30,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2428 transitions. [2019-11-16 00:40:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-16 00:40:30,892 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:30,892 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:31,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:31,096 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:31,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:31,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1776290209, now seen corresponding path program 1 times [2019-11-16 00:40:31,097 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:31,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [128312576] [2019-11-16 00:40:31,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:31,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:31,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:31,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:31,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:40:31,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:31,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:31,609 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-16 00:40:31,609 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:31,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:31,625 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:31,625 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 31 treesize of output 24 [2019-11-16 00:40:31,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:31,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:31,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:31,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:31,637 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 15 treesize of output 7 [2019-11-16 00:40:31,638 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:31,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:31,642 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-16 00:40:31,642 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:31,659 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:31,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [128312576] [2019-11-16 00:40:31,714 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:31,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:31,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796792448] [2019-11-16 00:40:31,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:31,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:31,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:31,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:31,715 INFO L87 Difference]: Start difference. First operand 1538 states and 2428 transitions. Second operand 6 states. [2019-11-16 00:40:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:37,922 INFO L93 Difference]: Finished difference Result 3405 states and 5301 transitions. [2019-11-16 00:40:37,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:37,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-16 00:40:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:37,930 INFO L225 Difference]: With dead ends: 3405 [2019-11-16 00:40:37,931 INFO L226 Difference]: Without dead ends: 1875 [2019-11-16 00:40:37,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:37,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2019-11-16 00:40:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1538. [2019-11-16 00:40:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-11-16 00:40:37,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2397 transitions. [2019-11-16 00:40:37,974 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2397 transitions. Word has length 99 [2019-11-16 00:40:37,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:37,974 INFO L462 AbstractCegarLoop]: Abstraction has 1538 states and 2397 transitions. [2019-11-16 00:40:37,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:37,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2397 transitions. [2019-11-16 00:40:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-16 00:40:37,977 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:37,977 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:38,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:38,182 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:38,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:38,183 INFO L82 PathProgramCache]: Analyzing trace with hash 919384802, now seen corresponding path program 1 times [2019-11-16 00:40:38,183 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:38,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2034899130] [2019-11-16 00:40:38,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:38,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:38,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:38,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:38,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:40:38,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:38,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:38,676 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-16 00:40:38,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:38,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:38,690 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:38,690 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 31 treesize of output 24 [2019-11-16 00:40:38,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:38,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:38,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:38,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:38,699 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 15 treesize of output 7 [2019-11-16 00:40:38,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:38,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:38,701 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-16 00:40:38,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:38,712 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:38,712 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:38,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2034899130] [2019-11-16 00:40:38,742 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:38,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:38,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476714552] [2019-11-16 00:40:38,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:38,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:38,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:38,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:38,743 INFO L87 Difference]: Start difference. First operand 1538 states and 2397 transitions. Second operand 6 states. [2019-11-16 00:40:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:44,427 INFO L93 Difference]: Finished difference Result 3355 states and 5173 transitions. [2019-11-16 00:40:44,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:44,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-11-16 00:40:44,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:44,435 INFO L225 Difference]: With dead ends: 3355 [2019-11-16 00:40:44,435 INFO L226 Difference]: Without dead ends: 1825 [2019-11-16 00:40:44,437 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:44,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2019-11-16 00:40:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1538. [2019-11-16 00:40:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-11-16 00:40:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2366 transitions. [2019-11-16 00:40:44,475 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2366 transitions. Word has length 100 [2019-11-16 00:40:44,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:44,475 INFO L462 AbstractCegarLoop]: Abstraction has 1538 states and 2366 transitions. [2019-11-16 00:40:44,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2366 transitions. [2019-11-16 00:40:44,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-16 00:40:44,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:44,478 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:44,685 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:44,686 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1299440648, now seen corresponding path program 1 times [2019-11-16 00:40:44,686 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:44,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1364275064] [2019-11-16 00:40:44,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:45,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:45,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:45,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:45,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:40:45,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:45,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:45,196 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-16 00:40:45,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:45,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:45,216 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:45,216 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 31 treesize of output 24 [2019-11-16 00:40:45,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:45,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:45,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:45,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:45,232 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 15 treesize of output 7 [2019-11-16 00:40:45,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:45,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:45,235 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-16 00:40:45,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:40:45,254 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:40:45,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1364275064] [2019-11-16 00:40:45,289 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:45,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:45,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366841483] [2019-11-16 00:40:45,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:45,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:45,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:45,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:45,290 INFO L87 Difference]: Start difference. First operand 1538 states and 2366 transitions. Second operand 6 states. [2019-11-16 00:40:51,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:51,323 INFO L93 Difference]: Finished difference Result 3523 states and 5366 transitions. [2019-11-16 00:40:51,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:51,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-11-16 00:40:51,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:51,332 INFO L225 Difference]: With dead ends: 3523 [2019-11-16 00:40:51,332 INFO L226 Difference]: Without dead ends: 1993 [2019-11-16 00:40:51,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:51,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2019-11-16 00:40:51,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1650. [2019-11-16 00:40:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2019-11-16 00:40:51,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2515 transitions. [2019-11-16 00:40:51,372 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2515 transitions. Word has length 100 [2019-11-16 00:40:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:51,372 INFO L462 AbstractCegarLoop]: Abstraction has 1650 states and 2515 transitions. [2019-11-16 00:40:51,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2515 transitions. [2019-11-16 00:40:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-16 00:40:51,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:51,374 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:51,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:51,579 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:51,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:51,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1548720251, now seen corresponding path program 1 times [2019-11-16 00:40:51,580 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:51,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [879761182] [2019-11-16 00:40:51,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:52,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:52,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:52,089 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:52,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:40:52,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:52,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:52,098 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-16 00:40:52,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:52,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:52,116 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:52,116 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 31 treesize of output 24 [2019-11-16 00:40:52,117 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:52,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:52,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:52,122 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:52,134 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 15 treesize of output 7 [2019-11-16 00:40:52,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:52,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:52,136 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-16 00:40:52,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:40:52,154 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-16 00:40:52,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [879761182] [2019-11-16 00:40:52,216 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:52,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:52,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866806732] [2019-11-16 00:40:52,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:52,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:52,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:52,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:52,218 INFO L87 Difference]: Start difference. First operand 1650 states and 2515 transitions. Second operand 6 states. [2019-11-16 00:40:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:56,398 INFO L93 Difference]: Finished difference Result 3571 states and 5394 transitions. [2019-11-16 00:40:56,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:40:56,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-11-16 00:40:56,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:56,415 INFO L225 Difference]: With dead ends: 3571 [2019-11-16 00:40:56,420 INFO L226 Difference]: Without dead ends: 1929 [2019-11-16 00:40:56,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2019-11-16 00:40:56,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1650. [2019-11-16 00:40:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2019-11-16 00:40:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2488 transitions. [2019-11-16 00:40:56,462 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2488 transitions. Word has length 101 [2019-11-16 00:40:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:56,462 INFO L462 AbstractCegarLoop]: Abstraction has 1650 states and 2488 transitions. [2019-11-16 00:40:56,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:40:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2488 transitions. [2019-11-16 00:40:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-16 00:40:56,464 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:56,464 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:56,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:56,670 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:56,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:56,670 INFO L82 PathProgramCache]: Analyzing trace with hash -312417619, now seen corresponding path program 1 times [2019-11-16 00:40:56,670 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:56,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1239952411] [2019-11-16 00:40:56,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:57,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:40:57,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:57,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:57,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:40:57,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:57,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:57,080 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-16 00:40:57,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:40:57,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:57,092 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:57,092 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 31 treesize of output 24 [2019-11-16 00:40:57,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:57,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:57,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:57,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:40:57,111 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 15 treesize of output 7 [2019-11-16 00:40:57,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:57,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:57,113 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-16 00:40:57,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:40:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-16 00:40:57,141 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-16 00:40:57,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1239952411] [2019-11-16 00:40:57,185 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:57,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:40:57,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924187936] [2019-11-16 00:40:57,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:40:57,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:57,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:40:57,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:40:57,186 INFO L87 Difference]: Start difference. First operand 1650 states and 2488 transitions. Second operand 6 states. [2019-11-16 00:41:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:05,102 INFO L93 Difference]: Finished difference Result 3739 states and 5587 transitions. [2019-11-16 00:41:05,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:41:05,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2019-11-16 00:41:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:05,108 INFO L225 Difference]: With dead ends: 3739 [2019-11-16 00:41:05,108 INFO L226 Difference]: Without dead ends: 2097 [2019-11-16 00:41:05,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:41:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2019-11-16 00:41:05,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 1790. [2019-11-16 00:41:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1790 states. [2019-11-16 00:41:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2684 transitions. [2019-11-16 00:41:05,160 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2684 transitions. Word has length 107 [2019-11-16 00:41:05,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:05,160 INFO L462 AbstractCegarLoop]: Abstraction has 1790 states and 2684 transitions. [2019-11-16 00:41:05,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:41:05,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2684 transitions. [2019-11-16 00:41:05,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-16 00:41:05,161 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:05,161 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:05,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:05,362 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:05,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:05,362 INFO L82 PathProgramCache]: Analyzing trace with hash 440006667, now seen corresponding path program 1 times [2019-11-16 00:41:05,363 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:41:05,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1284591927] [2019-11-16 00:41:05,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:05,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:41:05,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:05,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:05,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:41:05,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:05,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:05,793 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-16 00:41:05,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:41:05,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:05,813 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:05,814 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 31 treesize of output 24 [2019-11-16 00:41:05,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:05,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:05,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:05,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:41:05,827 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 15 treesize of output 7 [2019-11-16 00:41:05,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:05,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:05,829 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-16 00:41:05,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:41:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-16 00:41:05,854 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:41:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-16 00:41:05,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1284591927] [2019-11-16 00:41:05,909 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:05,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:41:05,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914197186] [2019-11-16 00:41:05,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:41:05,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:41:05,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:41:05,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:41:05,911 INFO L87 Difference]: Start difference. First operand 1790 states and 2684 transitions. Second operand 6 states. [2019-11-16 00:41:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:14,698 INFO L93 Difference]: Finished difference Result 3849 states and 5728 transitions. [2019-11-16 00:41:14,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:41:14,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2019-11-16 00:41:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:14,701 INFO L225 Difference]: With dead ends: 3849 [2019-11-16 00:41:14,702 INFO L226 Difference]: Without dead ends: 2067 [2019-11-16 00:41:14,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:41:14,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-11-16 00:41:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1790. [2019-11-16 00:41:14,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1790 states. [2019-11-16 00:41:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1790 states to 1790 states and 2668 transitions. [2019-11-16 00:41:14,742 INFO L78 Accepts]: Start accepts. Automaton has 1790 states and 2668 transitions. Word has length 108 [2019-11-16 00:41:14,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:14,742 INFO L462 AbstractCegarLoop]: Abstraction has 1790 states and 2668 transitions. [2019-11-16 00:41:14,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:41:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1790 states and 2668 transitions. [2019-11-16 00:41:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-16 00:41:14,744 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:14,744 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:14,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:14,945 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:14,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:14,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1511099163, now seen corresponding path program 1 times [2019-11-16 00:41:14,945 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:41:14,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [156045530] [2019-11-16 00:41:14,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:15,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:41:15,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:15,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:15,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:41:15,474 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:15,483 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-16 00:41:15,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:41:15,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:15,496 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:15,496 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 31 treesize of output 24 [2019-11-16 00:41:15,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:15,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:41:15,519 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 15 treesize of output 7 [2019-11-16 00:41:15,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:15,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:15,522 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-16 00:41:15,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:41:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-16 00:41:15,544 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:41:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-16 00:41:15,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [156045530] [2019-11-16 00:41:15,591 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:15,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:41:15,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039267548] [2019-11-16 00:41:15,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:41:15,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:41:15,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:41:15,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:41:15,592 INFO L87 Difference]: Start difference. First operand 1790 states and 2668 transitions. Second operand 6 states. [2019-11-16 00:41:20,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:20,493 INFO L93 Difference]: Finished difference Result 4022 states and 5940 transitions. [2019-11-16 00:41:20,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:41:20,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-11-16 00:41:20,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:20,498 INFO L225 Difference]: With dead ends: 4022 [2019-11-16 00:41:20,498 INFO L226 Difference]: Without dead ends: 2240 [2019-11-16 00:41:20,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:41:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-11-16 00:41:20,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1959. [2019-11-16 00:41:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2019-11-16 00:41:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 2901 transitions. [2019-11-16 00:41:20,568 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 2901 transitions. Word has length 127 [2019-11-16 00:41:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:20,568 INFO L462 AbstractCegarLoop]: Abstraction has 1959 states and 2901 transitions. [2019-11-16 00:41:20,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:41:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2901 transitions. [2019-11-16 00:41:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-16 00:41:20,571 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:20,571 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:41:20,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:20,776 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:20,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:20,776 INFO L82 PathProgramCache]: Analyzing trace with hash -153427270, now seen corresponding path program 1 times [2019-11-16 00:41:20,777 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:41:20,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [668413705] [2019-11-16 00:41:20,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:21,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:41:21,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:21,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:21,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:41:21,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:21,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:21,593 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-16 00:41:21,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:41:21,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:21,611 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:21,612 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 31 treesize of output 24 [2019-11-16 00:41:21,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:21,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:21,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:21,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:41:21,624 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 15 treesize of output 7 [2019-11-16 00:41:21,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:21,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:21,626 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-16 00:41:21,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:41:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-16 00:41:21,656 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:41:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-16 00:41:21,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [668413705] [2019-11-16 00:41:21,709 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:21,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:41:21,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030231388] [2019-11-16 00:41:21,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:41:21,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:41:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:41:21,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:41:21,712 INFO L87 Difference]: Start difference. First operand 1959 states and 2901 transitions. Second operand 6 states. [2019-11-16 00:41:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:28,332 INFO L93 Difference]: Finished difference Result 4355 states and 6396 transitions. [2019-11-16 00:41:28,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:41:28,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-11-16 00:41:28,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:28,336 INFO L225 Difference]: With dead ends: 4355 [2019-11-16 00:41:28,336 INFO L226 Difference]: Without dead ends: 2404 [2019-11-16 00:41:28,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:41:28,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2019-11-16 00:41:28,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2063. [2019-11-16 00:41:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2063 states. [2019-11-16 00:41:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2063 states to 2063 states and 3022 transitions. [2019-11-16 00:41:28,404 INFO L78 Accepts]: Start accepts. Automaton has 2063 states and 3022 transitions. Word has length 128 [2019-11-16 00:41:28,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:28,404 INFO L462 AbstractCegarLoop]: Abstraction has 2063 states and 3022 transitions. [2019-11-16 00:41:28,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:41:28,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 3022 transitions. [2019-11-16 00:41:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-16 00:41:28,407 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:28,407 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:28,612 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:28,612 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:28,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:28,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1270276199, now seen corresponding path program 1 times [2019-11-16 00:41:28,613 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:41:28,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [320483932] [2019-11-16 00:41:28,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:29,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:41:29,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:29,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:29,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:41:29,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:29,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:29,123 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-16 00:41:29,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:41:29,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:29,134 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:29,134 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 31 treesize of output 24 [2019-11-16 00:41:29,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:29,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:29,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:29,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:41:29,163 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 15 treesize of output 7 [2019-11-16 00:41:29,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:29,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:29,165 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-16 00:41:29,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:41:29,190 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-16 00:41:29,191 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:41:29,233 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-16 00:41:29,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [320483932] [2019-11-16 00:41:29,233 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:29,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:41:29,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034629217] [2019-11-16 00:41:29,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:41:29,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:41:29,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:41:29,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:41:29,234 INFO L87 Difference]: Start difference. First operand 2063 states and 3022 transitions. Second operand 6 states. [2019-11-16 00:41:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:35,258 INFO L93 Difference]: Finished difference Result 4394 states and 6400 transitions. [2019-11-16 00:41:35,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:41:35,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-11-16 00:41:35,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:35,264 INFO L225 Difference]: With dead ends: 4394 [2019-11-16 00:41:35,264 INFO L226 Difference]: Without dead ends: 2299 [2019-11-16 00:41:35,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:41:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2019-11-16 00:41:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2026. [2019-11-16 00:41:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2019-11-16 00:41:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2961 transitions. [2019-11-16 00:41:35,334 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2961 transitions. Word has length 128 [2019-11-16 00:41:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:35,335 INFO L462 AbstractCegarLoop]: Abstraction has 2026 states and 2961 transitions. [2019-11-16 00:41:35,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:41:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2961 transitions. [2019-11-16 00:41:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-16 00:41:35,337 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:35,337 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:41:35,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:35,542 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:35,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:35,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1372547753, now seen corresponding path program 1 times [2019-11-16 00:41:35,543 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:41:35,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [824132265] [2019-11-16 00:41:35,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:36,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:41:36,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:36,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:36,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:41:36,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:36,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:36,362 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-16 00:41:36,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:41:36,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:36,375 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:36,375 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 31 treesize of output 24 [2019-11-16 00:41:36,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:36,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:36,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:36,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:41:36,385 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 15 treesize of output 7 [2019-11-16 00:41:36,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:36,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:36,387 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-16 00:41:36,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:41:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-16 00:41:36,407 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:41:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-16 00:41:36,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [824132265] [2019-11-16 00:41:36,451 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:36,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:41:36,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685929988] [2019-11-16 00:41:36,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:41:36,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:41:36,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:41:36,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:41:36,452 INFO L87 Difference]: Start difference. First operand 2026 states and 2961 transitions. Second operand 6 states. [2019-11-16 00:41:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:46,163 INFO L93 Difference]: Finished difference Result 4310 states and 6266 transitions. [2019-11-16 00:41:46,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:41:46,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-11-16 00:41:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:46,165 INFO L225 Difference]: With dead ends: 4310 [2019-11-16 00:41:46,165 INFO L226 Difference]: Without dead ends: 2292 [2019-11-16 00:41:46,167 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:41:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2019-11-16 00:41:46,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2026. [2019-11-16 00:41:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2019-11-16 00:41:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2922 transitions. [2019-11-16 00:41:46,213 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2922 transitions. Word has length 129 [2019-11-16 00:41:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:46,213 INFO L462 AbstractCegarLoop]: Abstraction has 2026 states and 2922 transitions. [2019-11-16 00:41:46,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:41:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2922 transitions. [2019-11-16 00:41:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-16 00:41:46,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:46,216 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 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-16 00:41:46,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:46,421 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:46,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:46,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1160708458, now seen corresponding path program 1 times [2019-11-16 00:41:46,421 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:41:46,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1801413038] [2019-11-16 00:41:46,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:46,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:41:46,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:46,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:46,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:41:46,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:46,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:46,916 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-16 00:41:46,916 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:41:46,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:46,928 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:46,928 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 31 treesize of output 24 [2019-11-16 00:41:46,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:46,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:46,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:46,934 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:41:46,938 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 15 treesize of output 7 [2019-11-16 00:41:46,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:46,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:46,939 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-16 00:41:46,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:41:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-16 00:41:46,961 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:41:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-16 00:41:47,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1801413038] [2019-11-16 00:41:47,009 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:47,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:41:47,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550113442] [2019-11-16 00:41:47,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:41:47,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:41:47,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:41:47,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:41:47,010 INFO L87 Difference]: Start difference. First operand 2026 states and 2922 transitions. Second operand 6 states. [2019-11-16 00:41:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:41:52,426 INFO L93 Difference]: Finished difference Result 4446 states and 6383 transitions. [2019-11-16 00:41:52,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:41:52,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-11-16 00:41:52,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:41:52,428 INFO L225 Difference]: With dead ends: 4446 [2019-11-16 00:41:52,428 INFO L226 Difference]: Without dead ends: 2428 [2019-11-16 00:41:52,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 271 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:41:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2019-11-16 00:41:52,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2158. [2019-11-16 00:41:52,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2158 states. [2019-11-16 00:41:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 3090 transitions. [2019-11-16 00:41:52,483 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 3090 transitions. Word has length 139 [2019-11-16 00:41:52,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:41:52,483 INFO L462 AbstractCegarLoop]: Abstraction has 2158 states and 3090 transitions. [2019-11-16 00:41:52,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:41:52,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 3090 transitions. [2019-11-16 00:41:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-16 00:41:52,485 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:41:52,485 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:41:52,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:52,690 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:41:52,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:41:52,690 INFO L82 PathProgramCache]: Analyzing trace with hash -950605676, now seen corresponding path program 1 times [2019-11-16 00:41:52,690 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:41:52,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1283277052] [2019-11-16 00:41:52,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:41:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:41:53,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:41:53,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:41:53,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:53,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:41:53,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:53,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:53,182 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-16 00:41:53,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:41:53,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:41:53,196 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:53,197 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 31 treesize of output 24 [2019-11-16 00:41:53,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:53,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:53,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:41:53,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:41:53,207 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 15 treesize of output 7 [2019-11-16 00:41:53,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:41:53,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:41:53,209 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-16 00:41:53,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:41:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-16 00:41:53,233 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:41:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-16 00:41:53,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1283277052] [2019-11-16 00:41:53,276 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:41:53,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:41:53,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159976517] [2019-11-16 00:41:53,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:41:53,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:41:53,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:41:53,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:41:53,277 INFO L87 Difference]: Start difference. First operand 2158 states and 3090 transitions. Second operand 6 states. [2019-11-16 00:42:00,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:00,131 INFO L93 Difference]: Finished difference Result 4570 states and 6517 transitions. [2019-11-16 00:42:00,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:00,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-11-16 00:42:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:00,135 INFO L225 Difference]: With dead ends: 4570 [2019-11-16 00:42:00,135 INFO L226 Difference]: Without dead ends: 2375 [2019-11-16 00:42:00,137 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:42:00,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states. [2019-11-16 00:42:00,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 2113. [2019-11-16 00:42:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2019-11-16 00:42:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 3001 transitions. [2019-11-16 00:42:00,261 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 3001 transitions. Word has length 140 [2019-11-16 00:42:00,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:00,261 INFO L462 AbstractCegarLoop]: Abstraction has 2113 states and 3001 transitions. [2019-11-16 00:42:00,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3001 transitions. [2019-11-16 00:42:00,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-16 00:42:00,263 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:00,264 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:42:00,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:00,464 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:00,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:00,464 INFO L82 PathProgramCache]: Analyzing trace with hash -14654078, now seen corresponding path program 1 times [2019-11-16 00:42:00,465 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:00,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2139571568] [2019-11-16 00:42:00,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:01,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:01,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:01,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:01,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:42:01,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:01,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:01,071 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-16 00:42:01,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:42:01,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:01,083 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:01,083 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 31 treesize of output 24 [2019-11-16 00:42:01,084 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:01,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:01,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:01,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:42:01,092 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 15 treesize of output 7 [2019-11-16 00:42:01,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:01,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:01,094 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-16 00:42:01,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:42:01,119 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-16 00:42:01,119 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-16 00:42:01,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2139571568] [2019-11-16 00:42:01,175 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:01,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:01,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971070772] [2019-11-16 00:42:01,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:01,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:01,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:01,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:01,179 INFO L87 Difference]: Start difference. First operand 2113 states and 3001 transitions. Second operand 6 states. [2019-11-16 00:42:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:08,406 INFO L93 Difference]: Finished difference Result 4546 states and 6440 transitions. [2019-11-16 00:42:08,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:08,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-11-16 00:42:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:08,410 INFO L225 Difference]: With dead ends: 4546 [2019-11-16 00:42:08,410 INFO L226 Difference]: Without dead ends: 2441 [2019-11-16 00:42:08,412 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 291 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:42:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2019-11-16 00:42:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 2179. [2019-11-16 00:42:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2179 states. [2019-11-16 00:42:08,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3050 transitions. [2019-11-16 00:42:08,491 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 3050 transitions. Word has length 149 [2019-11-16 00:42:08,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:08,491 INFO L462 AbstractCegarLoop]: Abstraction has 2179 states and 3050 transitions. [2019-11-16 00:42:08,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 3050 transitions. [2019-11-16 00:42:08,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-16 00:42:08,494 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:08,494 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:42:08,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:08,698 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:08,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:08,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1541696965, now seen corresponding path program 1 times [2019-11-16 00:42:08,699 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:08,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [678775301] [2019-11-16 00:42:08,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:09,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:09,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:09,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:09,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:42:09,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:09,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:09,326 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-16 00:42:09,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:42:09,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:09,340 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:09,340 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 31 treesize of output 24 [2019-11-16 00:42:09,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:09,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:09,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:09,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:42:09,349 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 15 treesize of output 7 [2019-11-16 00:42:09,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:09,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:09,351 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-16 00:42:09,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:42:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-16 00:42:09,371 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-16 00:42:09,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [678775301] [2019-11-16 00:42:09,452 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:09,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:09,452 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454163475] [2019-11-16 00:42:09,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:09,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:09,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:09,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:09,453 INFO L87 Difference]: Start difference. First operand 2179 states and 3050 transitions. Second operand 6 states. [2019-11-16 00:42:21,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:21,058 INFO L93 Difference]: Finished difference Result 4595 states and 6416 transitions. [2019-11-16 00:42:21,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:21,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-11-16 00:42:21,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:21,064 INFO L225 Difference]: With dead ends: 4595 [2019-11-16 00:42:21,064 INFO L226 Difference]: Without dead ends: 2424 [2019-11-16 00:42:21,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:42:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2019-11-16 00:42:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 2179. [2019-11-16 00:42:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2179 states. [2019-11-16 00:42:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3003 transitions. [2019-11-16 00:42:21,132 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 3003 transitions. Word has length 150 [2019-11-16 00:42:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:21,133 INFO L462 AbstractCegarLoop]: Abstraction has 2179 states and 3003 transitions. [2019-11-16 00:42:21,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 3003 transitions. [2019-11-16 00:42:21,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-16 00:42:21,134 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:21,134 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:21,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:21,335 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:21,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1474738817, now seen corresponding path program 1 times [2019-11-16 00:42:21,336 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:21,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [102084730] [2019-11-16 00:42:21,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:22,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:22,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:22,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:22,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:42:22,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:22,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:22,352 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-16 00:42:22,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:42:22,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:22,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:22,382 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 31 treesize of output 24 [2019-11-16 00:42:22,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:22,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:22,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:22,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:42:22,398 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 15 treesize of output 7 [2019-11-16 00:42:22,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:22,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:22,400 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-16 00:42:22,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:42:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:42:22,429 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:42:22,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [102084730] [2019-11-16 00:42:22,484 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:22,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:22,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266708200] [2019-11-16 00:42:22,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:22,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:22,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:22,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:22,486 INFO L87 Difference]: Start difference. First operand 2179 states and 3003 transitions. Second operand 6 states. [2019-11-16 00:42:30,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:30,842 INFO L93 Difference]: Finished difference Result 4695 states and 6461 transitions. [2019-11-16 00:42:30,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:30,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-11-16 00:42:30,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:30,846 INFO L225 Difference]: With dead ends: 4695 [2019-11-16 00:42:30,846 INFO L226 Difference]: Without dead ends: 2524 [2019-11-16 00:42:30,848 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:42:30,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2019-11-16 00:42:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 2275. [2019-11-16 00:42:30,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2275 states. [2019-11-16 00:42:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 3092 transitions. [2019-11-16 00:42:30,905 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 3092 transitions. Word has length 150 [2019-11-16 00:42:30,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:30,906 INFO L462 AbstractCegarLoop]: Abstraction has 2275 states and 3092 transitions. [2019-11-16 00:42:30,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 3092 transitions. [2019-11-16 00:42:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-16 00:42:30,907 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:30,907 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:31,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:31,110 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:31,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:31,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1355078146, now seen corresponding path program 1 times [2019-11-16 00:42:31,111 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:31,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [642382196] [2019-11-16 00:42:31,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:32,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:42:32,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:32,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:32,106 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-16 00:42:32,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:32,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:32,114 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-16 00:42:32,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-16 00:42:32,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:32,128 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:32,128 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 31 treesize of output 24 [2019-11-16 00:42:32,129 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:32,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:32,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:32,134 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-16 00:42:32,137 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 15 treesize of output 7 [2019-11-16 00:42:32,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:32,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:32,139 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-16 00:42:32,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-16 00:42:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:42:32,159 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:32,220 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-16 00:42:32,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [642382196] [2019-11-16 00:42:32,221 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:32,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-16 00:42:32,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070526407] [2019-11-16 00:42:32,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:42:32,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:32,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:42:32,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:42:32,222 INFO L87 Difference]: Start difference. First operand 2275 states and 3092 transitions. Second operand 6 states. [2019-11-16 00:42:37,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:37,333 INFO L93 Difference]: Finished difference Result 4199 states and 5706 transitions. [2019-11-16 00:42:37,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:42:37,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2019-11-16 00:42:37,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:37,337 INFO L225 Difference]: With dead ends: 4199 [2019-11-16 00:42:37,337 INFO L226 Difference]: Without dead ends: 1912 [2019-11-16 00:42:37,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:42:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2019-11-16 00:42:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1722. [2019-11-16 00:42:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2019-11-16 00:42:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 2310 transitions. [2019-11-16 00:42:37,419 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 2310 transitions. Word has length 151 [2019-11-16 00:42:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:37,419 INFO L462 AbstractCegarLoop]: Abstraction has 1722 states and 2310 transitions. [2019-11-16 00:42:37,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:42:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2310 transitions. [2019-11-16 00:42:37,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-16 00:42:37,421 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:37,421 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, 1] [2019-11-16 00:42:37,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:37,622 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:37,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:37,622 INFO L82 PathProgramCache]: Analyzing trace with hash -947218713, now seen corresponding path program 1 times [2019-11-16 00:42:37,623 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:37,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1547186153] [2019-11-16 00:42:37,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:37,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:42:37,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:42:37,910 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-16 00:42:37,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1547186153] [2019-11-16 00:42:37,935 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:37,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:42:37,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520982280] [2019-11-16 00:42:37,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:37,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:37,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:37,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:37,937 INFO L87 Difference]: Start difference. First operand 1722 states and 2310 transitions. Second operand 3 states. [2019-11-16 00:42:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:39,729 INFO L93 Difference]: Finished difference Result 3957 states and 5308 transitions. [2019-11-16 00:42:39,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:39,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-16 00:42:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:39,731 INFO L225 Difference]: With dead ends: 3957 [2019-11-16 00:42:39,732 INFO L226 Difference]: Without dead ends: 2267 [2019-11-16 00:42:39,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 327 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-16 00:42:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2019-11-16 00:42:39,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2265. [2019-11-16 00:42:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2265 states. [2019-11-16 00:42:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3034 transitions. [2019-11-16 00:42:39,791 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3034 transitions. Word has length 165 [2019-11-16 00:42:39,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:39,791 INFO L462 AbstractCegarLoop]: Abstraction has 2265 states and 3034 transitions. [2019-11-16 00:42:39,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3034 transitions. [2019-11-16 00:42:39,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-16 00:42:39,793 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:39,793 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, 1, 1] [2019-11-16 00:42:39,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:39,996 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:39,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:39,996 INFO L82 PathProgramCache]: Analyzing trace with hash -730951185, now seen corresponding path program 1 times [2019-11-16 00:42:39,996 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:39,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1516791086] [2019-11-16 00:42:39,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:40,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:42:40,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:42:40,219 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-16 00:42:40,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1516791086] [2019-11-16 00:42:40,244 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:40,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:42:40,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863943143] [2019-11-16 00:42:40,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:40,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:40,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:40,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:40,245 INFO L87 Difference]: Start difference. First operand 2265 states and 3034 transitions. Second operand 3 states. [2019-11-16 00:42:41,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:41,124 INFO L93 Difference]: Finished difference Result 5034 states and 6748 transitions. [2019-11-16 00:42:41,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:41,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-16 00:42:41,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:41,126 INFO L225 Difference]: With dead ends: 5034 [2019-11-16 00:42:41,126 INFO L226 Difference]: Without dead ends: 2801 [2019-11-16 00:42:41,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 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-16 00:42:41,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2019-11-16 00:42:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 2779. [2019-11-16 00:42:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2019-11-16 00:42:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 3731 transitions. [2019-11-16 00:42:41,200 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 3731 transitions. Word has length 166 [2019-11-16 00:42:41,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:41,200 INFO L462 AbstractCegarLoop]: Abstraction has 2779 states and 3731 transitions. [2019-11-16 00:42:41,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3731 transitions. [2019-11-16 00:42:41,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-16 00:42:41,202 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:41,202 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, 1, 1] [2019-11-16 00:42:41,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:41,403 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:41,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:41,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1165456783, now seen corresponding path program 1 times [2019-11-16 00:42:41,403 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:41,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1158740897] [2019-11-16 00:42:41,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:42:41,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-16 00:42:41,623 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-16 00:42:41,638 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1158740897] [2019-11-16 00:42:41,638 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:41,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-16 00:42:41,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303711290] [2019-11-16 00:42:41,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:41,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:42:41,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:41,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:41,639 INFO L87 Difference]: Start difference. First operand 2779 states and 3731 transitions. Second operand 3 states. [2019-11-16 00:42:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:42,572 INFO L93 Difference]: Finished difference Result 5575 states and 7487 transitions. [2019-11-16 00:42:42,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:42,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-16 00:42:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:42,574 INFO L225 Difference]: With dead ends: 5575 [2019-11-16 00:42:42,574 INFO L226 Difference]: Without dead ends: 2828 [2019-11-16 00:42:42,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 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-16 00:42:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2019-11-16 00:42:42,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 2828. [2019-11-16 00:42:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2019-11-16 00:42:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 3797 transitions. [2019-11-16 00:42:42,677 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 3797 transitions. Word has length 166 [2019-11-16 00:42:42,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:42,677 INFO L462 AbstractCegarLoop]: Abstraction has 2828 states and 3797 transitions. [2019-11-16 00:42:42,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 3797 transitions. [2019-11-16 00:42:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-16 00:42:42,679 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:42,679 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:42:42,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:42,880 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:42,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:42,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1394677973, now seen corresponding path program 1 times [2019-11-16 00:42:42,881 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:42:42,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1783505597] [2019-11-16 00:42:42,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_025e5793-902c-482c-8ddc-5a1906b7a127/bin/uautomizer/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:45,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-16 00:42:45,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:46,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:42:46,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:48,750 WARN L191 SmtUtils]: Spent 2.45 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-16 00:42:48,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:48,753 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_369|, |v_#memory_$Pointer$.base_369|], 2=[|v_#memory_$Pointer$.offset_362|, |v_#memory_$Pointer$.offset_363|, |v_#memory_$Pointer$.base_363|, |v_#memory_$Pointer$.base_362|]} [2019-11-16 00:42:48,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:48,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:49,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:49,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:49,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:49,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:49,328 INFO L235 Elim1Store]: Index analysis took 433 ms [2019-11-16 00:42:49,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-16 00:42:49,801 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:51,086 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 65 [2019-11-16 00:42:51,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:51,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:51,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:51,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:51,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:51,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:51,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:51,392 INFO L235 Elim1Store]: Index analysis took 242 ms [2019-11-16 00:42:51,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-16 00:42:51,561 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:52,259 WARN L191 SmtUtils]: Spent 697.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-16 00:42:52,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:52,274 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:42:52,604 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-16 00:42:52,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:52,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-16 00:42:52,694 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:52,867 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-16 00:42:52,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:52,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-16 00:42:52,894 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:52,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:52,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:52,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-16 00:42:52,971 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,004 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:156, output treesize:23 [2019-11-16 00:42:53,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:42:53,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:42:53,060 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,068 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-16 00:42:53,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:42:53,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:42:53,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,119 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-16 00:42:53,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:42:53,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:42:53,277 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:42:53,313 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:42:53,330 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,338 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-16 00:42:53,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:42:53,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:42:53,371 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,379 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-16 00:42:53,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:42:53,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:42:53,404 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,411 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,411 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-16 00:42:53,426 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-16 00:42:53,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:42:53,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-16 00:42:53,600 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:42:53,623 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,634 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-16 00:42:53,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2019-11-16 00:42:53,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-11-16 00:42:53,662 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,670 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:23 [2019-11-16 00:42:53,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:42:53,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:42:53,799 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,840 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-16 00:42:53,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2019-11-16 00:42:53,869 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,880 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-16 00:42:53,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:53,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2019-11-16 00:42:53,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-11-16 00:42:53,922 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:53,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:53,933 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:23 [2019-11-16 00:42:53,937 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_442|], 2=[|v_#memory_$Pointer$.offset_368|, |v_#memory_$Pointer$.offset_379|, |v_#memory_$Pointer$.base_379|, |v_#memory_$Pointer$.base_367|], 6=[|v_#memory_$Pointer$.base_368|, |v_#memory_$Pointer$.offset_367|]} [2019-11-16 00:42:54,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:54,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:54,314 INFO L235 Elim1Store]: Index analysis took 208 ms [2019-11-16 00:42:54,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-11-16 00:42:54,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:55,613 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 75 [2019-11-16 00:42:55,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:55,627 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:42:56,409 WARN L191 SmtUtils]: Spent 781.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-16 00:42:56,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:56,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:56,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:42:56,543 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:57,076 WARN L191 SmtUtils]: Spent 533.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-16 00:42:57,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:57,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:57,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:42:57,136 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:57,306 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-16 00:42:57,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:57,311 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:42:57,488 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-16 00:42:57,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:57,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:57,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:57,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:57,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 98 [2019-11-16 00:42:57,496 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:57,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:57,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:57,577 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 61 [2019-11-16 00:42:57,577 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:57,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:57,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:57,616 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:306, output treesize:54 [2019-11-16 00:42:57,644 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_380|, |v_#memory_$Pointer$.offset_380|], 20=[|v_#memory_int_443|]} [2019-11-16 00:42:57,648 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 55 treesize of output 37 [2019-11-16 00:42:57,649 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-16 00:42:57,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:57,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-16 00:42:57,680 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:57,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:57,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:42:57,704 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 0 case distinctions, treesize of input 43 treesize of output 35 [2019-11-16 00:42:57,705 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:57,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:57,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:42:57,717 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:85, output treesize:37 [2019-11-16 00:42:57,771 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 33 treesize of output 13 [2019-11-16 00:42:57,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:42:57,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:42:57,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:42:57,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:3 [2019-11-16 00:42:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:42:58,007 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:42:58,070 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_368|, |v_#memory_$Pointer$.base_382|, |v_#memory_$Pointer$.offset_382|, |v_#memory_$Pointer$.base_367|], 3=[|#memory_int|], 6=[|v_#memory_$Pointer$.base_368|, |v_#memory_$Pointer$.offset_367|]} [2019-11-16 00:42:58,115 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-16 00:43:00,058 WARN L191 SmtUtils]: Spent 1.94 s on a formula simplification that was a NOOP. DAG size: 80 [2019-11-16 00:43:00,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:00,073 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:00,838 WARN L191 SmtUtils]: Spent 764.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-16 00:43:00,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:00,846 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-16 00:43:01,155 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-16 00:43:01,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:01,160 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:01,381 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-16 00:43:01,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:01,395 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 739 treesize of output 571 [2019-11-16 00:43:01,396 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:01,820 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-11-16 00:43:01,820 INFO L567 ElimStorePlain]: treesize reduction 283, result has 53.1 percent of original size [2019-11-16 00:43:01,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,835 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:01,993 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-16 00:43:01,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:01,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:01,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,007 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:02,111 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-16 00:43:02,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:02,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:02,117 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:309, output treesize:500 [2019-11-16 00:43:02,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:02,224 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-16 00:43:02,265 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:02,283 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-16 00:43:02,304 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:05,894 WARN L191 SmtUtils]: Spent 3.59 s on a formula simplification. DAG size of input: 121 DAG size of output: 120 [2019-11-16 00:43:05,895 INFO L567 ElimStorePlain]: treesize reduction 245, result has 88.3 percent of original size [2019-11-16 00:43:05,919 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:05,932 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:05,969 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:05,984 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:10,398 WARN L191 SmtUtils]: Spent 4.41 s on a formula simplification that was a NOOP. DAG size: 138 [2019-11-16 00:43:10,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:10,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 28 dim-0 vars, and 4 xjuncts. [2019-11-16 00:43:10,399 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:1227, output treesize:2625 [2019-11-16 00:43:13,203 WARN L191 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 156 DAG size of output: 45 [2019-11-16 00:43:13,226 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_366|, |v_#memory_$Pointer$.offset_366|], 6=[|v_#memory_$Pointer$.offset_384|], 14=[|v_#memory_$Pointer$.base_384|]} [2019-11-16 00:43:13,247 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:13,512 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-16 00:43:13,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:13,523 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:13,674 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-16 00:43:13,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:13,678 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-16 00:43:13,832 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-16 00:43:13,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:13,834 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:13,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:13,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:13,883 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:393, output treesize:792 [2019-11-16 00:43:18,934 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_385|], 14=[|v_#memory_$Pointer$.base_385|]} [2019-11-16 00:43:18,939 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-16 00:43:19,048 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-16 00:43:19,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,050 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:19,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:19,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:19,106 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:413, output treesize:1432 [2019-11-16 00:43:23,728 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_365|, |v_#memory_$Pointer$.offset_365|], 19=[|v_#memory_$Pointer$.offset_386|], 31=[|v_#memory_$Pointer$.base_386|]} [2019-11-16 00:43:23,773 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-16 00:43:24,369 WARN L191 SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-16 00:43:24,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:24,391 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:24,765 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-16 00:43:24,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:24,768 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-16 00:43:24,934 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-16 00:43:24,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:24,938 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:25,057 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-16 00:43:25,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:25,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:25,057 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:1513, output treesize:3832 [2019-11-16 00:43:34,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:34,573 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) 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:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.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-16 00:43:34,581 INFO L168 Benchmark]: Toolchain (without parser) took 285109.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.4 MB). Free memory was 941.6 MB in the beginning and 948.3 MB in the end (delta: -6.7 MB). Peak memory consumption was 228.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:43:34,581 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:43:34,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:43:34,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.66 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-16 00:43:34,582 INFO L168 Benchmark]: Boogie Preprocessor took 137.55 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.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:43:34,583 INFO L168 Benchmark]: RCFGBuilder took 2956.80 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: 89.5 MB). Peak memory consumption was 89.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:43:34,589 INFO L168 Benchmark]: TraceAbstraction took 281100.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.8 MB). Free memory was 1.0 GB in the beginning and 948.3 MB in the end (delta: 80.8 MB). Peak memory consumption was 151.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:43:34,592 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 803.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.66 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 137.55 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.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2956.80 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: 89.5 MB). Peak memory consumption was 89.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 281100.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.8 MB). Free memory was 1.0 GB in the beginning and 948.3 MB in the end (delta: 80.8 MB). Peak memory consumption was 151.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...