./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/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 e83cf3c2949f89871817218ec6b0742e2a7cf269 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/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 e83cf3c2949f89871817218ec6b0742e2a7cf269 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 15:44:49,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:44:49,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:44:49,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:44:49,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:44:49,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:44:49,627 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:44:49,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:44:49,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:44:49,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:44:49,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:44:49,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:44:49,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:44:49,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:44:49,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:44:49,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:44:49,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:44:49,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:44:49,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:44:49,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:44:49,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:44:49,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:44:49,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:44:49,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:44:49,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:44:49,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:44:49,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:44:49,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:44:49,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:44:49,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:44:49,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:44:49,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:44:49,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:44:49,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:44:49,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:44:49,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:44:49,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:44:49,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:44:49,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:44:49,647 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:44:49,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:44:49,648 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 15:44:49,657 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:44:49,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:44:49,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:44:49,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:44:49,658 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:44:49,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:44:49,659 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:44:49,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:44:49,659 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:44:49,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:44:49,659 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:44:49,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:44:49,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:44:49,659 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:44:49,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:44:49,660 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:44:49,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:44:49,660 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:44:49,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:44:49,660 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:44:49,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:44:49,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:44:49,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:44:49,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:44:49,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:44:49,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:44:49,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:44:49,661 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:44:49,661 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:44:49,661 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_09a12c8f-d080-451c-be84-40b870252120/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 -> e83cf3c2949f89871817218ec6b0742e2a7cf269 [2019-12-07 15:44:49,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:44:49,780 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:44:49,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:44:49,784 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:44:49,784 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:44:49,785 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c [2019-12-07 15:44:49,830 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/data/f4576fb7c/20c68f52dc354356bc64baca365f2bee/FLAGf2ed41db3 [2019-12-07 15:44:50,264 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:44:50,265 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c [2019-12-07 15:44:50,277 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/data/f4576fb7c/20c68f52dc354356bc64baca365f2bee/FLAGf2ed41db3 [2019-12-07 15:44:50,608 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/data/f4576fb7c/20c68f52dc354356bc64baca365f2bee [2019-12-07 15:44:50,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:44:50,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:44:50,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:44:50,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:44:50,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:44:50,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:44:50" (1/1) ... [2019-12-07 15:44:50,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5f4880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:44:50, skipping insertion in model container [2019-12-07 15:44:50,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:44:50" (1/1) ... [2019-12-07 15:44:50,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:44:50,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:44:50,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:44:50,936 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:44:51,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:44:51,016 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:44:51,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:44:51 WrapperNode [2019-12-07 15:44:51,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:44:51,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:44:51,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:44:51,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:44:51,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:44:51" (1/1) ... [2019-12-07 15:44:51,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:44:51" (1/1) ... [2019-12-07 15:44:51,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:44:51,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:44:51,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:44:51,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:44:51,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:44:51" (1/1) ... [2019-12-07 15:44:51,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:44:51" (1/1) ... [2019-12-07 15:44:51,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:44:51" (1/1) ... [2019-12-07 15:44:51,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:44:51" (1/1) ... [2019-12-07 15:44:51,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:44:51" (1/1) ... [2019-12-07 15:44:51,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:44:51" (1/1) ... [2019-12-07 15:44:51,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:44:51" (1/1) ... [2019-12-07 15:44:51,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:44:51,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:44:51,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:44:51,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:44:51,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:44:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:44:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 15:44:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:44:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:44:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 15:44:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 15:44:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 15:44:51,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:44:51,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:44:51,304 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 15:44:51,824 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 15:44:51,824 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 15:44:51,825 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:44:51,825 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 15:44:51,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:44:51 BoogieIcfgContainer [2019-12-07 15:44:51,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:44:51,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:44:51,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:44:51,829 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:44:51,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:44:50" (1/3) ... [2019-12-07 15:44:51,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445be0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:44:51, skipping insertion in model container [2019-12-07 15:44:51,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:44:51" (2/3) ... [2019-12-07 15:44:51,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445be0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:44:51, skipping insertion in model container [2019-12-07 15:44:51,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:44:51" (3/3) ... [2019-12-07 15:44:51,831 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-2.c [2019-12-07 15:44:51,837 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:44:51,842 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 15:44:51,850 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 15:44:51,866 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:44:51,866 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:44:51,866 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:44:51,866 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:44:51,866 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:44:51,866 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:44:51,866 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:44:51,867 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:44:51,880 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-12-07 15:44:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 15:44:51,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:51,886 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:51,886 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:51,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:51,890 INFO L82 PathProgramCache]: Analyzing trace with hash 557483936, now seen corresponding path program 1 times [2019-12-07 15:44:51,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:51,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006124610] [2019-12-07 15:44:51,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:52,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006124610] [2019-12-07 15:44:52,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:52,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:52,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695154338] [2019-12-07 15:44:52,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:52,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:52,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:52,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:52,128 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 4 states. [2019-12-07 15:44:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:52,418 INFO L93 Difference]: Finished difference Result 329 states and 559 transitions. [2019-12-07 15:44:52,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:52,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 15:44:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:52,428 INFO L225 Difference]: With dead ends: 329 [2019-12-07 15:44:52,428 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 15:44:52,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:52,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 15:44:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-12-07 15:44:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 15:44:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 232 transitions. [2019-12-07 15:44:52,464 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 232 transitions. Word has length 42 [2019-12-07 15:44:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:52,464 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 232 transitions. [2019-12-07 15:44:52,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 232 transitions. [2019-12-07 15:44:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 15:44:52,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:52,467 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:52,467 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:52,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:52,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1960137762, now seen corresponding path program 1 times [2019-12-07 15:44:52,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:52,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001587276] [2019-12-07 15:44:52,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:52,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001587276] [2019-12-07 15:44:52,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:52,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:52,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031045574] [2019-12-07 15:44:52,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:52,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:52,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:52,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:52,544 INFO L87 Difference]: Start difference. First operand 149 states and 232 transitions. Second operand 4 states. [2019-12-07 15:44:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:52,779 INFO L93 Difference]: Finished difference Result 296 states and 455 transitions. [2019-12-07 15:44:52,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:52,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 15:44:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:52,781 INFO L225 Difference]: With dead ends: 296 [2019-12-07 15:44:52,781 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 15:44:52,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 15:44:52,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-12-07 15:44:52,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 15:44:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 231 transitions. [2019-12-07 15:44:52,792 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 231 transitions. Word has length 55 [2019-12-07 15:44:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:52,792 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 231 transitions. [2019-12-07 15:44:52,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 231 transitions. [2019-12-07 15:44:52,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:44:52,795 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:52,795 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:52,795 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:52,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:52,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1719614288, now seen corresponding path program 1 times [2019-12-07 15:44:52,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:52,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240950076] [2019-12-07 15:44:52,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:52,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240950076] [2019-12-07 15:44:52,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:52,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:52,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105928624] [2019-12-07 15:44:52,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:52,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:52,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:52,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:52,872 INFO L87 Difference]: Start difference. First operand 149 states and 231 transitions. Second operand 4 states. [2019-12-07 15:44:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:53,086 INFO L93 Difference]: Finished difference Result 295 states and 453 transitions. [2019-12-07 15:44:53,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:53,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 15:44:53,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:53,088 INFO L225 Difference]: With dead ends: 295 [2019-12-07 15:44:53,088 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 15:44:53,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:53,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 15:44:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2019-12-07 15:44:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 15:44:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 230 transitions. [2019-12-07 15:44:53,099 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 230 transitions. Word has length 56 [2019-12-07 15:44:53,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:53,099 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 230 transitions. [2019-12-07 15:44:53,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:53,099 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 230 transitions. [2019-12-07 15:44:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:44:53,100 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:53,101 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:53,101 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:53,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:53,101 INFO L82 PathProgramCache]: Analyzing trace with hash 857090501, now seen corresponding path program 1 times [2019-12-07 15:44:53,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:53,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908784696] [2019-12-07 15:44:53,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:53,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908784696] [2019-12-07 15:44:53,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:53,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:53,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040281393] [2019-12-07 15:44:53,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:53,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:53,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:53,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:53,151 INFO L87 Difference]: Start difference. First operand 149 states and 230 transitions. Second operand 4 states. [2019-12-07 15:44:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:53,350 INFO L93 Difference]: Finished difference Result 293 states and 450 transitions. [2019-12-07 15:44:53,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:53,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 15:44:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:53,351 INFO L225 Difference]: With dead ends: 293 [2019-12-07 15:44:53,351 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 15:44:53,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:53,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 15:44:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2019-12-07 15:44:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 15:44:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 229 transitions. [2019-12-07 15:44:53,360 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 229 transitions. Word has length 56 [2019-12-07 15:44:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:53,361 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 229 transitions. [2019-12-07 15:44:53,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:53,361 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 229 transitions. [2019-12-07 15:44:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:44:53,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:53,362 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:53,362 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:53,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:53,362 INFO L82 PathProgramCache]: Analyzing trace with hash -463762811, now seen corresponding path program 1 times [2019-12-07 15:44:53,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:53,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712326451] [2019-12-07 15:44:53,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:53,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712326451] [2019-12-07 15:44:53,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:53,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:53,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815061517] [2019-12-07 15:44:53,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:53,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:53,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:53,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:53,420 INFO L87 Difference]: Start difference. First operand 149 states and 229 transitions. Second operand 4 states. [2019-12-07 15:44:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:53,622 INFO L93 Difference]: Finished difference Result 292 states and 448 transitions. [2019-12-07 15:44:53,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:53,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 15:44:53,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:53,623 INFO L225 Difference]: With dead ends: 292 [2019-12-07 15:44:53,624 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 15:44:53,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:53,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 15:44:53,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-12-07 15:44:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 15:44:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2019-12-07 15:44:53,630 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 56 [2019-12-07 15:44:53,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:53,630 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2019-12-07 15:44:53,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:53,630 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2019-12-07 15:44:53,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:44:53,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:53,631 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:53,631 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:53,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:53,632 INFO L82 PathProgramCache]: Analyzing trace with hash 672103484, now seen corresponding path program 1 times [2019-12-07 15:44:53,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:53,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041424264] [2019-12-07 15:44:53,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:53,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041424264] [2019-12-07 15:44:53,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:53,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:53,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901575594] [2019-12-07 15:44:53,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:53,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:53,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:53,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:53,681 INFO L87 Difference]: Start difference. First operand 149 states and 228 transitions. Second operand 4 states. [2019-12-07 15:44:53,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:53,851 INFO L93 Difference]: Finished difference Result 292 states and 447 transitions. [2019-12-07 15:44:53,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:53,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 15:44:53,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:53,852 INFO L225 Difference]: With dead ends: 292 [2019-12-07 15:44:53,853 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 15:44:53,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 15:44:53,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-12-07 15:44:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 15:44:53,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 227 transitions. [2019-12-07 15:44:53,857 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 227 transitions. Word has length 56 [2019-12-07 15:44:53,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:53,857 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 227 transitions. [2019-12-07 15:44:53,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:53,858 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 227 transitions. [2019-12-07 15:44:53,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 15:44:53,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:53,859 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:53,859 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:53,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:53,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1092203463, now seen corresponding path program 1 times [2019-12-07 15:44:53,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:53,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901841850] [2019-12-07 15:44:53,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:53,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901841850] [2019-12-07 15:44:53,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:53,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:53,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411072883] [2019-12-07 15:44:53,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:53,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:53,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:53,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:53,904 INFO L87 Difference]: Start difference. First operand 149 states and 227 transitions. Second operand 4 states. [2019-12-07 15:44:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:54,098 INFO L93 Difference]: Finished difference Result 292 states and 446 transitions. [2019-12-07 15:44:54,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:54,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 15:44:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:54,099 INFO L225 Difference]: With dead ends: 292 [2019-12-07 15:44:54,099 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 15:44:54,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 15:44:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-12-07 15:44:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 15:44:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 226 transitions. [2019-12-07 15:44:54,103 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 226 transitions. Word has length 57 [2019-12-07 15:44:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:54,103 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 226 transitions. [2019-12-07 15:44:54,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2019-12-07 15:44:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 15:44:54,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:54,104 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:54,104 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:54,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:54,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1572913161, now seen corresponding path program 1 times [2019-12-07 15:44:54,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:54,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436392718] [2019-12-07 15:44:54,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:54,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436392718] [2019-12-07 15:44:54,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:54,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:54,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63667181] [2019-12-07 15:44:54,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:54,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:54,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:54,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:54,140 INFO L87 Difference]: Start difference. First operand 149 states and 226 transitions. Second operand 4 states. [2019-12-07 15:44:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:54,350 INFO L93 Difference]: Finished difference Result 292 states and 445 transitions. [2019-12-07 15:44:54,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:54,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 15:44:54,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:54,352 INFO L225 Difference]: With dead ends: 292 [2019-12-07 15:44:54,352 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 15:44:54,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:54,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 15:44:54,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-12-07 15:44:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 15:44:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 225 transitions. [2019-12-07 15:44:54,357 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 225 transitions. Word has length 58 [2019-12-07 15:44:54,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:54,358 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 225 transitions. [2019-12-07 15:44:54,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:54,358 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 225 transitions. [2019-12-07 15:44:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 15:44:54,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:54,359 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:54,359 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:54,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:54,359 INFO L82 PathProgramCache]: Analyzing trace with hash -916813804, now seen corresponding path program 1 times [2019-12-07 15:44:54,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:54,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812926570] [2019-12-07 15:44:54,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:54,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812926570] [2019-12-07 15:44:54,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:54,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:54,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060432364] [2019-12-07 15:44:54,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:54,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:54,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:54,399 INFO L87 Difference]: Start difference. First operand 149 states and 225 transitions. Second operand 4 states. [2019-12-07 15:44:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:54,568 INFO L93 Difference]: Finished difference Result 282 states and 431 transitions. [2019-12-07 15:44:54,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:54,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 15:44:54,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:54,569 INFO L225 Difference]: With dead ends: 282 [2019-12-07 15:44:54,570 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 15:44:54,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 15:44:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2019-12-07 15:44:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-12-07 15:44:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-12-07 15:44:54,574 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 59 [2019-12-07 15:44:54,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:54,575 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-12-07 15:44:54,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-12-07 15:44:54,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 15:44:54,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:54,576 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:54,576 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:54,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:54,576 INFO L82 PathProgramCache]: Analyzing trace with hash -243814996, now seen corresponding path program 1 times [2019-12-07 15:44:54,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:54,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316264217] [2019-12-07 15:44:54,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:54,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316264217] [2019-12-07 15:44:54,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:54,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:54,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469578027] [2019-12-07 15:44:54,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:54,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:54,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:54,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:54,620 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 4 states. [2019-12-07 15:44:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:54,837 INFO L93 Difference]: Finished difference Result 322 states and 492 transitions. [2019-12-07 15:44:54,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:54,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 15:44:54,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:54,840 INFO L225 Difference]: With dead ends: 322 [2019-12-07 15:44:54,840 INFO L226 Difference]: Without dead ends: 192 [2019-12-07 15:44:54,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:54,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-12-07 15:44:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2019-12-07 15:44:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 15:44:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 262 transitions. [2019-12-07 15:44:54,845 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 262 transitions. Word has length 59 [2019-12-07 15:44:54,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:54,845 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 262 transitions. [2019-12-07 15:44:54,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:54,845 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 262 transitions. [2019-12-07 15:44:54,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 15:44:54,846 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:54,846 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:54,846 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:54,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:54,847 INFO L82 PathProgramCache]: Analyzing trace with hash 839606678, now seen corresponding path program 1 times [2019-12-07 15:44:54,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:54,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319249129] [2019-12-07 15:44:54,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:54,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319249129] [2019-12-07 15:44:54,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:54,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:54,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706204050] [2019-12-07 15:44:54,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:54,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:54,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:54,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:54,887 INFO L87 Difference]: Start difference. First operand 171 states and 262 transitions. Second operand 4 states. [2019-12-07 15:44:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:55,118 INFO L93 Difference]: Finished difference Result 344 states and 529 transitions. [2019-12-07 15:44:55,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:55,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 15:44:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:55,119 INFO L225 Difference]: With dead ends: 344 [2019-12-07 15:44:55,119 INFO L226 Difference]: Without dead ends: 192 [2019-12-07 15:44:55,120 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-12-07 15:44:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2019-12-07 15:44:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 15:44:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2019-12-07 15:44:55,124 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 72 [2019-12-07 15:44:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:55,124 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2019-12-07 15:44:55,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:55,124 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2019-12-07 15:44:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 15:44:55,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:55,125 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:55,125 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:55,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:55,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1342889052, now seen corresponding path program 1 times [2019-12-07 15:44:55,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:55,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760661923] [2019-12-07 15:44:55,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:55,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760661923] [2019-12-07 15:44:55,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:55,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:55,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039351114] [2019-12-07 15:44:55,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:55,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:55,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:55,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:55,160 INFO L87 Difference]: Start difference. First operand 171 states and 261 transitions. Second operand 4 states. [2019-12-07 15:44:55,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:55,376 INFO L93 Difference]: Finished difference Result 343 states and 526 transitions. [2019-12-07 15:44:55,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:55,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 15:44:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:55,377 INFO L225 Difference]: With dead ends: 343 [2019-12-07 15:44:55,378 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 15:44:55,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 15:44:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 171. [2019-12-07 15:44:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 15:44:55,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 260 transitions. [2019-12-07 15:44:55,381 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 260 transitions. Word has length 73 [2019-12-07 15:44:55,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:55,382 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 260 transitions. [2019-12-07 15:44:55,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:55,382 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 260 transitions. [2019-12-07 15:44:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 15:44:55,382 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:55,382 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:55,382 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:55,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:55,383 INFO L82 PathProgramCache]: Analyzing trace with hash 480365265, now seen corresponding path program 1 times [2019-12-07 15:44:55,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:55,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838394675] [2019-12-07 15:44:55,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:55,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838394675] [2019-12-07 15:44:55,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:55,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:55,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694422972] [2019-12-07 15:44:55,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:55,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:55,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:55,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:55,413 INFO L87 Difference]: Start difference. First operand 171 states and 260 transitions. Second operand 4 states. [2019-12-07 15:44:55,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:55,644 INFO L93 Difference]: Finished difference Result 341 states and 522 transitions. [2019-12-07 15:44:55,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:55,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 15:44:55,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:55,645 INFO L225 Difference]: With dead ends: 341 [2019-12-07 15:44:55,645 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 15:44:55,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 15:44:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 171. [2019-12-07 15:44:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 15:44:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 259 transitions. [2019-12-07 15:44:55,651 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 259 transitions. Word has length 73 [2019-12-07 15:44:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:55,651 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 259 transitions. [2019-12-07 15:44:55,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 259 transitions. [2019-12-07 15:44:55,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 15:44:55,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:55,653 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:55,653 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:55,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:55,653 INFO L82 PathProgramCache]: Analyzing trace with hash -840488047, now seen corresponding path program 1 times [2019-12-07 15:44:55,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:55,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149810851] [2019-12-07 15:44:55,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:55,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149810851] [2019-12-07 15:44:55,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:55,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:55,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783522094] [2019-12-07 15:44:55,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:55,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:55,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:55,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:55,695 INFO L87 Difference]: Start difference. First operand 171 states and 259 transitions. Second operand 4 states. [2019-12-07 15:44:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:55,976 INFO L93 Difference]: Finished difference Result 340 states and 519 transitions. [2019-12-07 15:44:55,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:55,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 15:44:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:55,978 INFO L225 Difference]: With dead ends: 340 [2019-12-07 15:44:55,978 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 15:44:55,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 15:44:55,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-12-07 15:44:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 15:44:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 258 transitions. [2019-12-07 15:44:55,984 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 258 transitions. Word has length 73 [2019-12-07 15:44:55,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:55,984 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 258 transitions. [2019-12-07 15:44:55,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:55,984 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 258 transitions. [2019-12-07 15:44:55,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 15:44:55,985 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:55,985 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:55,985 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:55,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:55,985 INFO L82 PathProgramCache]: Analyzing trace with hash 295378248, now seen corresponding path program 1 times [2019-12-07 15:44:55,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:55,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385149487] [2019-12-07 15:44:55,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:56,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385149487] [2019-12-07 15:44:56,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:56,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:56,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309297050] [2019-12-07 15:44:56,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:56,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:56,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:56,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:56,021 INFO L87 Difference]: Start difference. First operand 171 states and 258 transitions. Second operand 4 states. [2019-12-07 15:44:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:56,264 INFO L93 Difference]: Finished difference Result 340 states and 517 transitions. [2019-12-07 15:44:56,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:56,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 15:44:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:56,266 INFO L225 Difference]: With dead ends: 340 [2019-12-07 15:44:56,266 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 15:44:56,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:56,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 15:44:56,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-12-07 15:44:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 15:44:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 257 transitions. [2019-12-07 15:44:56,271 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 257 transitions. Word has length 73 [2019-12-07 15:44:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:56,272 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 257 transitions. [2019-12-07 15:44:56,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2019-12-07 15:44:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 15:44:56,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:56,273 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:56,273 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:56,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:56,273 INFO L82 PathProgramCache]: Analyzing trace with hash 114216109, now seen corresponding path program 1 times [2019-12-07 15:44:56,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:56,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608961131] [2019-12-07 15:44:56,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:56,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608961131] [2019-12-07 15:44:56,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:56,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:56,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658899757] [2019-12-07 15:44:56,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:56,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:56,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:56,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:56,308 INFO L87 Difference]: Start difference. First operand 171 states and 257 transitions. Second operand 4 states. [2019-12-07 15:44:56,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:56,517 INFO L93 Difference]: Finished difference Result 340 states and 515 transitions. [2019-12-07 15:44:56,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:56,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 15:44:56,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:56,519 INFO L225 Difference]: With dead ends: 340 [2019-12-07 15:44:56,519 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 15:44:56,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 15:44:56,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-12-07 15:44:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 15:44:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 256 transitions. [2019-12-07 15:44:56,524 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 256 transitions. Word has length 74 [2019-12-07 15:44:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:56,524 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 256 transitions. [2019-12-07 15:44:56,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2019-12-07 15:44:56,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 15:44:56,525 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:56,525 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:56,525 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:56,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:56,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1466355203, now seen corresponding path program 1 times [2019-12-07 15:44:56,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:56,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729218446] [2019-12-07 15:44:56,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:56,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729218446] [2019-12-07 15:44:56,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:56,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:56,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615276934] [2019-12-07 15:44:56,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:56,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:56,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:56,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:56,561 INFO L87 Difference]: Start difference. First operand 171 states and 256 transitions. Second operand 4 states. [2019-12-07 15:44:56,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:56,807 INFO L93 Difference]: Finished difference Result 340 states and 513 transitions. [2019-12-07 15:44:56,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:56,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 15:44:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:56,808 INFO L225 Difference]: With dead ends: 340 [2019-12-07 15:44:56,808 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 15:44:56,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:56,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 15:44:56,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-12-07 15:44:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 15:44:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 255 transitions. [2019-12-07 15:44:56,813 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 255 transitions. Word has length 75 [2019-12-07 15:44:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:56,813 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 255 transitions. [2019-12-07 15:44:56,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 255 transitions. [2019-12-07 15:44:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 15:44:56,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:56,815 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:56,815 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:56,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:56,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1188775032, now seen corresponding path program 1 times [2019-12-07 15:44:56,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:56,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423232819] [2019-12-07 15:44:56,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:44:56,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423232819] [2019-12-07 15:44:56,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:56,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:56,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101701194] [2019-12-07 15:44:56,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:56,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:56,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:56,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:56,859 INFO L87 Difference]: Start difference. First operand 171 states and 255 transitions. Second operand 4 states. [2019-12-07 15:44:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:57,067 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-12-07 15:44:57,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:57,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 15:44:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:57,069 INFO L225 Difference]: With dead ends: 330 [2019-12-07 15:44:57,069 INFO L226 Difference]: Without dead ends: 178 [2019-12-07 15:44:57,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-12-07 15:44:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 171. [2019-12-07 15:44:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-12-07 15:44:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 254 transitions. [2019-12-07 15:44:57,073 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 254 transitions. Word has length 76 [2019-12-07 15:44:57,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:57,073 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 254 transitions. [2019-12-07 15:44:57,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 254 transitions. [2019-12-07 15:44:57,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 15:44:57,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:57,074 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:57,074 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash 328017922, now seen corresponding path program 1 times [2019-12-07 15:44:57,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:57,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458003914] [2019-12-07 15:44:57,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:44:57,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458003914] [2019-12-07 15:44:57,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:57,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:57,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832789248] [2019-12-07 15:44:57,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:57,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:57,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:57,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:57,128 INFO L87 Difference]: Start difference. First operand 171 states and 254 transitions. Second operand 4 states. [2019-12-07 15:44:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:57,454 INFO L93 Difference]: Finished difference Result 433 states and 657 transitions. [2019-12-07 15:44:57,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:57,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-12-07 15:44:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:57,457 INFO L225 Difference]: With dead ends: 433 [2019-12-07 15:44:57,457 INFO L226 Difference]: Without dead ends: 281 [2019-12-07 15:44:57,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-12-07 15:44:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 212. [2019-12-07 15:44:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-12-07 15:44:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 328 transitions. [2019-12-07 15:44:57,465 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 328 transitions. Word has length 81 [2019-12-07 15:44:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:57,466 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 328 transitions. [2019-12-07 15:44:57,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 328 transitions. [2019-12-07 15:44:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 15:44:57,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:57,467 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:57,467 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:57,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:57,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1043789376, now seen corresponding path program 1 times [2019-12-07 15:44:57,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:57,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784306586] [2019-12-07 15:44:57,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:44:57,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784306586] [2019-12-07 15:44:57,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:57,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:57,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598169965] [2019-12-07 15:44:57,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:57,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:57,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:57,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:57,514 INFO L87 Difference]: Start difference. First operand 212 states and 328 transitions. Second operand 4 states. [2019-12-07 15:44:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:57,748 INFO L93 Difference]: Finished difference Result 455 states and 711 transitions. [2019-12-07 15:44:57,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:57,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-12-07 15:44:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:57,749 INFO L225 Difference]: With dead ends: 455 [2019-12-07 15:44:57,749 INFO L226 Difference]: Without dead ends: 262 [2019-12-07 15:44:57,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-07 15:44:57,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 236. [2019-12-07 15:44:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-07 15:44:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 370 transitions. [2019-12-07 15:44:57,754 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 370 transitions. Word has length 81 [2019-12-07 15:44:57,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:57,755 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 370 transitions. [2019-12-07 15:44:57,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:57,755 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 370 transitions. [2019-12-07 15:44:57,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 15:44:57,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:57,756 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:57,756 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:57,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:57,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1337426848, now seen corresponding path program 1 times [2019-12-07 15:44:57,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:57,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932986054] [2019-12-07 15:44:57,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:44:57,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932986054] [2019-12-07 15:44:57,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:57,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:57,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716261603] [2019-12-07 15:44:57,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:57,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:57,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:57,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:57,806 INFO L87 Difference]: Start difference. First operand 236 states and 370 transitions. Second operand 4 states. [2019-12-07 15:44:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:58,073 INFO L93 Difference]: Finished difference Result 515 states and 805 transitions. [2019-12-07 15:44:58,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:58,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-07 15:44:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:58,075 INFO L225 Difference]: With dead ends: 515 [2019-12-07 15:44:58,075 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 15:44:58,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:58,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 15:44:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 237. [2019-12-07 15:44:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 15:44:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 371 transitions. [2019-12-07 15:44:58,079 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 371 transitions. Word has length 82 [2019-12-07 15:44:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:58,079 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 371 transitions. [2019-12-07 15:44:58,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 371 transitions. [2019-12-07 15:44:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 15:44:58,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:58,080 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:58,080 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:58,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1823335168, now seen corresponding path program 1 times [2019-12-07 15:44:58,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:58,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017144148] [2019-12-07 15:44:58,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:58,113 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:44:58,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017144148] [2019-12-07 15:44:58,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:58,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:58,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202975806] [2019-12-07 15:44:58,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:58,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:58,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:58,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:58,114 INFO L87 Difference]: Start difference. First operand 237 states and 371 transitions. Second operand 4 states. [2019-12-07 15:44:58,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:58,408 INFO L93 Difference]: Finished difference Result 516 states and 805 transitions. [2019-12-07 15:44:58,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:58,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 15:44:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:58,410 INFO L225 Difference]: With dead ends: 516 [2019-12-07 15:44:58,410 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 15:44:58,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 15:44:58,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 237. [2019-12-07 15:44:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 15:44:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 370 transitions. [2019-12-07 15:44:58,414 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 370 transitions. Word has length 94 [2019-12-07 15:44:58,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:58,414 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 370 transitions. [2019-12-07 15:44:58,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:58,414 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 370 transitions. [2019-12-07 15:44:58,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 15:44:58,415 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:58,415 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:58,415 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2027731454, now seen corresponding path program 1 times [2019-12-07 15:44:58,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:58,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592662593] [2019-12-07 15:44:58,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:58,456 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:44:58,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592662593] [2019-12-07 15:44:58,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:58,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:58,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106357238] [2019-12-07 15:44:58,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:58,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:58,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:58,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:58,457 INFO L87 Difference]: Start difference. First operand 237 states and 370 transitions. Second operand 4 states. [2019-12-07 15:44:58,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:58,711 INFO L93 Difference]: Finished difference Result 481 states and 752 transitions. [2019-12-07 15:44:58,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:58,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 15:44:58,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:58,713 INFO L225 Difference]: With dead ends: 481 [2019-12-07 15:44:58,713 INFO L226 Difference]: Without dead ends: 263 [2019-12-07 15:44:58,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-12-07 15:44:58,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 237. [2019-12-07 15:44:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 15:44:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 369 transitions. [2019-12-07 15:44:58,717 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 369 transitions. Word has length 94 [2019-12-07 15:44:58,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:58,718 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 369 transitions. [2019-12-07 15:44:58,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 369 transitions. [2019-12-07 15:44:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 15:44:58,718 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:58,718 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:58,719 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:58,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:58,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1773701170, now seen corresponding path program 1 times [2019-12-07 15:44:58,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:58,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383645066] [2019-12-07 15:44:58,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:44:58,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383645066] [2019-12-07 15:44:58,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:58,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:58,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882042396] [2019-12-07 15:44:58,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:58,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:58,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:58,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:58,761 INFO L87 Difference]: Start difference. First operand 237 states and 369 transitions. Second operand 4 states. [2019-12-07 15:44:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:59,047 INFO L93 Difference]: Finished difference Result 515 states and 800 transitions. [2019-12-07 15:44:59,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:59,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 15:44:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:59,048 INFO L225 Difference]: With dead ends: 515 [2019-12-07 15:44:59,048 INFO L226 Difference]: Without dead ends: 297 [2019-12-07 15:44:59,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:59,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-12-07 15:44:59,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 237. [2019-12-07 15:44:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 15:44:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 368 transitions. [2019-12-07 15:44:59,053 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 368 transitions. Word has length 95 [2019-12-07 15:44:59,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:59,053 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 368 transitions. [2019-12-07 15:44:59,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 368 transitions. [2019-12-07 15:44:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 15:44:59,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:59,054 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:59,054 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:59,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:59,054 INFO L82 PathProgramCache]: Analyzing trace with hash 911177383, now seen corresponding path program 1 times [2019-12-07 15:44:59,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:59,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052710615] [2019-12-07 15:44:59,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:44:59,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052710615] [2019-12-07 15:44:59,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:59,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:59,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587419685] [2019-12-07 15:44:59,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:59,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:59,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:59,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:59,087 INFO L87 Difference]: Start difference. First operand 237 states and 368 transitions. Second operand 4 states. [2019-12-07 15:44:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:59,360 INFO L93 Difference]: Finished difference Result 513 states and 796 transitions. [2019-12-07 15:44:59,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:59,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 15:44:59,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:59,362 INFO L225 Difference]: With dead ends: 513 [2019-12-07 15:44:59,362 INFO L226 Difference]: Without dead ends: 295 [2019-12-07 15:44:59,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-12-07 15:44:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 237. [2019-12-07 15:44:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 15:44:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 367 transitions. [2019-12-07 15:44:59,369 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 367 transitions. Word has length 95 [2019-12-07 15:44:59,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:59,369 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 367 transitions. [2019-12-07 15:44:59,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:59,369 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 367 transitions. [2019-12-07 15:44:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 15:44:59,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:59,370 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:59,371 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:59,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash -409675929, now seen corresponding path program 1 times [2019-12-07 15:44:59,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:59,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926317510] [2019-12-07 15:44:59,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:44:59,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926317510] [2019-12-07 15:44:59,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:59,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:44:59,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277647260] [2019-12-07 15:44:59,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:44:59,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:59,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:44:59,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:44:59,429 INFO L87 Difference]: Start difference. First operand 237 states and 367 transitions. Second operand 4 states. [2019-12-07 15:44:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:44:59,712 INFO L93 Difference]: Finished difference Result 512 states and 793 transitions. [2019-12-07 15:44:59,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:44:59,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 15:44:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:44:59,714 INFO L225 Difference]: With dead ends: 512 [2019-12-07 15:44:59,714 INFO L226 Difference]: Without dead ends: 294 [2019-12-07 15:44:59,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:59,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-07 15:44:59,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 237. [2019-12-07 15:44:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-07 15:44:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 366 transitions. [2019-12-07 15:44:59,718 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 366 transitions. Word has length 95 [2019-12-07 15:44:59,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:44:59,718 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 366 transitions. [2019-12-07 15:44:59,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:44:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 366 transitions. [2019-12-07 15:44:59,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 15:44:59,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:44:59,719 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:44:59,719 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:44:59,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:44:59,720 INFO L82 PathProgramCache]: Analyzing trace with hash 726190366, now seen corresponding path program 1 times [2019-12-07 15:44:59,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:44:59,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079564116] [2019-12-07 15:44:59,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:44:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:44:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 15:44:59,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079564116] [2019-12-07 15:44:59,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:44:59,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:44:59,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080821524] [2019-12-07 15:44:59,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:44:59,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:44:59,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:44:59,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:44:59,762 INFO L87 Difference]: Start difference. First operand 237 states and 366 transitions. Second operand 5 states. [2019-12-07 15:45:00,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:00,050 INFO L93 Difference]: Finished difference Result 476 states and 740 transitions. [2019-12-07 15:45:00,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:45:00,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-07 15:45:00,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:00,051 INFO L225 Difference]: With dead ends: 476 [2019-12-07 15:45:00,051 INFO L226 Difference]: Without dead ends: 258 [2019-12-07 15:45:00,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:45:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-12-07 15:45:00,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-12-07 15:45:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 15:45:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 392 transitions. [2019-12-07 15:45:00,056 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 392 transitions. Word has length 95 [2019-12-07 15:45:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:00,057 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 392 transitions. [2019-12-07 15:45:00,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:45:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 392 transitions. [2019-12-07 15:45:00,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 15:45:00,058 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:00,058 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:00,058 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:00,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:00,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1787196389, now seen corresponding path program 1 times [2019-12-07 15:45:00,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:00,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696248627] [2019-12-07 15:45:00,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:45:00,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696248627] [2019-12-07 15:45:00,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:00,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:00,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421697331] [2019-12-07 15:45:00,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:00,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:00,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:00,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:00,096 INFO L87 Difference]: Start difference. First operand 257 states and 392 transitions. Second operand 4 states. [2019-12-07 15:45:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:00,311 INFO L93 Difference]: Finished difference Result 518 states and 792 transitions. [2019-12-07 15:45:00,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:00,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 15:45:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:00,312 INFO L225 Difference]: With dead ends: 518 [2019-12-07 15:45:00,312 INFO L226 Difference]: Without dead ends: 280 [2019-12-07 15:45:00,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:00,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-07 15:45:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 257. [2019-12-07 15:45:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 15:45:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 391 transitions. [2019-12-07 15:45:00,318 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 391 transitions. Word has length 95 [2019-12-07 15:45:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:00,318 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 391 transitions. [2019-12-07 15:45:00,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 391 transitions. [2019-12-07 15:45:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 15:45:00,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:00,319 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:00,319 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:00,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:00,320 INFO L82 PathProgramCache]: Analyzing trace with hash 466343077, now seen corresponding path program 1 times [2019-12-07 15:45:00,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:00,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850857425] [2019-12-07 15:45:00,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:45:00,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850857425] [2019-12-07 15:45:00,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:00,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:00,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999196078] [2019-12-07 15:45:00,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:00,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:00,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:00,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:00,364 INFO L87 Difference]: Start difference. First operand 257 states and 391 transitions. Second operand 4 states. [2019-12-07 15:45:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:00,592 INFO L93 Difference]: Finished difference Result 517 states and 789 transitions. [2019-12-07 15:45:00,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:00,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 15:45:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:00,593 INFO L225 Difference]: With dead ends: 517 [2019-12-07 15:45:00,593 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 15:45:00,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 15:45:00,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2019-12-07 15:45:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 15:45:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 390 transitions. [2019-12-07 15:45:00,599 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 390 transitions. Word has length 95 [2019-12-07 15:45:00,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:00,600 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 390 transitions. [2019-12-07 15:45:00,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 390 transitions. [2019-12-07 15:45:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 15:45:00,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:00,601 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:00,601 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:00,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:00,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1195259004, now seen corresponding path program 1 times [2019-12-07 15:45:00,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:00,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247138278] [2019-12-07 15:45:00,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:45:00,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247138278] [2019-12-07 15:45:00,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:00,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:00,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908849768] [2019-12-07 15:45:00,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:00,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:00,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:00,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:00,640 INFO L87 Difference]: Start difference. First operand 257 states and 390 transitions. Second operand 4 states. [2019-12-07 15:45:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:00,913 INFO L93 Difference]: Finished difference Result 552 states and 838 transitions. [2019-12-07 15:45:00,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:00,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 15:45:00,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:00,914 INFO L225 Difference]: With dead ends: 552 [2019-12-07 15:45:00,915 INFO L226 Difference]: Without dead ends: 314 [2019-12-07 15:45:00,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:00,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-12-07 15:45:00,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 257. [2019-12-07 15:45:00,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 15:45:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 389 transitions. [2019-12-07 15:45:00,920 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 389 transitions. Word has length 96 [2019-12-07 15:45:00,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:00,920 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 389 transitions. [2019-12-07 15:45:00,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 389 transitions. [2019-12-07 15:45:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 15:45:00,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:00,921 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:00,921 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:00,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:00,921 INFO L82 PathProgramCache]: Analyzing trace with hash 191526406, now seen corresponding path program 1 times [2019-12-07 15:45:00,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:00,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648664989] [2019-12-07 15:45:00,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:45:00,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648664989] [2019-12-07 15:45:00,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:00,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:00,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481627687] [2019-12-07 15:45:00,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:00,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:00,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:00,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:00,957 INFO L87 Difference]: Start difference. First operand 257 states and 389 transitions. Second operand 4 states. [2019-12-07 15:45:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:01,175 INFO L93 Difference]: Finished difference Result 517 states and 785 transitions. [2019-12-07 15:45:01,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:01,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 15:45:01,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:01,177 INFO L225 Difference]: With dead ends: 517 [2019-12-07 15:45:01,177 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 15:45:01,177 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:01,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 15:45:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2019-12-07 15:45:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 15:45:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 388 transitions. [2019-12-07 15:45:01,181 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 388 transitions. Word has length 96 [2019-12-07 15:45:01,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:01,181 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 388 transitions. [2019-12-07 15:45:01,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 388 transitions. [2019-12-07 15:45:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 15:45:01,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:01,182 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:01,182 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:01,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:01,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1293006805, now seen corresponding path program 1 times [2019-12-07 15:45:01,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:01,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233082922] [2019-12-07 15:45:01,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:45:01,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233082922] [2019-12-07 15:45:01,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:01,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:01,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344035896] [2019-12-07 15:45:01,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:01,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:01,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:01,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:01,225 INFO L87 Difference]: Start difference. First operand 257 states and 388 transitions. Second operand 4 states. [2019-12-07 15:45:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:01,513 INFO L93 Difference]: Finished difference Result 552 states and 834 transitions. [2019-12-07 15:45:01,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:01,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 15:45:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:01,514 INFO L225 Difference]: With dead ends: 552 [2019-12-07 15:45:01,514 INFO L226 Difference]: Without dead ends: 314 [2019-12-07 15:45:01,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-12-07 15:45:01,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 257. [2019-12-07 15:45:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 15:45:01,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 387 transitions. [2019-12-07 15:45:01,519 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 387 transitions. Word has length 97 [2019-12-07 15:45:01,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:01,519 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 387 transitions. [2019-12-07 15:45:01,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:01,519 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 387 transitions. [2019-12-07 15:45:01,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 15:45:01,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:01,520 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:01,520 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:01,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:01,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1252332055, now seen corresponding path program 1 times [2019-12-07 15:45:01,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:01,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875455512] [2019-12-07 15:45:01,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:45:01,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875455512] [2019-12-07 15:45:01,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:01,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:01,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968489162] [2019-12-07 15:45:01,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:01,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:01,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:01,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:01,552 INFO L87 Difference]: Start difference. First operand 257 states and 387 transitions. Second operand 4 states. [2019-12-07 15:45:01,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:01,757 INFO L93 Difference]: Finished difference Result 517 states and 781 transitions. [2019-12-07 15:45:01,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:01,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 15:45:01,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:01,759 INFO L225 Difference]: With dead ends: 517 [2019-12-07 15:45:01,759 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 15:45:01,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:01,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 15:45:01,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2019-12-07 15:45:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 15:45:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 386 transitions. [2019-12-07 15:45:01,764 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 386 transitions. Word has length 97 [2019-12-07 15:45:01,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:01,764 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 386 transitions. [2019-12-07 15:45:01,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 386 transitions. [2019-12-07 15:45:01,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 15:45:01,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:01,765 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:01,765 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:01,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:01,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1236541353, now seen corresponding path program 1 times [2019-12-07 15:45:01,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:01,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133949687] [2019-12-07 15:45:01,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:45:01,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133949687] [2019-12-07 15:45:01,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:01,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:01,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343797113] [2019-12-07 15:45:01,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:01,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:01,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:01,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:01,798 INFO L87 Difference]: Start difference. First operand 257 states and 386 transitions. Second operand 4 states. [2019-12-07 15:45:02,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:02,067 INFO L93 Difference]: Finished difference Result 552 states and 830 transitions. [2019-12-07 15:45:02,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:02,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 15:45:02,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:02,069 INFO L225 Difference]: With dead ends: 552 [2019-12-07 15:45:02,069 INFO L226 Difference]: Without dead ends: 314 [2019-12-07 15:45:02,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:02,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-12-07 15:45:02,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 257. [2019-12-07 15:45:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 15:45:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 385 transitions. [2019-12-07 15:45:02,073 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 385 transitions. Word has length 98 [2019-12-07 15:45:02,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:02,074 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 385 transitions. [2019-12-07 15:45:02,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 385 transitions. [2019-12-07 15:45:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 15:45:02,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:02,074 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:02,074 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:02,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:02,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1797508693, now seen corresponding path program 1 times [2019-12-07 15:45:02,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:02,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116929687] [2019-12-07 15:45:02,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:45:02,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116929687] [2019-12-07 15:45:02,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:02,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:02,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63941753] [2019-12-07 15:45:02,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:02,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:02,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:02,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:02,108 INFO L87 Difference]: Start difference. First operand 257 states and 385 transitions. Second operand 4 states. [2019-12-07 15:45:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:02,317 INFO L93 Difference]: Finished difference Result 517 states and 777 transitions. [2019-12-07 15:45:02,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:02,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 15:45:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:02,319 INFO L225 Difference]: With dead ends: 517 [2019-12-07 15:45:02,319 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 15:45:02,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:02,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 15:45:02,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2019-12-07 15:45:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 15:45:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 384 transitions. [2019-12-07 15:45:02,323 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 384 transitions. Word has length 98 [2019-12-07 15:45:02,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:02,323 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 384 transitions. [2019-12-07 15:45:02,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:02,323 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 384 transitions. [2019-12-07 15:45:02,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 15:45:02,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:02,324 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:02,324 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:02,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:02,325 INFO L82 PathProgramCache]: Analyzing trace with hash -687081680, now seen corresponding path program 1 times [2019-12-07 15:45:02,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:02,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935473755] [2019-12-07 15:45:02,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:45:02,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935473755] [2019-12-07 15:45:02,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:02,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:02,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766812824] [2019-12-07 15:45:02,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:02,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:02,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:02,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:02,366 INFO L87 Difference]: Start difference. First operand 257 states and 384 transitions. Second operand 4 states. [2019-12-07 15:45:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:02,618 INFO L93 Difference]: Finished difference Result 542 states and 814 transitions. [2019-12-07 15:45:02,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:02,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 15:45:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:02,619 INFO L225 Difference]: With dead ends: 542 [2019-12-07 15:45:02,619 INFO L226 Difference]: Without dead ends: 304 [2019-12-07 15:45:02,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-12-07 15:45:02,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 257. [2019-12-07 15:45:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 15:45:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 383 transitions. [2019-12-07 15:45:02,623 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 383 transitions. Word has length 99 [2019-12-07 15:45:02,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:02,624 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 383 transitions. [2019-12-07 15:45:02,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:02,624 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 383 transitions. [2019-12-07 15:45:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 15:45:02,624 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:02,624 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:02,624 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:02,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:02,625 INFO L82 PathProgramCache]: Analyzing trace with hash -253352594, now seen corresponding path program 1 times [2019-12-07 15:45:02,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:02,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440112601] [2019-12-07 15:45:02,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:45:02,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440112601] [2019-12-07 15:45:02,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:02,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:02,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003502002] [2019-12-07 15:45:02,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:02,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:02,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:02,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:02,656 INFO L87 Difference]: Start difference. First operand 257 states and 383 transitions. Second operand 4 states. [2019-12-07 15:45:02,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:02,838 INFO L93 Difference]: Finished difference Result 507 states and 761 transitions. [2019-12-07 15:45:02,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:02,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 15:45:02,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:02,840 INFO L225 Difference]: With dead ends: 507 [2019-12-07 15:45:02,840 INFO L226 Difference]: Without dead ends: 269 [2019-12-07 15:45:02,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:02,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-12-07 15:45:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 257. [2019-12-07 15:45:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 15:45:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 382 transitions. [2019-12-07 15:45:02,846 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 382 transitions. Word has length 99 [2019-12-07 15:45:02,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:02,846 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 382 transitions. [2019-12-07 15:45:02,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 382 transitions. [2019-12-07 15:45:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 15:45:02,847 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:02,847 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:02,847 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:02,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:02,848 INFO L82 PathProgramCache]: Analyzing trace with hash -401565846, now seen corresponding path program 1 times [2019-12-07 15:45:02,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:02,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457283575] [2019-12-07 15:45:02,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 15:45:02,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457283575] [2019-12-07 15:45:02,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:02,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:02,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147019178] [2019-12-07 15:45:02,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:02,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:02,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:02,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:02,885 INFO L87 Difference]: Start difference. First operand 257 states and 382 transitions. Second operand 4 states. [2019-12-07 15:45:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:03,351 INFO L93 Difference]: Finished difference Result 542 states and 810 transitions. [2019-12-07 15:45:03,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:03,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-07 15:45:03,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:03,355 INFO L225 Difference]: With dead ends: 542 [2019-12-07 15:45:03,355 INFO L226 Difference]: Without dead ends: 304 [2019-12-07 15:45:03,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-12-07 15:45:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 257. [2019-12-07 15:45:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 15:45:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 381 transitions. [2019-12-07 15:45:03,367 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 381 transitions. Word has length 103 [2019-12-07 15:45:03,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:03,367 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 381 transitions. [2019-12-07 15:45:03,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:03,368 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 381 transitions. [2019-12-07 15:45:03,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 15:45:03,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:03,370 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:03,370 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:03,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:03,371 INFO L82 PathProgramCache]: Analyzing trace with hash 277706408, now seen corresponding path program 1 times [2019-12-07 15:45:03,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:03,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699683145] [2019-12-07 15:45:03,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 15:45:03,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699683145] [2019-12-07 15:45:03,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:03,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:45:03,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960188671] [2019-12-07 15:45:03,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:45:03,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:03,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:45:03,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:03,433 INFO L87 Difference]: Start difference. First operand 257 states and 381 transitions. Second operand 3 states. [2019-12-07 15:45:03,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:03,478 INFO L93 Difference]: Finished difference Result 731 states and 1098 transitions. [2019-12-07 15:45:03,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:45:03,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-12-07 15:45:03,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:03,480 INFO L225 Difference]: With dead ends: 731 [2019-12-07 15:45:03,481 INFO L226 Difference]: Without dead ends: 493 [2019-12-07 15:45:03,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-12-07 15:45:03,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-12-07 15:45:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-12-07 15:45:03,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 729 transitions. [2019-12-07 15:45:03,488 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 729 transitions. Word has length 103 [2019-12-07 15:45:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:03,489 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 729 transitions. [2019-12-07 15:45:03,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:45:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 729 transitions. [2019-12-07 15:45:03,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 15:45:03,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:03,489 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:03,490 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:03,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:03,490 INFO L82 PathProgramCache]: Analyzing trace with hash -980347234, now seen corresponding path program 1 times [2019-12-07 15:45:03,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:03,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81292902] [2019-12-07 15:45:03,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 15:45:03,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81292902] [2019-12-07 15:45:03,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:03,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:45:03,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133775295] [2019-12-07 15:45:03,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:45:03,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:03,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:45:03,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:03,523 INFO L87 Difference]: Start difference. First operand 493 states and 729 transitions. Second operand 3 states. [2019-12-07 15:45:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:03,571 INFO L93 Difference]: Finished difference Result 1203 states and 1794 transitions. [2019-12-07 15:45:03,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:45:03,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 15:45:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:03,574 INFO L225 Difference]: With dead ends: 1203 [2019-12-07 15:45:03,574 INFO L226 Difference]: Without dead ends: 729 [2019-12-07 15:45:03,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:03,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-12-07 15:45:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2019-12-07 15:45:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-12-07 15:45:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1078 transitions. [2019-12-07 15:45:03,590 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1078 transitions. Word has length 105 [2019-12-07 15:45:03,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:03,590 INFO L462 AbstractCegarLoop]: Abstraction has 729 states and 1078 transitions. [2019-12-07 15:45:03,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:45:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1078 transitions. [2019-12-07 15:45:03,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 15:45:03,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:03,591 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:03,592 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:03,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:03,592 INFO L82 PathProgramCache]: Analyzing trace with hash 712583787, now seen corresponding path program 1 times [2019-12-07 15:45:03,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:03,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394780831] [2019-12-07 15:45:03,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 15:45:03,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394780831] [2019-12-07 15:45:03,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:03,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:03,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703532794] [2019-12-07 15:45:03,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:03,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:03,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:03,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:03,651 INFO L87 Difference]: Start difference. First operand 729 states and 1078 transitions. Second operand 4 states. [2019-12-07 15:45:03,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:03,934 INFO L93 Difference]: Finished difference Result 1628 states and 2428 transitions. [2019-12-07 15:45:03,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:03,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-12-07 15:45:03,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:03,937 INFO L225 Difference]: With dead ends: 1628 [2019-12-07 15:45:03,937 INFO L226 Difference]: Without dead ends: 918 [2019-12-07 15:45:03,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:03,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-12-07 15:45:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 813. [2019-12-07 15:45:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-07 15:45:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1225 transitions. [2019-12-07 15:45:03,950 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1225 transitions. Word has length 134 [2019-12-07 15:45:03,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:03,950 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1225 transitions. [2019-12-07 15:45:03,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1225 transitions. [2019-12-07 15:45:03,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 15:45:03,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:03,952 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:03,952 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:03,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:03,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1422709559, now seen corresponding path program 1 times [2019-12-07 15:45:03,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:03,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244947798] [2019-12-07 15:45:03,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 15:45:03,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244947798] [2019-12-07 15:45:03,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:03,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:03,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457486866] [2019-12-07 15:45:03,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:03,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:03,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:03,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:03,994 INFO L87 Difference]: Start difference. First operand 813 states and 1225 transitions. Second operand 4 states. [2019-12-07 15:45:04,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:04,286 INFO L93 Difference]: Finished difference Result 1712 states and 2572 transitions. [2019-12-07 15:45:04,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:04,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 15:45:04,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:04,290 INFO L225 Difference]: With dead ends: 1712 [2019-12-07 15:45:04,290 INFO L226 Difference]: Without dead ends: 918 [2019-12-07 15:45:04,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-12-07 15:45:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 813. [2019-12-07 15:45:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-07 15:45:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1222 transitions. [2019-12-07 15:45:04,303 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1222 transitions. Word has length 147 [2019-12-07 15:45:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:04,304 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1222 transitions. [2019-12-07 15:45:04,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1222 transitions. [2019-12-07 15:45:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 15:45:04,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:04,305 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:04,305 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:04,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1376685392, now seen corresponding path program 1 times [2019-12-07 15:45:04,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:04,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842277627] [2019-12-07 15:45:04,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:04,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 15:45:04,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842277627] [2019-12-07 15:45:04,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:04,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:04,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145466034] [2019-12-07 15:45:04,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:04,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:04,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:04,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:04,349 INFO L87 Difference]: Start difference. First operand 813 states and 1222 transitions. Second operand 4 states. [2019-12-07 15:45:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:04,597 INFO L93 Difference]: Finished difference Result 1706 states and 2560 transitions. [2019-12-07 15:45:04,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:04,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 15:45:04,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:04,601 INFO L225 Difference]: With dead ends: 1706 [2019-12-07 15:45:04,601 INFO L226 Difference]: Without dead ends: 912 [2019-12-07 15:45:04,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-12-07 15:45:04,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 813. [2019-12-07 15:45:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-07 15:45:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1219 transitions. [2019-12-07 15:45:04,614 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1219 transitions. Word has length 148 [2019-12-07 15:45:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:04,615 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1219 transitions. [2019-12-07 15:45:04,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1219 transitions. [2019-12-07 15:45:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 15:45:04,616 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:04,616 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:04,616 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:04,616 INFO L82 PathProgramCache]: Analyzing trace with hash 55832080, now seen corresponding path program 1 times [2019-12-07 15:45:04,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:04,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089464826] [2019-12-07 15:45:04,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 15:45:04,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089464826] [2019-12-07 15:45:04,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:04,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:04,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62682492] [2019-12-07 15:45:04,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:04,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:04,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:04,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:04,658 INFO L87 Difference]: Start difference. First operand 813 states and 1219 transitions. Second operand 4 states. [2019-12-07 15:45:04,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:04,891 INFO L93 Difference]: Finished difference Result 1703 states and 2551 transitions. [2019-12-07 15:45:04,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:04,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 15:45:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:04,895 INFO L225 Difference]: With dead ends: 1703 [2019-12-07 15:45:04,895 INFO L226 Difference]: Without dead ends: 909 [2019-12-07 15:45:04,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-12-07 15:45:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 813. [2019-12-07 15:45:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-07 15:45:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1216 transitions. [2019-12-07 15:45:04,907 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1216 transitions. Word has length 148 [2019-12-07 15:45:04,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:04,907 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1216 transitions. [2019-12-07 15:45:04,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1216 transitions. [2019-12-07 15:45:04,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 15:45:04,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:04,908 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:04,909 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:04,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:04,909 INFO L82 PathProgramCache]: Analyzing trace with hash 350587387, now seen corresponding path program 1 times [2019-12-07 15:45:04,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:04,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607783874] [2019-12-07 15:45:04,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 15:45:04,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607783874] [2019-12-07 15:45:04,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:04,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:04,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954559976] [2019-12-07 15:45:04,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:04,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:04,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:04,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:04,963 INFO L87 Difference]: Start difference. First operand 813 states and 1216 transitions. Second operand 4 states. [2019-12-07 15:45:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:05,206 INFO L93 Difference]: Finished difference Result 1703 states and 2545 transitions. [2019-12-07 15:45:05,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:05,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 15:45:05,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:05,210 INFO L225 Difference]: With dead ends: 1703 [2019-12-07 15:45:05,210 INFO L226 Difference]: Without dead ends: 909 [2019-12-07 15:45:05,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-12-07 15:45:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 813. [2019-12-07 15:45:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-07 15:45:05,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1213 transitions. [2019-12-07 15:45:05,223 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1213 transitions. Word has length 149 [2019-12-07 15:45:05,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:05,224 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1213 transitions. [2019-12-07 15:45:05,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:05,224 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1213 transitions. [2019-12-07 15:45:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 15:45:05,225 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:05,225 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:05,225 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:05,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:05,225 INFO L82 PathProgramCache]: Analyzing trace with hash -616408940, now seen corresponding path program 1 times [2019-12-07 15:45:05,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:05,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925111292] [2019-12-07 15:45:05,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 15:45:05,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925111292] [2019-12-07 15:45:05,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:05,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:05,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622471949] [2019-12-07 15:45:05,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:05,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:05,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:05,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:05,268 INFO L87 Difference]: Start difference. First operand 813 states and 1213 transitions. Second operand 4 states. [2019-12-07 15:45:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:05,522 INFO L93 Difference]: Finished difference Result 1703 states and 2539 transitions. [2019-12-07 15:45:05,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:05,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 15:45:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:05,525 INFO L225 Difference]: With dead ends: 1703 [2019-12-07 15:45:05,525 INFO L226 Difference]: Without dead ends: 909 [2019-12-07 15:45:05,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-12-07 15:45:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 813. [2019-12-07 15:45:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-07 15:45:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1210 transitions. [2019-12-07 15:45:05,537 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1210 transitions. Word has length 150 [2019-12-07 15:45:05,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:05,537 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1210 transitions. [2019-12-07 15:45:05,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1210 transitions. [2019-12-07 15:45:05,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 15:45:05,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:05,539 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:05,539 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:05,539 INFO L82 PathProgramCache]: Analyzing trace with hash 736238688, now seen corresponding path program 1 times [2019-12-07 15:45:05,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:05,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881222238] [2019-12-07 15:45:05,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 15:45:05,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881222238] [2019-12-07 15:45:05,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:05,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:05,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678785627] [2019-12-07 15:45:05,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:05,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:05,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:05,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:05,579 INFO L87 Difference]: Start difference. First operand 813 states and 1210 transitions. Second operand 4 states. [2019-12-07 15:45:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:05,825 INFO L93 Difference]: Finished difference Result 1703 states and 2533 transitions. [2019-12-07 15:45:05,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:05,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 15:45:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:05,830 INFO L225 Difference]: With dead ends: 1703 [2019-12-07 15:45:05,830 INFO L226 Difference]: Without dead ends: 909 [2019-12-07 15:45:05,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:05,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-12-07 15:45:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 813. [2019-12-07 15:45:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-07 15:45:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1207 transitions. [2019-12-07 15:45:05,846 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1207 transitions. Word has length 151 [2019-12-07 15:45:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:05,847 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1207 transitions. [2019-12-07 15:45:05,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1207 transitions. [2019-12-07 15:45:05,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 15:45:05,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:05,848 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:05,848 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:05,848 INFO L82 PathProgramCache]: Analyzing trace with hash 983404889, now seen corresponding path program 1 times [2019-12-07 15:45:05,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:05,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568758105] [2019-12-07 15:45:05,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 15:45:05,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568758105] [2019-12-07 15:45:05,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:05,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:05,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610901232] [2019-12-07 15:45:05,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:05,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:05,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:05,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:05,889 INFO L87 Difference]: Start difference. First operand 813 states and 1207 transitions. Second operand 4 states. [2019-12-07 15:45:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:06,156 INFO L93 Difference]: Finished difference Result 1673 states and 2491 transitions. [2019-12-07 15:45:06,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:06,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 15:45:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:06,160 INFO L225 Difference]: With dead ends: 1673 [2019-12-07 15:45:06,160 INFO L226 Difference]: Without dead ends: 879 [2019-12-07 15:45:06,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-12-07 15:45:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 813. [2019-12-07 15:45:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-07 15:45:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1204 transitions. [2019-12-07 15:45:06,176 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1204 transitions. Word has length 152 [2019-12-07 15:45:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:06,177 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1204 transitions. [2019-12-07 15:45:06,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1204 transitions. [2019-12-07 15:45:06,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 15:45:06,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:06,178 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:06,178 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:06,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:06,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1752763117, now seen corresponding path program 1 times [2019-12-07 15:45:06,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:06,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285749625] [2019-12-07 15:45:06,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:06,224 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 15:45:06,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285749625] [2019-12-07 15:45:06,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:06,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:06,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100636678] [2019-12-07 15:45:06,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:06,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:06,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:06,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:06,225 INFO L87 Difference]: Start difference. First operand 813 states and 1204 transitions. Second operand 4 states. [2019-12-07 15:45:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:06,633 INFO L93 Difference]: Finished difference Result 1673 states and 2485 transitions. [2019-12-07 15:45:06,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:06,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 15:45:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:06,644 INFO L225 Difference]: With dead ends: 1673 [2019-12-07 15:45:06,644 INFO L226 Difference]: Without dead ends: 879 [2019-12-07 15:45:06,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:06,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-12-07 15:45:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 813. [2019-12-07 15:45:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-07 15:45:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1201 transitions. [2019-12-07 15:45:06,663 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1201 transitions. Word has length 156 [2019-12-07 15:45:06,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:06,663 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1201 transitions. [2019-12-07 15:45:06,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:06,663 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1201 transitions. [2019-12-07 15:45:06,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 15:45:06,664 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:06,665 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:06,665 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:06,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:06,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1490860902, now seen corresponding path program 1 times [2019-12-07 15:45:06,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:06,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759199882] [2019-12-07 15:45:06,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 15:45:06,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759199882] [2019-12-07 15:45:06,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:06,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:06,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541559379] [2019-12-07 15:45:06,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:06,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:06,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:06,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:06,715 INFO L87 Difference]: Start difference. First operand 813 states and 1201 transitions. Second operand 4 states. [2019-12-07 15:45:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:06,962 INFO L93 Difference]: Finished difference Result 1658 states and 2458 transitions. [2019-12-07 15:45:06,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:06,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-12-07 15:45:06,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:06,966 INFO L225 Difference]: With dead ends: 1658 [2019-12-07 15:45:06,966 INFO L226 Difference]: Without dead ends: 864 [2019-12-07 15:45:06,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:06,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-12-07 15:45:06,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 813. [2019-12-07 15:45:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-07 15:45:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1198 transitions. [2019-12-07 15:45:06,980 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1198 transitions. Word has length 157 [2019-12-07 15:45:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:06,980 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1198 transitions. [2019-12-07 15:45:06,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1198 transitions. [2019-12-07 15:45:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 15:45:06,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:06,981 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:06,981 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:06,981 INFO L82 PathProgramCache]: Analyzing trace with hash 870486010, now seen corresponding path program 1 times [2019-12-07 15:45:06,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:06,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496946488] [2019-12-07 15:45:06,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 15:45:07,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496946488] [2019-12-07 15:45:07,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:07,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:07,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012124177] [2019-12-07 15:45:07,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:07,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:07,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:07,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:07,034 INFO L87 Difference]: Start difference. First operand 813 states and 1198 transitions. Second operand 4 states. [2019-12-07 15:45:07,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:07,322 INFO L93 Difference]: Finished difference Result 1808 states and 2686 transitions. [2019-12-07 15:45:07,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:07,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 15:45:07,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:07,326 INFO L225 Difference]: With dead ends: 1808 [2019-12-07 15:45:07,326 INFO L226 Difference]: Without dead ends: 1014 [2019-12-07 15:45:07,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:07,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-12-07 15:45:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 903. [2019-12-07 15:45:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-12-07 15:45:07,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1357 transitions. [2019-12-07 15:45:07,341 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1357 transitions. Word has length 159 [2019-12-07 15:45:07,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:07,341 INFO L462 AbstractCegarLoop]: Abstraction has 903 states and 1357 transitions. [2019-12-07 15:45:07,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:07,342 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1357 transitions. [2019-12-07 15:45:07,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 15:45:07,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:07,343 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:07,343 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:07,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:07,343 INFO L82 PathProgramCache]: Analyzing trace with hash 402001855, now seen corresponding path program 1 times [2019-12-07 15:45:07,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:07,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823849172] [2019-12-07 15:45:07,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 15:45:07,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823849172] [2019-12-07 15:45:07,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:07,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:45:07,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258202210] [2019-12-07 15:45:07,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:45:07,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:07,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:45:07,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:07,399 INFO L87 Difference]: Start difference. First operand 903 states and 1357 transitions. Second operand 3 states. [2019-12-07 15:45:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:07,449 INFO L93 Difference]: Finished difference Result 2081 states and 3143 transitions. [2019-12-07 15:45:07,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:45:07,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-12-07 15:45:07,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:07,453 INFO L225 Difference]: With dead ends: 2081 [2019-12-07 15:45:07,453 INFO L226 Difference]: Without dead ends: 1197 [2019-12-07 15:45:07,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:07,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-12-07 15:45:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2019-12-07 15:45:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-12-07 15:45:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1801 transitions. [2019-12-07 15:45:07,471 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1801 transitions. Word has length 165 [2019-12-07 15:45:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:07,471 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1801 transitions. [2019-12-07 15:45:07,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:45:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1801 transitions. [2019-12-07 15:45:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-12-07 15:45:07,472 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:07,473 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:07,473 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:07,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1332197165, now seen corresponding path program 1 times [2019-12-07 15:45:07,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:07,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999455219] [2019-12-07 15:45:07,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-12-07 15:45:07,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999455219] [2019-12-07 15:45:07,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:07,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:07,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997729813] [2019-12-07 15:45:07,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:07,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:07,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:07,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:07,523 INFO L87 Difference]: Start difference. First operand 1197 states and 1801 transitions. Second operand 4 states. [2019-12-07 15:45:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:07,760 INFO L93 Difference]: Finished difference Result 2443 states and 3684 transitions. [2019-12-07 15:45:07,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:07,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-12-07 15:45:07,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:07,765 INFO L225 Difference]: With dead ends: 2443 [2019-12-07 15:45:07,765 INFO L226 Difference]: Without dead ends: 1265 [2019-12-07 15:45:07,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-12-07 15:45:07,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1197. [2019-12-07 15:45:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-12-07 15:45:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1797 transitions. [2019-12-07 15:45:07,783 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1797 transitions. Word has length 188 [2019-12-07 15:45:07,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:07,783 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1797 transitions. [2019-12-07 15:45:07,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1797 transitions. [2019-12-07 15:45:07,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-07 15:45:07,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:07,785 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:07,785 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:07,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:07,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1479571284, now seen corresponding path program 1 times [2019-12-07 15:45:07,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:07,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635456247] [2019-12-07 15:45:07,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-12-07 15:45:07,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635456247] [2019-12-07 15:45:07,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:07,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:07,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868486602] [2019-12-07 15:45:07,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:07,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:07,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:07,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:07,836 INFO L87 Difference]: Start difference. First operand 1197 states and 1797 transitions. Second operand 4 states. [2019-12-07 15:45:08,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:08,130 INFO L93 Difference]: Finished difference Result 2427 states and 3652 transitions. [2019-12-07 15:45:08,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:08,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-12-07 15:45:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:08,139 INFO L225 Difference]: With dead ends: 2427 [2019-12-07 15:45:08,139 INFO L226 Difference]: Without dead ends: 1249 [2019-12-07 15:45:08,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:08,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2019-12-07 15:45:08,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1197. [2019-12-07 15:45:08,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-12-07 15:45:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1793 transitions. [2019-12-07 15:45:08,162 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1793 transitions. Word has length 189 [2019-12-07 15:45:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:08,163 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 1793 transitions. [2019-12-07 15:45:08,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:08,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1793 transitions. [2019-12-07 15:45:08,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-12-07 15:45:08,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:08,164 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:08,164 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:08,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:08,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1805622995, now seen corresponding path program 1 times [2019-12-07 15:45:08,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:08,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898330271] [2019-12-07 15:45:08,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 15:45:08,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898330271] [2019-12-07 15:45:08,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:08,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:45:08,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73385415] [2019-12-07 15:45:08,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:45:08,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:08,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:45:08,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:08,244 INFO L87 Difference]: Start difference. First operand 1197 states and 1793 transitions. Second operand 3 states. [2019-12-07 15:45:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:08,292 INFO L93 Difference]: Finished difference Result 2669 states and 4013 transitions. [2019-12-07 15:45:08,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:45:08,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-12-07 15:45:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:08,297 INFO L225 Difference]: With dead ends: 2669 [2019-12-07 15:45:08,297 INFO L226 Difference]: Without dead ends: 1491 [2019-12-07 15:45:08,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:08,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2019-12-07 15:45:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1491. [2019-12-07 15:45:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2019-12-07 15:45:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 2236 transitions. [2019-12-07 15:45:08,319 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 2236 transitions. Word has length 197 [2019-12-07 15:45:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:08,319 INFO L462 AbstractCegarLoop]: Abstraction has 1491 states and 2236 transitions. [2019-12-07 15:45:08,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:45:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2236 transitions. [2019-12-07 15:45:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-12-07 15:45:08,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:08,321 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:08,321 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:08,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:08,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1322460169, now seen corresponding path program 1 times [2019-12-07 15:45:08,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:08,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66871053] [2019-12-07 15:45:08,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 15:45:08,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66871053] [2019-12-07 15:45:08,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:08,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:45:08,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621628822] [2019-12-07 15:45:08,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:45:08,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:08,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:45:08,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:08,374 INFO L87 Difference]: Start difference. First operand 1491 states and 2236 transitions. Second operand 3 states. [2019-12-07 15:45:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:08,422 INFO L93 Difference]: Finished difference Result 3257 states and 4899 transitions. [2019-12-07 15:45:08,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:45:08,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-12-07 15:45:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:08,426 INFO L225 Difference]: With dead ends: 3257 [2019-12-07 15:45:08,426 INFO L226 Difference]: Without dead ends: 1785 [2019-12-07 15:45:08,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:08,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2019-12-07 15:45:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1785. [2019-12-07 15:45:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2019-12-07 15:45:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2680 transitions. [2019-12-07 15:45:08,454 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2680 transitions. Word has length 199 [2019-12-07 15:45:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:08,454 INFO L462 AbstractCegarLoop]: Abstraction has 1785 states and 2680 transitions. [2019-12-07 15:45:08,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:45:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2680 transitions. [2019-12-07 15:45:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-12-07 15:45:08,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:08,456 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:08,456 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:08,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1509594081, now seen corresponding path program 1 times [2019-12-07 15:45:08,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:08,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037674546] [2019-12-07 15:45:08,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-12-07 15:45:08,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037674546] [2019-12-07 15:45:08,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:08,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:45:08,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798715148] [2019-12-07 15:45:08,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:45:08,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:08,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:45:08,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:08,518 INFO L87 Difference]: Start difference. First operand 1785 states and 2680 transitions. Second operand 3 states. [2019-12-07 15:45:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:08,569 INFO L93 Difference]: Finished difference Result 3845 states and 5787 transitions. [2019-12-07 15:45:08,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:45:08,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-12-07 15:45:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:08,572 INFO L225 Difference]: With dead ends: 3845 [2019-12-07 15:45:08,572 INFO L226 Difference]: Without dead ends: 2079 [2019-12-07 15:45:08,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2019-12-07 15:45:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 2079. [2019-12-07 15:45:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2079 states. [2019-12-07 15:45:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 3125 transitions. [2019-12-07 15:45:08,605 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 3125 transitions. Word has length 232 [2019-12-07 15:45:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:08,605 INFO L462 AbstractCegarLoop]: Abstraction has 2079 states and 3125 transitions. [2019-12-07 15:45:08,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:45:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 3125 transitions. [2019-12-07 15:45:08,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-12-07 15:45:08,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:08,607 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:08,608 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:08,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:08,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2072566463, now seen corresponding path program 1 times [2019-12-07 15:45:08,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:08,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549699899] [2019-12-07 15:45:08,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-12-07 15:45:08,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549699899] [2019-12-07 15:45:08,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:08,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:45:08,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818505665] [2019-12-07 15:45:08,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:45:08,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:08,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:45:08,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:08,683 INFO L87 Difference]: Start difference. First operand 2079 states and 3125 transitions. Second operand 3 states. [2019-12-07 15:45:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:08,753 INFO L93 Difference]: Finished difference Result 4428 states and 6670 transitions. [2019-12-07 15:45:08,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:45:08,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-12-07 15:45:08,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:08,757 INFO L225 Difference]: With dead ends: 4428 [2019-12-07 15:45:08,757 INFO L226 Difference]: Without dead ends: 2368 [2019-12-07 15:45:08,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2019-12-07 15:45:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2368. [2019-12-07 15:45:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2368 states. [2019-12-07 15:45:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3555 transitions. [2019-12-07 15:45:08,789 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3555 transitions. Word has length 267 [2019-12-07 15:45:08,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:08,789 INFO L462 AbstractCegarLoop]: Abstraction has 2368 states and 3555 transitions. [2019-12-07 15:45:08,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:45:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3555 transitions. [2019-12-07 15:45:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-12-07 15:45:08,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:08,792 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:08,793 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:08,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:08,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1787849424, now seen corresponding path program 1 times [2019-12-07 15:45:08,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:08,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672013548] [2019-12-07 15:45:08,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-12-07 15:45:08,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672013548] [2019-12-07 15:45:08,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:08,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:45:08,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199727074] [2019-12-07 15:45:08,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:45:08,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:08,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:45:08,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:08,911 INFO L87 Difference]: Start difference. First operand 2368 states and 3555 transitions. Second operand 3 states. [2019-12-07 15:45:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:08,971 INFO L93 Difference]: Finished difference Result 5011 states and 7537 transitions. [2019-12-07 15:45:08,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:45:08,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 306 [2019-12-07 15:45:08,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:08,974 INFO L225 Difference]: With dead ends: 5011 [2019-12-07 15:45:08,974 INFO L226 Difference]: Without dead ends: 2662 [2019-12-07 15:45:08,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2019-12-07 15:45:09,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2662. [2019-12-07 15:45:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2662 states. [2019-12-07 15:45:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 4002 transitions. [2019-12-07 15:45:09,011 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 4002 transitions. Word has length 306 [2019-12-07 15:45:09,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:09,012 INFO L462 AbstractCegarLoop]: Abstraction has 2662 states and 4002 transitions. [2019-12-07 15:45:09,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:45:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 4002 transitions. [2019-12-07 15:45:09,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-12-07 15:45:09,015 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:09,015 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:09,015 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:09,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:09,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1856469910, now seen corresponding path program 1 times [2019-12-07 15:45:09,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:09,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86160708] [2019-12-07 15:45:09,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-12-07 15:45:09,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86160708] [2019-12-07 15:45:09,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:09,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:45:09,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436857363] [2019-12-07 15:45:09,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:45:09,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:09,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:45:09,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:09,123 INFO L87 Difference]: Start difference. First operand 2662 states and 4002 transitions. Second operand 3 states. [2019-12-07 15:45:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:09,183 INFO L93 Difference]: Finished difference Result 2958 states and 4452 transitions. [2019-12-07 15:45:09,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:45:09,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2019-12-07 15:45:09,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:09,187 INFO L225 Difference]: With dead ends: 2958 [2019-12-07 15:45:09,187 INFO L226 Difference]: Without dead ends: 2956 [2019-12-07 15:45:09,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:45:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2019-12-07 15:45:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2956. [2019-12-07 15:45:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2956 states. [2019-12-07 15:45:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 4450 transitions. [2019-12-07 15:45:09,230 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 4450 transitions. Word has length 347 [2019-12-07 15:45:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:09,230 INFO L462 AbstractCegarLoop]: Abstraction has 2956 states and 4450 transitions. [2019-12-07 15:45:09,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:45:09,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 4450 transitions. [2019-12-07 15:45:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-12-07 15:45:09,234 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:09,234 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:09,234 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:09,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash 51951590, now seen corresponding path program 1 times [2019-12-07 15:45:09,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:09,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257770934] [2019-12-07 15:45:09,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 717 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2019-12-07 15:45:09,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257770934] [2019-12-07 15:45:09,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:09,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:09,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152384446] [2019-12-07 15:45:09,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:09,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:09,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:09,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:09,408 INFO L87 Difference]: Start difference. First operand 2956 states and 4450 transitions. Second operand 4 states. [2019-12-07 15:45:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:09,794 INFO L93 Difference]: Finished difference Result 6942 states and 10480 transitions. [2019-12-07 15:45:09,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:09,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 390 [2019-12-07 15:45:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:09,798 INFO L225 Difference]: With dead ends: 6942 [2019-12-07 15:45:09,799 INFO L226 Difference]: Without dead ends: 4005 [2019-12-07 15:45:09,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2019-12-07 15:45:09,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 3366. [2019-12-07 15:45:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3366 states. [2019-12-07 15:45:09,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 5200 transitions. [2019-12-07 15:45:09,852 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 5200 transitions. Word has length 390 [2019-12-07 15:45:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:09,852 INFO L462 AbstractCegarLoop]: Abstraction has 3366 states and 5200 transitions. [2019-12-07 15:45:09,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 5200 transitions. [2019-12-07 15:45:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-12-07 15:45:09,856 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:09,857 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:09,857 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:09,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:09,857 INFO L82 PathProgramCache]: Analyzing trace with hash 998989476, now seen corresponding path program 1 times [2019-12-07 15:45:09,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:09,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086284503] [2019-12-07 15:45:09,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 708 proven. 91 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2019-12-07 15:45:10,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086284503] [2019-12-07 15:45:10,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092270548] [2019-12-07 15:45:10,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:45:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:10,453 INFO L264 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-07 15:45:10,470 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:45:10,532 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:10,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-12-07 15:45:10,533 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,554 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:10,556 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_164|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-12-07 15:45:10,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:10,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:10,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:10,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:10,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:10,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:10,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 15:45:10,587 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,607 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:10,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:10,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:10,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:10,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:10,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:10,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:10,620 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 15:45:10,621 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,633 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:10,655 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 15:45:10,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 15:45:10,656 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,664 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:10,665 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,665 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 15:45:10,697 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 15:45:10,697 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 15:45:10,697 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,702 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:10,702 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,703 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 15:45:10,725 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 15:45:10,726 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 15:45:10,726 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,731 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:10,732 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,732 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 15:45:10,734 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_167|]} [2019-12-07 15:45:10,738 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:45:10,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:10,781 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 15:45:10,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 15:45:10,782 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,789 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:10,789 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,789 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 15:45:10,816 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 15:45:10,817 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 15:45:10,817 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,823 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:10,823 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,824 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 15:45:10,846 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 15:45:10,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 15:45:10,847 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,853 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:10,853 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,853 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 15:45:10,858 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_170|]} [2019-12-07 15:45:10,860 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:45:10,871 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:10,908 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 15:45:10,909 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 15:45:10,909 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,917 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:10,917 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:45:10,917 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 15:45:10,922 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-12-07 15:45:10,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 15:45:10,925 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:45:10,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:11,007 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 15:45:11,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 15:45:11,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:45:11,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:45:11,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:45:11,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:45:11,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,041 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-12-07 15:45:11,123 INFO L614 ElimStorePlain]: treesize reduction 1116, result has 4.5 percent of original size [2019-12-07 15:45:11,123 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:45:11,124 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 15:45:11,126 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-12-07 15:45:11,127 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:45:11,138 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:11,171 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 15:45:11,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 15:45:11,172 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:11,179 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:11,179 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:45:11,179 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 15:45:11,185 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-12-07 15:45:11,187 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 15:45:11,187 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:45:11,196 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:11,264 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 15:45:11,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 15:45:11,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:11,267 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:11,288 INFO L614 ElimStorePlain]: treesize reduction 157, result has 25.2 percent of original size [2019-12-07 15:45:11,289 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:45:11,289 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 15:45:11,291 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_158|, |v_#memory_int_178|], 2=[|v_#memory_$Pointer$.base_163|], 12=[|v_#memory_$Pointer$.base_174|]} [2019-12-07 15:45:11,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 97 [2019-12-07 15:45:11,294 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:45:11,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:11,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:11,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:11,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 34 [2019-12-07 15:45:11,316 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:11,330 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:11,332 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:45:11,342 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:11,344 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 59 [2019-12-07 15:45:11,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:11,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:11,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:11,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:11,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:11,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:11,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:11,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:45:11,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 26 [2019-12-07 15:45:11,353 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:45:11,356 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:11,356 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:45:11,361 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:11,361 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:45:11,361 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:181, output treesize:32 [2019-12-07 15:45:11,395 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 15:45:11,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-12-07 15:45:11,396 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:11,399 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:11,399 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:45:11,399 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-12-07 15:45:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 714 proven. 91 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2019-12-07 15:45:11,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:45:11,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-12-07 15:45:11,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761371123] [2019-12-07 15:45:11,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:45:11,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:11,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:45:11,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:45:11,779 INFO L87 Difference]: Start difference. First operand 3366 states and 5200 transitions. Second operand 8 states. [2019-12-07 15:45:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:13,255 INFO L93 Difference]: Finished difference Result 12360 states and 19132 transitions. [2019-12-07 15:45:13,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:45:13,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 390 [2019-12-07 15:45:13,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:13,265 INFO L225 Difference]: With dead ends: 12360 [2019-12-07 15:45:13,265 INFO L226 Difference]: Without dead ends: 9013 [2019-12-07 15:45:13,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:45:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9013 states. [2019-12-07 15:45:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9013 to 7151. [2019-12-07 15:45:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-12-07 15:45:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 11267 transitions. [2019-12-07 15:45:13,409 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 11267 transitions. Word has length 390 [2019-12-07 15:45:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:13,409 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 11267 transitions. [2019-12-07 15:45:13,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 15:45:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 11267 transitions. [2019-12-07 15:45:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-12-07 15:45:13,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:13,419 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:13,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:45:13,620 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:13,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:13,620 INFO L82 PathProgramCache]: Analyzing trace with hash -10666121, now seen corresponding path program 1 times [2019-12-07 15:45:13,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:13,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671271645] [2019-12-07 15:45:13,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 718 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-12-07 15:45:13,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671271645] [2019-12-07 15:45:13,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:13,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:13,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392706552] [2019-12-07 15:45:13,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:13,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:13,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:13,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:13,786 INFO L87 Difference]: Start difference. First operand 7151 states and 11267 transitions. Second operand 4 states. [2019-12-07 15:45:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:14,156 INFO L93 Difference]: Finished difference Result 11458 states and 17889 transitions. [2019-12-07 15:45:14,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:14,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 399 [2019-12-07 15:45:14,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:14,167 INFO L225 Difference]: With dead ends: 11458 [2019-12-07 15:45:14,167 INFO L226 Difference]: Without dead ends: 7791 [2019-12-07 15:45:14,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7791 states. [2019-12-07 15:45:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7791 to 7151. [2019-12-07 15:45:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-12-07 15:45:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 11247 transitions. [2019-12-07 15:45:14,292 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 11247 transitions. Word has length 399 [2019-12-07 15:45:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:14,292 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 11247 transitions. [2019-12-07 15:45:14,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 11247 transitions. [2019-12-07 15:45:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-12-07 15:45:14,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:14,300 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:14,300 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash -636572992, now seen corresponding path program 1 times [2019-12-07 15:45:14,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:14,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349592978] [2019-12-07 15:45:14,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 730 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-12-07 15:45:14,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349592978] [2019-12-07 15:45:14,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:14,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:14,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699188271] [2019-12-07 15:45:14,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:14,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:14,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:14,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:14,479 INFO L87 Difference]: Start difference. First operand 7151 states and 11247 transitions. Second operand 4 states. [2019-12-07 15:45:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:14,930 INFO L93 Difference]: Finished difference Result 11458 states and 17859 transitions. [2019-12-07 15:45:14,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:14,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 400 [2019-12-07 15:45:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:14,937 INFO L225 Difference]: With dead ends: 11458 [2019-12-07 15:45:14,937 INFO L226 Difference]: Without dead ends: 7791 [2019-12-07 15:45:14,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:14,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7791 states. [2019-12-07 15:45:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7791 to 7151. [2019-12-07 15:45:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-12-07 15:45:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 11227 transitions. [2019-12-07 15:45:15,056 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 11227 transitions. Word has length 400 [2019-12-07 15:45:15,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:15,056 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 11227 transitions. [2019-12-07 15:45:15,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 11227 transitions. [2019-12-07 15:45:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-12-07 15:45:15,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:15,065 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:15,065 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:15,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:15,065 INFO L82 PathProgramCache]: Analyzing trace with hash 226663922, now seen corresponding path program 1 times [2019-12-07 15:45:15,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:15,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771621348] [2019-12-07 15:45:15,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 742 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-12-07 15:45:15,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771621348] [2019-12-07 15:45:15,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:15,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:15,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778635691] [2019-12-07 15:45:15,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:15,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:15,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:15,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:15,203 INFO L87 Difference]: Start difference. First operand 7151 states and 11227 transitions. Second operand 4 states. [2019-12-07 15:45:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:15,583 INFO L93 Difference]: Finished difference Result 11458 states and 17829 transitions. [2019-12-07 15:45:15,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:15,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 401 [2019-12-07 15:45:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:15,588 INFO L225 Difference]: With dead ends: 11458 [2019-12-07 15:45:15,588 INFO L226 Difference]: Without dead ends: 7791 [2019-12-07 15:45:15,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:15,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7791 states. [2019-12-07 15:45:15,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7791 to 7151. [2019-12-07 15:45:15,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-12-07 15:45:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 11207 transitions. [2019-12-07 15:45:15,713 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 11207 transitions. Word has length 401 [2019-12-07 15:45:15,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:15,713 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 11207 transitions. [2019-12-07 15:45:15,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 11207 transitions. [2019-12-07 15:45:15,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-12-07 15:45:15,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:15,720 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:15,720 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:15,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:15,720 INFO L82 PathProgramCache]: Analyzing trace with hash 8717915, now seen corresponding path program 1 times [2019-12-07 15:45:15,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:15,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225551248] [2019-12-07 15:45:15,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 754 proven. 0 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-12-07 15:45:15,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225551248] [2019-12-07 15:45:15,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:15,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:15,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742361140] [2019-12-07 15:45:15,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:15,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:15,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:15,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:15,869 INFO L87 Difference]: Start difference. First operand 7151 states and 11207 transitions. Second operand 4 states. [2019-12-07 15:45:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:16,224 INFO L93 Difference]: Finished difference Result 11358 states and 17679 transitions. [2019-12-07 15:45:16,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:16,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 402 [2019-12-07 15:45:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:16,230 INFO L225 Difference]: With dead ends: 11358 [2019-12-07 15:45:16,230 INFO L226 Difference]: Without dead ends: 7691 [2019-12-07 15:45:16,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7691 states. [2019-12-07 15:45:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7691 to 7151. [2019-12-07 15:45:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2019-12-07 15:45:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 11187 transitions. [2019-12-07 15:45:16,343 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 11187 transitions. Word has length 402 [2019-12-07 15:45:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:16,343 INFO L462 AbstractCegarLoop]: Abstraction has 7151 states and 11187 transitions. [2019-12-07 15:45:16,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 11187 transitions. [2019-12-07 15:45:16,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-12-07 15:45:16,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:16,348 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:16,348 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:16,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:16,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1223182652, now seen corresponding path program 1 times [2019-12-07 15:45:16,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:16,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584929468] [2019-12-07 15:45:16,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-12-07 15:45:16,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584929468] [2019-12-07 15:45:16,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:16,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:45:16,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730707403] [2019-12-07 15:45:16,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:45:16,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:16,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:45:16,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:16,541 INFO L87 Difference]: Start difference. First operand 7151 states and 11187 transitions. Second operand 5 states. [2019-12-07 15:45:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:16,981 INFO L93 Difference]: Finished difference Result 16769 states and 26295 transitions. [2019-12-07 15:45:16,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:16,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 405 [2019-12-07 15:45:16,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:16,989 INFO L225 Difference]: With dead ends: 16769 [2019-12-07 15:45:16,989 INFO L226 Difference]: Without dead ends: 9637 [2019-12-07 15:45:16,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:45:16,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9637 states. [2019-12-07 15:45:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9637 to 7701. [2019-12-07 15:45:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7701 states. [2019-12-07 15:45:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7701 states to 7701 states and 12167 transitions. [2019-12-07 15:45:17,118 INFO L78 Accepts]: Start accepts. Automaton has 7701 states and 12167 transitions. Word has length 405 [2019-12-07 15:45:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:17,118 INFO L462 AbstractCegarLoop]: Abstraction has 7701 states and 12167 transitions. [2019-12-07 15:45:17,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:45:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand 7701 states and 12167 transitions. [2019-12-07 15:45:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-12-07 15:45:17,123 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:17,123 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:17,124 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:17,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:17,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1549537306, now seen corresponding path program 2 times [2019-12-07 15:45:17,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:17,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040453943] [2019-12-07 15:45:17,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:17,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2019-12-07 15:45:17,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040453943] [2019-12-07 15:45:17,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:17,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:45:17,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482608788] [2019-12-07 15:45:17,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:45:17,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:17,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:45:17,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:45:17,313 INFO L87 Difference]: Start difference. First operand 7701 states and 12167 transitions. Second operand 6 states. [2019-12-07 15:45:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:18,149 INFO L93 Difference]: Finished difference Result 19215 states and 30148 transitions. [2019-12-07 15:45:18,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:45:18,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 405 [2019-12-07 15:45:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:18,158 INFO L225 Difference]: With dead ends: 19215 [2019-12-07 15:45:18,158 INFO L226 Difference]: Without dead ends: 11533 [2019-12-07 15:45:18,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:45:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11533 states. [2019-12-07 15:45:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11533 to 8371. [2019-12-07 15:45:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8371 states. [2019-12-07 15:45:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8371 states to 8371 states and 13237 transitions. [2019-12-07 15:45:18,308 INFO L78 Accepts]: Start accepts. Automaton has 8371 states and 13237 transitions. Word has length 405 [2019-12-07 15:45:18,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:18,309 INFO L462 AbstractCegarLoop]: Abstraction has 8371 states and 13237 transitions. [2019-12-07 15:45:18,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:45:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand 8371 states and 13237 transitions. [2019-12-07 15:45:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-12-07 15:45:18,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:18,314 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:18,314 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:18,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:18,315 INFO L82 PathProgramCache]: Analyzing trace with hash 383945128, now seen corresponding path program 1 times [2019-12-07 15:45:18,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:18,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775271868] [2019-12-07 15:45:18,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1532 backedges. 860 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-12-07 15:45:18,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775271868] [2019-12-07 15:45:18,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:18,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:45:18,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694706936] [2019-12-07 15:45:18,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:45:18,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:18,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:45:18,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:18,503 INFO L87 Difference]: Start difference. First operand 8371 states and 13237 transitions. Second operand 5 states. [2019-12-07 15:45:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:18,990 INFO L93 Difference]: Finished difference Result 18349 states and 28842 transitions. [2019-12-07 15:45:18,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:18,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 406 [2019-12-07 15:45:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:18,997 INFO L225 Difference]: With dead ends: 18349 [2019-12-07 15:45:18,997 INFO L226 Difference]: Without dead ends: 9997 [2019-12-07 15:45:19,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:45:19,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9997 states. [2019-12-07 15:45:19,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9997 to 8461. [2019-12-07 15:45:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13357 transitions. [2019-12-07 15:45:19,159 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13357 transitions. Word has length 406 [2019-12-07 15:45:19,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:19,159 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13357 transitions. [2019-12-07 15:45:19,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:45:19,159 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13357 transitions. [2019-12-07 15:45:19,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2019-12-07 15:45:19,165 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:19,165 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:19,165 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:19,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1026115724, now seen corresponding path program 1 times [2019-12-07 15:45:19,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:19,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529912358] [2019-12-07 15:45:19,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1546 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2019-12-07 15:45:19,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529912358] [2019-12-07 15:45:19,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:19,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:19,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419758833] [2019-12-07 15:45:19,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:19,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:19,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:19,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:19,277 INFO L87 Difference]: Start difference. First operand 8461 states and 13357 transitions. Second operand 4 states. [2019-12-07 15:45:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:19,760 INFO L93 Difference]: Finished difference Result 14304 states and 22402 transitions. [2019-12-07 15:45:19,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:19,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 407 [2019-12-07 15:45:19,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:19,767 INFO L225 Difference]: With dead ends: 14304 [2019-12-07 15:45:19,767 INFO L226 Difference]: Without dead ends: 9817 [2019-12-07 15:45:19,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9817 states. [2019-12-07 15:45:19,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9817 to 8461. [2019-12-07 15:45:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13337 transitions. [2019-12-07 15:45:19,911 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13337 transitions. Word has length 407 [2019-12-07 15:45:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:19,911 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13337 transitions. [2019-12-07 15:45:19,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13337 transitions. [2019-12-07 15:45:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-12-07 15:45:19,917 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:19,917 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:19,917 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:19,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1129113554, now seen corresponding path program 1 times [2019-12-07 15:45:19,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:19,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926538586] [2019-12-07 15:45:19,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2019-12-07 15:45:20,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926538586] [2019-12-07 15:45:20,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:20,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:20,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690471418] [2019-12-07 15:45:20,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:20,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:20,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:20,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:20,035 INFO L87 Difference]: Start difference. First operand 8461 states and 13337 transitions. Second operand 4 states. [2019-12-07 15:45:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:20,490 INFO L93 Difference]: Finished difference Result 14304 states and 22372 transitions. [2019-12-07 15:45:20,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:20,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 408 [2019-12-07 15:45:20,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:20,498 INFO L225 Difference]: With dead ends: 14304 [2019-12-07 15:45:20,498 INFO L226 Difference]: Without dead ends: 9817 [2019-12-07 15:45:20,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9817 states. [2019-12-07 15:45:20,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9817 to 8461. [2019-12-07 15:45:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13317 transitions. [2019-12-07 15:45:20,685 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13317 transitions. Word has length 408 [2019-12-07 15:45:20,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:20,685 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13317 transitions. [2019-12-07 15:45:20,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:20,686 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13317 transitions. [2019-12-07 15:45:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-12-07 15:45:20,692 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:20,692 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:20,692 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:20,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:20,692 INFO L82 PathProgramCache]: Analyzing trace with hash -804582959, now seen corresponding path program 1 times [2019-12-07 15:45:20,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:20,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040649771] [2019-12-07 15:45:20,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1570 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2019-12-07 15:45:20,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040649771] [2019-12-07 15:45:20,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:20,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:20,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920424019] [2019-12-07 15:45:20,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:20,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:20,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:20,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:20,806 INFO L87 Difference]: Start difference. First operand 8461 states and 13317 transitions. Second operand 4 states. [2019-12-07 15:45:21,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:21,262 INFO L93 Difference]: Finished difference Result 14204 states and 22222 transitions. [2019-12-07 15:45:21,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:21,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 409 [2019-12-07 15:45:21,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:21,269 INFO L225 Difference]: With dead ends: 14204 [2019-12-07 15:45:21,269 INFO L226 Difference]: Without dead ends: 9717 [2019-12-07 15:45:21,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:21,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9717 states. [2019-12-07 15:45:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9717 to 8461. [2019-12-07 15:45:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13297 transitions. [2019-12-07 15:45:21,415 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13297 transitions. Word has length 409 [2019-12-07 15:45:21,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:21,415 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13297 transitions. [2019-12-07 15:45:21,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13297 transitions. [2019-12-07 15:45:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-12-07 15:45:21,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:21,421 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:21,421 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:21,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:21,421 INFO L82 PathProgramCache]: Analyzing trace with hash -422950425, now seen corresponding path program 1 times [2019-12-07 15:45:21,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:21,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070413869] [2019-12-07 15:45:21,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 577 proven. 0 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2019-12-07 15:45:21,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070413869] [2019-12-07 15:45:21,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:21,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:21,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060142544] [2019-12-07 15:45:21,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:21,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:21,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:21,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:21,539 INFO L87 Difference]: Start difference. First operand 8461 states and 13297 transitions. Second operand 4 states. [2019-12-07 15:45:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:21,984 INFO L93 Difference]: Finished difference Result 18159 states and 28409 transitions. [2019-12-07 15:45:21,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:21,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 419 [2019-12-07 15:45:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:21,991 INFO L225 Difference]: With dead ends: 18159 [2019-12-07 15:45:21,991 INFO L226 Difference]: Without dead ends: 9717 [2019-12-07 15:45:21,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9717 states. [2019-12-07 15:45:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9717 to 8461. [2019-12-07 15:45:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13277 transitions. [2019-12-07 15:45:22,162 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13277 transitions. Word has length 419 [2019-12-07 15:45:22,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:22,162 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13277 transitions. [2019-12-07 15:45:22,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:22,162 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13277 transitions. [2019-12-07 15:45:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-12-07 15:45:22,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:22,167 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:22,168 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:22,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:22,168 INFO L82 PathProgramCache]: Analyzing trace with hash -517020184, now seen corresponding path program 1 times [2019-12-07 15:45:22,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:22,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569012561] [2019-12-07 15:45:22,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2019-12-07 15:45:22,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569012561] [2019-12-07 15:45:22,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:22,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:22,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980650706] [2019-12-07 15:45:22,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:22,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:22,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:22,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:22,287 INFO L87 Difference]: Start difference. First operand 8461 states and 13277 transitions. Second operand 4 states. [2019-12-07 15:45:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:22,735 INFO L93 Difference]: Finished difference Result 18119 states and 28329 transitions. [2019-12-07 15:45:22,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:22,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 420 [2019-12-07 15:45:22,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:22,742 INFO L225 Difference]: With dead ends: 18119 [2019-12-07 15:45:22,742 INFO L226 Difference]: Without dead ends: 9677 [2019-12-07 15:45:22,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9677 states. [2019-12-07 15:45:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9677 to 8461. [2019-12-07 15:45:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13257 transitions. [2019-12-07 15:45:22,897 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13257 transitions. Word has length 420 [2019-12-07 15:45:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:22,897 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13257 transitions. [2019-12-07 15:45:22,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13257 transitions. [2019-12-07 15:45:22,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-12-07 15:45:22,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:22,903 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:22,903 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:22,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:22,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1050165976, now seen corresponding path program 1 times [2019-12-07 15:45:22,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:22,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752143587] [2019-12-07 15:45:22,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 628 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2019-12-07 15:45:23,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752143587] [2019-12-07 15:45:23,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:23,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:23,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868594427] [2019-12-07 15:45:23,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:23,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:23,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:23,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:23,019 INFO L87 Difference]: Start difference. First operand 8461 states and 13257 transitions. Second operand 4 states. [2019-12-07 15:45:23,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:23,510 INFO L93 Difference]: Finished difference Result 14004 states and 21692 transitions. [2019-12-07 15:45:23,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:23,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 420 [2019-12-07 15:45:23,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:23,517 INFO L225 Difference]: With dead ends: 14004 [2019-12-07 15:45:23,517 INFO L226 Difference]: Without dead ends: 9517 [2019-12-07 15:45:23,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9517 states. [2019-12-07 15:45:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9517 to 8461. [2019-12-07 15:45:23,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13237 transitions. [2019-12-07 15:45:23,676 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13237 transitions. Word has length 420 [2019-12-07 15:45:23,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:23,676 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13237 transitions. [2019-12-07 15:45:23,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13237 transitions. [2019-12-07 15:45:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-12-07 15:45:23,682 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:23,683 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:23,683 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2020552241, now seen corresponding path program 1 times [2019-12-07 15:45:23,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:23,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022708761] [2019-12-07 15:45:23,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2019-12-07 15:45:23,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022708761] [2019-12-07 15:45:23,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:23,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:23,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642213250] [2019-12-07 15:45:23,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:23,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:23,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:23,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:23,851 INFO L87 Difference]: Start difference. First operand 8461 states and 13237 transitions. Second operand 4 states. [2019-12-07 15:45:24,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:24,427 INFO L93 Difference]: Finished difference Result 14004 states and 21662 transitions. [2019-12-07 15:45:24,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:24,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-12-07 15:45:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:24,434 INFO L225 Difference]: With dead ends: 14004 [2019-12-07 15:45:24,434 INFO L226 Difference]: Without dead ends: 9517 [2019-12-07 15:45:24,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9517 states. [2019-12-07 15:45:24,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9517 to 8461. [2019-12-07 15:45:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13217 transitions. [2019-12-07 15:45:24,595 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13217 transitions. Word has length 421 [2019-12-07 15:45:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:24,596 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13217 transitions. [2019-12-07 15:45:24,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13217 transitions. [2019-12-07 15:45:24,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2019-12-07 15:45:24,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:24,601 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:24,601 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:24,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:24,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1891874509, now seen corresponding path program 1 times [2019-12-07 15:45:24,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:24,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584967804] [2019-12-07 15:45:24,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1720 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2019-12-07 15:45:24,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584967804] [2019-12-07 15:45:24,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:24,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:24,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368783145] [2019-12-07 15:45:24,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:24,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:24,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:24,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:24,718 INFO L87 Difference]: Start difference. First operand 8461 states and 13217 transitions. Second operand 4 states. [2019-12-07 15:45:25,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:25,213 INFO L93 Difference]: Finished difference Result 14004 states and 21632 transitions. [2019-12-07 15:45:25,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:25,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 422 [2019-12-07 15:45:25,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:25,220 INFO L225 Difference]: With dead ends: 14004 [2019-12-07 15:45:25,220 INFO L226 Difference]: Without dead ends: 9517 [2019-12-07 15:45:25,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:25,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9517 states. [2019-12-07 15:45:25,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9517 to 8461. [2019-12-07 15:45:25,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13197 transitions. [2019-12-07 15:45:25,378 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13197 transitions. Word has length 422 [2019-12-07 15:45:25,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:25,379 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13197 transitions. [2019-12-07 15:45:25,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13197 transitions. [2019-12-07 15:45:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-12-07 15:45:25,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:25,384 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:25,384 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:25,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:25,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1366170166, now seen corresponding path program 1 times [2019-12-07 15:45:25,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:25,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940850909] [2019-12-07 15:45:25,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1733 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2019-12-07 15:45:25,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940850909] [2019-12-07 15:45:25,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:25,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:25,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434449533] [2019-12-07 15:45:25,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:25,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:25,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:25,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:25,502 INFO L87 Difference]: Start difference. First operand 8461 states and 13197 transitions. Second operand 4 states. [2019-12-07 15:45:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:26,003 INFO L93 Difference]: Finished difference Result 13904 states and 21482 transitions. [2019-12-07 15:45:26,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:26,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 423 [2019-12-07 15:45:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:26,009 INFO L225 Difference]: With dead ends: 13904 [2019-12-07 15:45:26,009 INFO L226 Difference]: Without dead ends: 9417 [2019-12-07 15:45:26,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9417 states. [2019-12-07 15:45:26,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9417 to 8461. [2019-12-07 15:45:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13177 transitions. [2019-12-07 15:45:26,171 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13177 transitions. Word has length 423 [2019-12-07 15:45:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:26,171 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13177 transitions. [2019-12-07 15:45:26,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:26,171 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13177 transitions. [2019-12-07 15:45:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-12-07 15:45:26,176 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:26,176 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:26,177 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:26,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:26,177 INFO L82 PathProgramCache]: Analyzing trace with hash 523241025, now seen corresponding path program 1 times [2019-12-07 15:45:26,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:26,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482629713] [2019-12-07 15:45:26,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1799 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 1235 trivial. 0 not checked. [2019-12-07 15:45:26,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482629713] [2019-12-07 15:45:26,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:26,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:26,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938307061] [2019-12-07 15:45:26,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:26,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:26,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:26,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:26,323 INFO L87 Difference]: Start difference. First operand 8461 states and 13177 transitions. Second operand 4 states. [2019-12-07 15:45:26,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:26,778 INFO L93 Difference]: Finished difference Result 17723 states and 27468 transitions. [2019-12-07 15:45:26,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:26,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 432 [2019-12-07 15:45:26,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:26,785 INFO L225 Difference]: With dead ends: 17723 [2019-12-07 15:45:26,785 INFO L226 Difference]: Without dead ends: 9281 [2019-12-07 15:45:26,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2019-12-07 15:45:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 8461. [2019-12-07 15:45:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13157 transitions. [2019-12-07 15:45:26,953 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13157 transitions. Word has length 432 [2019-12-07 15:45:26,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:26,953 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13157 transitions. [2019-12-07 15:45:26,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:26,953 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13157 transitions. [2019-12-07 15:45:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-12-07 15:45:26,959 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:26,959 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:26,959 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:26,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:26,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1877619336, now seen corresponding path program 1 times [2019-12-07 15:45:26,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:26,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386886463] [2019-12-07 15:45:26,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 571 proven. 0 refuted. 0 times theorem prover too weak. 1235 trivial. 0 not checked. [2019-12-07 15:45:27,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386886463] [2019-12-07 15:45:27,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:27,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:27,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080041409] [2019-12-07 15:45:27,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:27,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:27,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:27,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:27,106 INFO L87 Difference]: Start difference. First operand 8461 states and 13157 transitions. Second operand 4 states. [2019-12-07 15:45:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:27,581 INFO L93 Difference]: Finished difference Result 17683 states and 27388 transitions. [2019-12-07 15:45:27,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:27,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-12-07 15:45:27,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:27,588 INFO L225 Difference]: With dead ends: 17683 [2019-12-07 15:45:27,588 INFO L226 Difference]: Without dead ends: 9241 [2019-12-07 15:45:27,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:27,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9241 states. [2019-12-07 15:45:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9241 to 8461. [2019-12-07 15:45:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13137 transitions. [2019-12-07 15:45:27,819 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13137 transitions. Word has length 433 [2019-12-07 15:45:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:27,819 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13137 transitions. [2019-12-07 15:45:27,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13137 transitions. [2019-12-07 15:45:27,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-12-07 15:45:27,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:27,825 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:27,825 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:27,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:27,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2141119759, now seen corresponding path program 1 times [2019-12-07 15:45:27,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:27,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425540699] [2019-12-07 15:45:27,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:27,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-12-07 15:45:27,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425540699] [2019-12-07 15:45:27,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:27,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:27,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669047869] [2019-12-07 15:45:27,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:27,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:27,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:27,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:27,972 INFO L87 Difference]: Start difference. First operand 8461 states and 13137 transitions. Second operand 4 states. [2019-12-07 15:45:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:28,432 INFO L93 Difference]: Finished difference Result 17623 states and 27268 transitions. [2019-12-07 15:45:28,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:28,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-12-07 15:45:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:28,439 INFO L225 Difference]: With dead ends: 17623 [2019-12-07 15:45:28,439 INFO L226 Difference]: Without dead ends: 9181 [2019-12-07 15:45:28,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9181 states. [2019-12-07 15:45:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9181 to 8461. [2019-12-07 15:45:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13117 transitions. [2019-12-07 15:45:28,608 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13117 transitions. Word has length 433 [2019-12-07 15:45:28,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:28,608 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13117 transitions. [2019-12-07 15:45:28,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13117 transitions. [2019-12-07 15:45:28,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-12-07 15:45:28,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:28,614 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:28,614 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:28,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:28,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1372839948, now seen corresponding path program 1 times [2019-12-07 15:45:28,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:28,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877912764] [2019-12-07 15:45:28,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1841 backedges. 712 proven. 0 refuted. 0 times theorem prover too weak. 1129 trivial. 0 not checked. [2019-12-07 15:45:28,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877912764] [2019-12-07 15:45:28,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:28,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:28,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181235705] [2019-12-07 15:45:28,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:28,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:28,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:28,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:28,737 INFO L87 Difference]: Start difference. First operand 8461 states and 13117 transitions. Second operand 4 states. [2019-12-07 15:45:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:29,253 INFO L93 Difference]: Finished difference Result 17859 states and 27489 transitions. [2019-12-07 15:45:29,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:29,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-12-07 15:45:29,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:29,260 INFO L225 Difference]: With dead ends: 17859 [2019-12-07 15:45:29,260 INFO L226 Difference]: Without dead ends: 9417 [2019-12-07 15:45:29,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9417 states. [2019-12-07 15:45:29,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9417 to 8461. [2019-12-07 15:45:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:29,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13097 transitions. [2019-12-07 15:45:29,435 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13097 transitions. Word has length 433 [2019-12-07 15:45:29,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:29,435 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13097 transitions. [2019-12-07 15:45:29,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:29,435 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13097 transitions. [2019-12-07 15:45:29,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-12-07 15:45:29,440 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:29,440 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:29,441 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:29,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1891149376, now seen corresponding path program 1 times [2019-12-07 15:45:29,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:29,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166991412] [2019-12-07 15:45:29,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 1566 trivial. 0 not checked. [2019-12-07 15:45:29,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166991412] [2019-12-07 15:45:29,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:29,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:29,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534040012] [2019-12-07 15:45:29,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:29,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:29,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:29,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:29,625 INFO L87 Difference]: Start difference. First operand 8461 states and 13097 transitions. Second operand 4 states. [2019-12-07 15:45:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:30,143 INFO L93 Difference]: Finished difference Result 17859 states and 27449 transitions. [2019-12-07 15:45:30,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:30,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-12-07 15:45:30,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:30,150 INFO L225 Difference]: With dead ends: 17859 [2019-12-07 15:45:30,150 INFO L226 Difference]: Without dead ends: 9417 [2019-12-07 15:45:30,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9417 states. [2019-12-07 15:45:30,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9417 to 8461. [2019-12-07 15:45:30,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13077 transitions. [2019-12-07 15:45:30,329 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13077 transitions. Word has length 433 [2019-12-07 15:45:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:30,329 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13077 transitions. [2019-12-07 15:45:30,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13077 transitions. [2019-12-07 15:45:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-12-07 15:45:30,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:30,335 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 10, 9, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:30,335 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:30,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:30,335 INFO L82 PathProgramCache]: Analyzing trace with hash -6909596, now seen corresponding path program 1 times [2019-12-07 15:45:30,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:30,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765550082] [2019-12-07 15:45:30,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 684 proven. 0 refuted. 0 times theorem prover too weak. 1124 trivial. 0 not checked. [2019-12-07 15:45:30,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765550082] [2019-12-07 15:45:30,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:30,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:30,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671151925] [2019-12-07 15:45:30,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:30,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:30,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:30,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:30,463 INFO L87 Difference]: Start difference. First operand 8461 states and 13077 transitions. Second operand 4 states. [2019-12-07 15:45:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:30,848 INFO L93 Difference]: Finished difference Result 17203 states and 26546 transitions. [2019-12-07 15:45:30,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:30,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 433 [2019-12-07 15:45:30,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:30,855 INFO L225 Difference]: With dead ends: 17203 [2019-12-07 15:45:30,855 INFO L226 Difference]: Without dead ends: 8761 [2019-12-07 15:45:30,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:30,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8761 states. [2019-12-07 15:45:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8761 to 8461. [2019-12-07 15:45:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:31,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13057 transitions. [2019-12-07 15:45:31,034 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13057 transitions. Word has length 433 [2019-12-07 15:45:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:31,034 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13057 transitions. [2019-12-07 15:45:31,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13057 transitions. [2019-12-07 15:45:31,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-12-07 15:45:31,039 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:31,040 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 11, 11, 11, 10, 10, 9, 9, 9, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:31,040 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:31,040 INFO L82 PathProgramCache]: Analyzing trace with hash -682093469, now seen corresponding path program 1 times [2019-12-07 15:45:31,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:31,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462651448] [2019-12-07 15:45:31,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1854 backedges. 725 proven. 0 refuted. 0 times theorem prover too weak. 1129 trivial. 0 not checked. [2019-12-07 15:45:31,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462651448] [2019-12-07 15:45:31,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:31,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:31,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817909167] [2019-12-07 15:45:31,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:31,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:31,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:31,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:31,162 INFO L87 Difference]: Start difference. First operand 8461 states and 13057 transitions. Second operand 4 states. [2019-12-07 15:45:31,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:31,712 INFO L93 Difference]: Finished difference Result 17819 states and 27329 transitions. [2019-12-07 15:45:31,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:31,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2019-12-07 15:45:31,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:31,719 INFO L225 Difference]: With dead ends: 17819 [2019-12-07 15:45:31,719 INFO L226 Difference]: Without dead ends: 9377 [2019-12-07 15:45:31,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9377 states. [2019-12-07 15:45:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9377 to 8461. [2019-12-07 15:45:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13037 transitions. [2019-12-07 15:45:31,962 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13037 transitions. Word has length 434 [2019-12-07 15:45:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:31,962 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13037 transitions. [2019-12-07 15:45:31,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13037 transitions. [2019-12-07 15:45:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-12-07 15:45:31,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:31,969 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:31,969 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:31,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:31,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1745105630, now seen corresponding path program 1 times [2019-12-07 15:45:31,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:31,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303617327] [2019-12-07 15:45:31,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1893 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 1566 trivial. 0 not checked. [2019-12-07 15:45:32,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303617327] [2019-12-07 15:45:32,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:32,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:45:32,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590007885] [2019-12-07 15:45:32,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:32,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:32,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:32,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:32,132 INFO L87 Difference]: Start difference. First operand 8461 states and 13037 transitions. Second operand 4 states. [2019-12-07 15:45:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:32,638 INFO L93 Difference]: Finished difference Result 17723 states and 27168 transitions. [2019-12-07 15:45:32,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:32,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 434 [2019-12-07 15:45:32,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:32,645 INFO L225 Difference]: With dead ends: 17723 [2019-12-07 15:45:32,646 INFO L226 Difference]: Without dead ends: 9281 [2019-12-07 15:45:32,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:45:32,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9281 states. [2019-12-07 15:45:32,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9281 to 8461. [2019-12-07 15:45:32,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8461 states. [2019-12-07 15:45:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 13017 transitions. [2019-12-07 15:45:32,830 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 13017 transitions. Word has length 434 [2019-12-07 15:45:32,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:32,830 INFO L462 AbstractCegarLoop]: Abstraction has 8461 states and 13017 transitions. [2019-12-07 15:45:32,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:32,830 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 13017 transitions. [2019-12-07 15:45:32,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2019-12-07 15:45:32,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:32,836 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:32,836 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:32,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1410848715, now seen corresponding path program 1 times [2019-12-07 15:45:32,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:45:32,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744088414] [2019-12-07 15:45:32,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:45:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1813 backedges. 598 proven. 164 refuted. 0 times theorem prover too weak. 1051 trivial. 0 not checked. [2019-12-07 15:45:33,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744088414] [2019-12-07 15:45:33,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211392709] [2019-12-07 15:45:33,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:45:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:33,259 INFO L264 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 15:45:33,271 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:45:33,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-12-07 15:45:33,295 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:33,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:33,296 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:45:33,296 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 15:45:33,306 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_175|, |v_#memory_$Pointer$.offset_161|], 5=[|v_#memory_int_179|]} [2019-12-07 15:45:33,307 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 63 [2019-12-07 15:45:33,307 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:45:33,309 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:33,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2019-12-07 15:45:33,310 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:45:33,312 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:33,333 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:33,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-12-07 15:45:33,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:33,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:45:33,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:33,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:45:33,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:45:33,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:45:33,339 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@ecb4bf7 [2019-12-07 15:45:33,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 15:45:33,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-12-07 15:45:33,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448150668] [2019-12-07 15:45:33,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:45:33,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:45:33,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:45:33,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:45:33,340 INFO L87 Difference]: Start difference. First operand 8461 states and 13017 transitions. Second operand 8 states. [2019-12-07 15:45:33,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 15:45:33,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:45:33,542 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@ecb4bf7 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 15:45:33,551 INFO L168 Benchmark]: Toolchain (without parser) took 42938.98 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 942.5 MB in the beginning and 1.3 GB in the end (delta: -347.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 15:45:33,551 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:45:33,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -125.7 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-12-07 15:45:33,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:45:33,553 INFO L168 Benchmark]: Boogie Preprocessor took 53.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:45:33,554 INFO L168 Benchmark]: RCFGBuilder took 700.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.2 MB in the end (delta: 98.2 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:45:33,555 INFO L168 Benchmark]: TraceAbstraction took 41721.54 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 959.2 MB in the beginning and 1.3 GB in the end (delta: -330.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 15:45:33,559 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -125.7 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 700.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.2 MB in the end (delta: 98.2 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41721.54 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 959.2 MB in the beginning and 1.3 GB in the end (delta: -330.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@ecb4bf7 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@ecb4bf7: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 15:45:34,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:45:34,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:45:34,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:45:34,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:45:34,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:45:34,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:45:34,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:45:34,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:45:34,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:45:34,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:45:34,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:45:34,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:45:34,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:45:34,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:45:34,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:45:34,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:45:34,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:45:34,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:45:34,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:45:34,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:45:34,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:45:34,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:45:34,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:45:34,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:45:34,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:45:34,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:45:34,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:45:34,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:45:34,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:45:34,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:45:34,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:45:34,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:45:34,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:45:34,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:45:34,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:45:34,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:45:34,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:45:34,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:45:34,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:45:34,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:45:34,955 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 15:45:34,965 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:45:34,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:45:34,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:45:34,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:45:34,966 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:45:34,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:45:34,966 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:45:34,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:45:34,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:45:34,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:45:34,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:45:34,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:45:34,967 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 15:45:34,967 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 15:45:34,967 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:45:34,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:45:34,968 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:45:34,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:45:34,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:45:34,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:45:34,968 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:45:34,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:45:34,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:45:34,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:45:34,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:45:34,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:45:34,969 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 15:45:34,969 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 15:45:34,969 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:45:34,969 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:45:34,970 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:45:34,970 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_09a12c8f-d080-451c-be84-40b870252120/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 -> e83cf3c2949f89871817218ec6b0742e2a7cf269 [2019-12-07 15:45:35,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:45:35,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:45:35,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:45:35,158 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:45:35,159 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:45:35,160 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c [2019-12-07 15:45:35,206 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/data/32c60c2a7/ec8c12bb36c24ee495ed962e1e82656a/FLAGb3e5cfcf2 [2019-12-07 15:45:35,781 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:45:35,782 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-2.c [2019-12-07 15:45:35,797 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/data/32c60c2a7/ec8c12bb36c24ee495ed962e1e82656a/FLAGb3e5cfcf2 [2019-12-07 15:45:36,211 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/data/32c60c2a7/ec8c12bb36c24ee495ed962e1e82656a [2019-12-07 15:45:36,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:45:36,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:45:36,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:45:36,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:45:36,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:45:36,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:45:36" (1/1) ... [2019-12-07 15:45:36,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a94c128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:45:36, skipping insertion in model container [2019-12-07 15:45:36,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:45:36" (1/1) ... [2019-12-07 15:45:36,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:45:36,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:45:36,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:45:36,560 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:45:36,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:45:36,670 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:45:36,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:45:36 WrapperNode [2019-12-07 15:45:36,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:45:36,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:45:36,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:45:36,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:45:36,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:45:36" (1/1) ... [2019-12-07 15:45:36,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:45:36" (1/1) ... [2019-12-07 15:45:36,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:45:36,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:45:36,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:45:36,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:45:36,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:45:36" (1/1) ... [2019-12-07 15:45:36,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:45:36" (1/1) ... [2019-12-07 15:45:36,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:45:36" (1/1) ... [2019-12-07 15:45:36,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:45:36" (1/1) ... [2019-12-07 15:45:36,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:45:36" (1/1) ... [2019-12-07 15:45:36,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:45:36" (1/1) ... [2019-12-07 15:45:36,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:45:36" (1/1) ... [2019-12-07 15:45:36,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:45:36,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:45:36,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:45:36,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:45:36,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:45:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:45:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 15:45:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:45:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 15:45:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 15:45:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 15:45:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:45:36,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:45:36,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 15:45:36,939 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 15:45:39,143 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 15:45:39,143 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 15:45:39,144 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:45:39,144 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 15:45:39,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:45:39 BoogieIcfgContainer [2019-12-07 15:45:39,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:45:39,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:45:39,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:45:39,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:45:39,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:45:36" (1/3) ... [2019-12-07 15:45:39,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcfe9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:45:39, skipping insertion in model container [2019-12-07 15:45:39,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:45:36" (2/3) ... [2019-12-07 15:45:39,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcfe9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:45:39, skipping insertion in model container [2019-12-07 15:45:39,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:45:39" (3/3) ... [2019-12-07 15:45:39,150 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-2.c [2019-12-07 15:45:39,157 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:45:39,162 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 15:45:39,169 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 15:45:39,186 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:45:39,186 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:45:39,187 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:45:39,187 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:45:39,187 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:45:39,187 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:45:39,187 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:45:39,187 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:45:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-12-07 15:45:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 15:45:39,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:39,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:39,208 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:39,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:39,212 INFO L82 PathProgramCache]: Analyzing trace with hash 557483936, now seen corresponding path program 1 times [2019-12-07 15:45:39,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:45:39,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841113277] [2019-12-07 15:45:39,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 15:45:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:39,345 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:45:39,352 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:45:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:45:39,383 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:45:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:45:39,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841113277] [2019-12-07 15:45:39,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:39,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 15:45:39,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593450039] [2019-12-07 15:45:39,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:39,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:45:39,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:39,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:39,428 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 4 states. [2019-12-07 15:45:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:39,587 INFO L93 Difference]: Finished difference Result 572 states and 981 transitions. [2019-12-07 15:45:39,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:39,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 15:45:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:39,601 INFO L225 Difference]: With dead ends: 572 [2019-12-07 15:45:39,601 INFO L226 Difference]: Without dead ends: 390 [2019-12-07 15:45:39,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-12-07 15:45:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2019-12-07 15:45:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-12-07 15:45:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 596 transitions. [2019-12-07 15:45:39,660 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 596 transitions. Word has length 42 [2019-12-07 15:45:39,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:39,660 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 596 transitions. [2019-12-07 15:45:39,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:39,660 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 596 transitions. [2019-12-07 15:45:39,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 15:45:39,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:39,666 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:39,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 15:45:39,867 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:39,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:39,869 INFO L82 PathProgramCache]: Analyzing trace with hash -2090002076, now seen corresponding path program 1 times [2019-12-07 15:45:39,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:45:39,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943212076] [2019-12-07 15:45:39,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 15:45:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:40,132 INFO L264 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:45:40,137 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:45:40,160 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:45:40,160 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:45:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:45:40,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943212076] [2019-12-07 15:45:40,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:40,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 15:45:40,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802151105] [2019-12-07 15:45:40,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:40,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:45:40,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:40,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:40,183 INFO L87 Difference]: Start difference. First operand 390 states and 596 transitions. Second operand 4 states. [2019-12-07 15:45:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:40,879 INFO L93 Difference]: Finished difference Result 895 states and 1386 transitions. [2019-12-07 15:45:40,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:40,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 15:45:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:40,883 INFO L225 Difference]: With dead ends: 895 [2019-12-07 15:45:40,883 INFO L226 Difference]: Without dead ends: 640 [2019-12-07 15:45:40,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-12-07 15:45:40,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-12-07 15:45:40,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-12-07 15:45:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 974 transitions. [2019-12-07 15:45:40,912 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 974 transitions. Word has length 102 [2019-12-07 15:45:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:40,913 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 974 transitions. [2019-12-07 15:45:40,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 974 transitions. [2019-12-07 15:45:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 15:45:40,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:40,916 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:41,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 15:45:41,117 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:41,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1625612872, now seen corresponding path program 1 times [2019-12-07 15:45:41,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:45:41,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089282391] [2019-12-07 15:45:41,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 15:45:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:41,287 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:45:41,293 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:45:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 15:45:41,317 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:45:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 15:45:41,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089282391] [2019-12-07 15:45:41,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:41,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 15:45:41,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512927079] [2019-12-07 15:45:41,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:41,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:45:41,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:41,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:41,347 INFO L87 Difference]: Start difference. First operand 640 states and 974 transitions. Second operand 4 states. [2019-12-07 15:45:41,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:41,933 INFO L93 Difference]: Finished difference Result 1398 states and 2145 transitions. [2019-12-07 15:45:41,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:41,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-12-07 15:45:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:41,937 INFO L225 Difference]: With dead ends: 1398 [2019-12-07 15:45:41,937 INFO L226 Difference]: Without dead ends: 893 [2019-12-07 15:45:41,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:41,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-07 15:45:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2019-12-07 15:45:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-12-07 15:45:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1355 transitions. [2019-12-07 15:45:41,962 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1355 transitions. Word has length 165 [2019-12-07 15:45:41,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:41,962 INFO L462 AbstractCegarLoop]: Abstraction has 893 states and 1355 transitions. [2019-12-07 15:45:41,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1355 transitions. [2019-12-07 15:45:41,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-12-07 15:45:41,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:41,965 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:42,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 15:45:42,166 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:42,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:42,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1436171483, now seen corresponding path program 1 times [2019-12-07 15:45:42,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:45:42,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240000465] [2019-12-07 15:45:42,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 15:45:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:42,429 INFO L264 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:45:42,434 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:45:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-07 15:45:42,469 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:45:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-07 15:45:42,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240000465] [2019-12-07 15:45:42,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:42,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 15:45:42,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289877247] [2019-12-07 15:45:42,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:42,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:45:42,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:42,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:42,519 INFO L87 Difference]: Start difference. First operand 893 states and 1355 transitions. Second operand 4 states. [2019-12-07 15:45:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:43,450 INFO L93 Difference]: Finished difference Result 1902 states and 2902 transitions. [2019-12-07 15:45:43,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:43,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-12-07 15:45:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:43,458 INFO L225 Difference]: With dead ends: 1902 [2019-12-07 15:45:43,458 INFO L226 Difference]: Without dead ends: 1144 [2019-12-07 15:45:43,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:43,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-12-07 15:45:43,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2019-12-07 15:45:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-12-07 15:45:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1731 transitions. [2019-12-07 15:45:43,511 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1731 transitions. Word has length 228 [2019-12-07 15:45:43,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:43,511 INFO L462 AbstractCegarLoop]: Abstraction has 1144 states and 1731 transitions. [2019-12-07 15:45:43,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1731 transitions. [2019-12-07 15:45:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-12-07 15:45:43,515 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:43,515 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:43,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 15:45:43,716 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:43,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:43,716 INFO L82 PathProgramCache]: Analyzing trace with hash 232931248, now seen corresponding path program 1 times [2019-12-07 15:45:43,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:45:43,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318608428] [2019-12-07 15:45:43,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 15:45:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:43,956 INFO L264 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:45:43,962 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:45:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-12-07 15:45:44,026 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:45:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-12-07 15:45:44,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318608428] [2019-12-07 15:45:44,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:44,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 15:45:44,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978904897] [2019-12-07 15:45:44,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:44,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:45:44,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:44,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:44,078 INFO L87 Difference]: Start difference. First operand 1144 states and 1731 transitions. Second operand 4 states. [2019-12-07 15:45:44,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:44,675 INFO L93 Difference]: Finished difference Result 2407 states and 3656 transitions. [2019-12-07 15:45:44,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:44,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 292 [2019-12-07 15:45:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:44,682 INFO L225 Difference]: With dead ends: 2407 [2019-12-07 15:45:44,682 INFO L226 Difference]: Without dead ends: 1398 [2019-12-07 15:45:44,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:44,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2019-12-07 15:45:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2019-12-07 15:45:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1398 states. [2019-12-07 15:45:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2109 transitions. [2019-12-07 15:45:44,715 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2109 transitions. Word has length 292 [2019-12-07 15:45:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:44,716 INFO L462 AbstractCegarLoop]: Abstraction has 1398 states and 2109 transitions. [2019-12-07 15:45:44,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2109 transitions. [2019-12-07 15:45:44,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-12-07 15:45:44,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:44,720 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:44,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 15:45:44,921 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:44,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:44,921 INFO L82 PathProgramCache]: Analyzing trace with hash 303911324, now seen corresponding path program 1 times [2019-12-07 15:45:44,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:45:44,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58863295] [2019-12-07 15:45:44,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 15:45:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:45,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:45:45,214 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:45:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-12-07 15:45:45,305 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:45:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-12-07 15:45:45,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58863295] [2019-12-07 15:45:45,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:45,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 15:45:45,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625009688] [2019-12-07 15:45:45,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:45:45,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:45:45,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:45:45,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:45,373 INFO L87 Difference]: Start difference. First operand 1398 states and 2109 transitions. Second operand 4 states. [2019-12-07 15:45:46,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:45:46,054 INFO L93 Difference]: Finished difference Result 2912 states and 4405 transitions. [2019-12-07 15:45:46,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:45:46,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 356 [2019-12-07 15:45:46,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:45:46,060 INFO L225 Difference]: With dead ends: 2912 [2019-12-07 15:45:46,060 INFO L226 Difference]: Without dead ends: 1649 [2019-12-07 15:45:46,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 708 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:45:46,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-12-07 15:45:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2019-12-07 15:45:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-12-07 15:45:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2481 transitions. [2019-12-07 15:45:46,098 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2481 transitions. Word has length 356 [2019-12-07 15:45:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:45:46,099 INFO L462 AbstractCegarLoop]: Abstraction has 1649 states and 2481 transitions. [2019-12-07 15:45:46,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:45:46,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2481 transitions. [2019-12-07 15:45:46,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-12-07 15:45:46,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:45:46,104 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:45:46,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 15:45:46,305 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:45:46,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:45:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash 803618532, now seen corresponding path program 1 times [2019-12-07 15:45:46,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:45:46,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600906415] [2019-12-07 15:45:46,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 15:45:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:45:46,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 15:45:46,914 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:45:46,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 15:45:46,943 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:46,947 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:46,947 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:45:46,947 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 15:45:46,971 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 15:45:46,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 15:45:46,971 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:46,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:46,980 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:45:46,980 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 15:45:46,997 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 15:45:46,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 15:45:46,998 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:45:46,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:45:46,999 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:45:46,999 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 15:45:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2019-12-07 15:45:47,111 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:45:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2019-12-07 15:45:47,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600906415] [2019-12-07 15:45:47,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:45:47,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-12-07 15:45:47,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124641750] [2019-12-07 15:45:47,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:45:47,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:45:47,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:45:47,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:45:47,211 INFO L87 Difference]: Start difference. First operand 1649 states and 2481 transitions. Second operand 7 states. [2019-12-07 15:46:02,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:46:02,434 INFO L93 Difference]: Finished difference Result 6244 states and 9432 transitions. [2019-12-07 15:46:02,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:46:02,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 390 [2019-12-07 15:46:02,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:46:02,451 INFO L225 Difference]: With dead ends: 6244 [2019-12-07 15:46:02,452 INFO L226 Difference]: Without dead ends: 4603 [2019-12-07 15:46:02,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 772 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:46:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4603 states. [2019-12-07 15:46:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4603 to 1973. [2019-12-07 15:46:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1973 states. [2019-12-07 15:46:02,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 3039 transitions. [2019-12-07 15:46:02,538 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 3039 transitions. Word has length 390 [2019-12-07 15:46:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:46:02,538 INFO L462 AbstractCegarLoop]: Abstraction has 1973 states and 3039 transitions. [2019-12-07 15:46:02,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:46:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 3039 transitions. [2019-12-07 15:46:02,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-12-07 15:46:02,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:46:02,542 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:46:02,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 15:46:02,742 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:46:02,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:46:02,743 INFO L82 PathProgramCache]: Analyzing trace with hash 51951590, now seen corresponding path program 1 times [2019-12-07 15:46:02,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:46:02,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816391477] [2019-12-07 15:46:02,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 15:46:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:46:03,287 INFO L264 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 15:46:03,291 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:46:03,300 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 15:46:03,300 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:03,302 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:03,303 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:46:03,303 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 15:46:03,324 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 15:46:03,324 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 15:46:03,325 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:03,335 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:03,335 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:46:03,335 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 15:46:03,356 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 15:46:03,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2019-12-07 15:46:03,357 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:03,358 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:03,358 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:46:03,358 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-12-07 15:46:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 717 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2019-12-07 15:46:03,466 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:46:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 717 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2019-12-07 15:46:03,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816391477] [2019-12-07 15:46:03,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:46:03,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-12-07 15:46:03,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266391915] [2019-12-07 15:46:03,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:46:03,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 15:46:03,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:46:03,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:46:03,581 INFO L87 Difference]: Start difference. First operand 1973 states and 3039 transitions. Second operand 7 states. [2019-12-07 15:46:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:46:18,742 INFO L93 Difference]: Finished difference Result 8291 states and 12725 transitions. [2019-12-07 15:46:18,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:46:18,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 390 [2019-12-07 15:46:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:46:18,772 INFO L225 Difference]: With dead ends: 8291 [2019-12-07 15:46:18,772 INFO L226 Difference]: Without dead ends: 6326 [2019-12-07 15:46:18,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 772 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:46:18,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6326 states. [2019-12-07 15:46:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6326 to 2805. [2019-12-07 15:46:18,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2805 states. [2019-12-07 15:46:18,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 4541 transitions. [2019-12-07 15:46:18,859 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 4541 transitions. Word has length 390 [2019-12-07 15:46:18,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:46:18,860 INFO L462 AbstractCegarLoop]: Abstraction has 2805 states and 4541 transitions. [2019-12-07 15:46:18,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:46:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 4541 transitions. [2019-12-07 15:46:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-12-07 15:46:18,865 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:46:18,866 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:46:19,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 15:46:19,067 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:46:19,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:46:19,068 INFO L82 PathProgramCache]: Analyzing trace with hash 998989476, now seen corresponding path program 1 times [2019-12-07 15:46:19,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 15:46:19,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017392928] [2019-12-07 15:46:19,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 15:46:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:46:20,239 INFO L264 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 15:46:20,249 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:46:20,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 15:46:20,323 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,540 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 15:46:20,540 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,541 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_228|], 2=[|v_#memory_$Pointer$.base_223|, |v_#memory_$Pointer$.base_222|]} [2019-12-07 15:46:20,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,588 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 15:46:20,589 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,672 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 15:46:20,691 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,723 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 15:46:20,732 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,751 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,751 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,752 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 15:46:20,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 15:46:20,763 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,767 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,767 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,768 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 15:46:20,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 15:46:20,772 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,777 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,777 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,777 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 15:46:20,782 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:46:20,801 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,805 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 15:46:20,805 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,813 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,813 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,813 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 15:46:20,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,818 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 15:46:20,819 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,823 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,823 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,823 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 15:46:20,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 15:46:20,827 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,832 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,832 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 15:46:20,836 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:46:20,854 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 15:46:20,860 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,868 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,869 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 15:46:20,871 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_223|], 2=[|v_#memory_$Pointer$.base_235|]} [2019-12-07 15:46:20,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 15:46:20,874 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:46:20,888 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,921 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 15:46:20,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:46:20,924 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,938 INFO L614 ElimStorePlain]: treesize reduction 40, result has 25.9 percent of original size [2019-12-07 15:46:20,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,938 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 15:46:20,942 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:46:20,964 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:20,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 15:46:20,968 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,975 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:20,976 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:46:20,976 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 15:46:20,979 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_224|], 2=[|v_#memory_$Pointer$.base_237|]} [2019-12-07 15:46:20,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 15:46:20,982 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:46:20,996 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:21,025 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:21,026 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 15:46:21,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:46:21,027 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:21,039 INFO L614 ElimStorePlain]: treesize reduction 40, result has 25.9 percent of original size [2019-12-07 15:46:21,040 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:46:21,040 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 15:46:21,042 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_246|, |v_#memory_$Pointer$.offset_222|], 2=[|v_#memory_$Pointer$.base_227|, |v_#memory_$Pointer$.base_238|]} [2019-12-07 15:46:21,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:21,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:21,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-12-07 15:46:21,049 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:21,072 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:21,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-12-07 15:46:21,077 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:46:21,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:21,102 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:46:21,119 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:21,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2019-12-07 15:46:21,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:21,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:46:21,127 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-12-07 15:46:21,128 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:46:21,133 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:21,134 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:46:21,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:21,148 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:46:21,148 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:142, output treesize:35 [2019-12-07 15:46:21,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-12-07 15:46:21,201 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:46:21,204 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:21,205 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:46:21,205 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-12-07 15:46:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 708 proven. 91 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2019-12-07 15:46:21,481 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:46:21,500 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_int|, |v_#memory_$Pointer$.offset_222|], 2=[|v_#memory_$Pointer$.base_227|]} [2019-12-07 15:46:29,621 WARN L192 SmtUtils]: Spent 8.12 s on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 15:46:29,621 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:29,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 106 [2019-12-07 15:46:29,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:46:29,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:46:29,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:46:29,644 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:46:29,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 106 [2019-12-07 15:46:29,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:46:29,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:46:29,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:46:29,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:46:29,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:46:29,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:46:29,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:46:29,649 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 15:46:29,650 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_31], 1=[v_arrayElimCell_32]} [2019-12-07 15:46:29,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017392928] [2019-12-07 15:46:29,654 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@36d08e9e [2019-12-07 15:46:29,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1820131578] [2019-12-07 15:46:29,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/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-12-07 15:46:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:46:40,030 INFO L264 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 15:46:40,031 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@36d08e9e [2019-12-07 15:46:40,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991760114] [2019-12-07 15:46:40,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_09a12c8f-d080-451c-be84-40b870252120/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:46:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:46:40,540 INFO L264 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 62 conjunts are in the unsatisfiable core [2019-12-07 15:46:40,540 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@36d08e9e [2019-12-07 15:46:40,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:46:40,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 15:46:40,541 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 15:46:40,541 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:46:41,146 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:46:41,218 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 15:46:41,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:46:41 BoogieIcfgContainer [2019-12-07 15:46:41,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:46:41,219 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:46:41,219 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:46:41,219 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:46:41,220 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:45:39" (3/4) ... [2019-12-07 15:46:41,222 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 15:46:41,222 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:46:41,223 INFO L168 Benchmark]: Toolchain (without parser) took 65009.69 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 466.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -136.2 MB). Peak memory consumption was 329.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:46:41,224 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:46:41,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 456.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:46:41,224 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.42 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:46:41,224 INFO L168 Benchmark]: Boogie Preprocessor took 52.91 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:46:41,225 INFO L168 Benchmark]: RCFGBuilder took 2366.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.2 MB in the end (delta: 96.6 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:46:41,225 INFO L168 Benchmark]: TraceAbstraction took 62072.67 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 988.2 MB in the beginning and 1.1 GB in the end (delta: -95.0 MB). Peak memory consumption was 240.0 MB. Max. memory is 11.5 GB. [2019-12-07 15:46:41,225 INFO L168 Benchmark]: Witness Printer took 3.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:46:41,226 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 456.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.42 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.91 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2366.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 988.2 MB in the end (delta: 96.6 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 62072.67 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.0 MB). Free memory was 988.2 MB in the beginning and 1.1 GB in the end (delta: -95.0 MB). Peak memory consumption was 240.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1742]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) [L1130] EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 [L1701] EXPR s->s3 [L1701] EXPR (s->s3)->tmp.reuse_message [L1701] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1730] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 [L1347] COND FALSE !(ret <= 0) [L1352] s->hit [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 [L1357] s->init_num = 0 [L1701] EXPR s->s3 [L1701] EXPR (s->s3)->tmp.reuse_message [L1701] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1730] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1361] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1364] ret = __VERIFIER_nondet_int() [L1365] COND TRUE blastFlag == 2 [L1366] blastFlag = 3 [L1370] COND FALSE !(ret <= 0) [L1376] s->state = 8528 [L1377] s->init_num = 0 [L1701] EXPR s->s3 [L1701] EXPR (s->s3)->tmp.reuse_message [L1701] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1730] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options [L1382] COND TRUE s->options & 2097152UL [L1383] EXPR s->s3 [L1383] (s->s3)->tmp.use_rsa_tmp = 1 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp [L1387] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1405] ret = __VERIFIER_nondet_int() [L1406] COND TRUE blastFlag == 3 [L1407] blastFlag = 4 [L1411] COND FALSE !(ret <= 0) [L1428] s->state = 8544 [L1429] s->init_num = 0 [L1701] EXPR s->s3 [L1701] EXPR (s->s3)->tmp.reuse_message [L1701] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1730] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND TRUE blastFlag == 4 [L1457] blastFlag = 5 [L1461] COND FALSE !(ret <= 0) [L1466] s->state = 8448 [L1467] EXPR s->s3 [L1467] (s->s3)->tmp.next_state = 8576 [L1468] s->init_num = 0 [L1701] EXPR s->s3 [L1701] EXPR (s->s3)->tmp.reuse_message [L1701] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1730] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND TRUE s->state == 8576 [L1507] ret = __VERIFIER_nondet_int() [L1508] COND TRUE blastFlag == 5 [L1509] blastFlag = 6 [L1513] COND FALSE !(ret <= 0) [L1518] COND FALSE !(ret == 2) [L1521] ret = __VERIFIER_nondet_int() [L1522] COND TRUE blastFlag == 6 [L1523] blastFlag = 7 [L1527] COND FALSE !(ret <= 0) [L1532] s->init_num = 0 [L1533] s->state = 8592 [L1701] EXPR s->s3 [L1701] EXPR (s->s3)->tmp.reuse_message [L1701] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1730] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND TRUE s->state == 8592 [L1538] ret = __VERIFIER_nondet_int() [L1539] COND TRUE blastFlag == 7 [L1540] blastFlag = 8 [L1544] COND FALSE !(ret <= 0) [L1549] s->state = 8608 [L1550] s->init_num = 0 [L1701] EXPR s->s3 [L1701] EXPR (s->s3)->tmp.reuse_message [L1701] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1730] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND TRUE s->state == 8608 [L1554] ret = __VERIFIER_nondet_int() [L1555] COND TRUE blastFlag == 8 [L1556] blastFlag = 9 [L1560] COND FALSE !(ret <= 0) [L1565] s->state = 8640 [L1566] s->init_num = 0 [L1701] EXPR s->s3 [L1701] EXPR (s->s3)->tmp.reuse_message [L1701] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1730] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND TRUE blastFlag == 9 [L1572] blastFlag = 10 [L1580] COND FALSE !(ret <= 0) [L1585] s->hit [L1585] COND FALSE !(s->hit) [L1588] s->state = 8656 [L1590] s->init_num = 0 [L1701] EXPR s->s3 [L1701] EXPR (s->s3)->tmp.reuse_message [L1701] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1730] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND TRUE s->state == 8656 [L1594] EXPR s->session [L1594] EXPR s->s3 [L1594] EXPR (s->s3)->tmp.new_cipher [L1594] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1595] COND FALSE !(! tmp___9) [L1601] ret = __VERIFIER_nondet_int() [L1602] COND TRUE blastFlag == 10 [L1603] blastFlag = 11 [L1607] COND FALSE !(ret <= 0) [L1612] s->state = 8672 [L1613] s->init_num = 0 [L1614] COND FALSE !(! tmp___10) [L1701] EXPR s->s3 [L1701] EXPR (s->s3)->tmp.reuse_message [L1701] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1730] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state [L1235] COND TRUE s->state == 8672 [L1623] ret = __VERIFIER_nondet_int() [L1624] COND TRUE blastFlag == 11 [L1625] blastFlag = 12 [L1629] COND FALSE !(ret <= 0) [L1634] s->state = 8448 [L1635] s->hit [L1635] COND TRUE s->hit [L1636] EXPR s->s3 [L1636] (s->s3)->tmp.next_state = 8640 [L1640] s->init_num = 0 [L1701] EXPR s->s3 [L1701] EXPR (s->s3)->tmp.reuse_message [L1701] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1730] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) [L1574] COND TRUE blastFlag == 12 [L1742] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 151 locations, 1 error locations. Result: UNKNOWN, OverallTime: 61.9s, OverallIterations: 9, TraceHistogramMax: 12, AutomataDifference: 34.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2524 SDtfs, 2575 SDslu, 3851 SDs, 0 SdLazy, 2321 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3919 GetRequests, 3890 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2805occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 6151 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1965 NumberOfCodeBlocks, 1965 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 3914 ConstructedInterpolants, 0 QuantifiedInterpolants, 2169670 SizeOfPredicates, 7 NumberOfNonLiveVariables, 4383 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 11056/11056 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...