./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/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 221d8ee995a69c986b355f515c858471b19e54a2 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/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 221d8ee995a69c986b355f515c858471b19e54a2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 10:20:03,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:20:03,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:20:03,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:20:03,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:20:03,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:20:03,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:20:03,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:20:03,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:20:03,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:20:03,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:20:03,234 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:20:03,235 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:20:03,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:20:03,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:20:03,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:20:03,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:20:03,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:20:03,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:20:03,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:20:03,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:20:03,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:20:03,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:20:03,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:20:03,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:20:03,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:20:03,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:20:03,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:20:03,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:20:03,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:20:03,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:20:03,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:20:03,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:20:03,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:20:03,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:20:03,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:20:03,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:20:03,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:20:03,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:20:03,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:20:03,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:20:03,257 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 10:20:03,269 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:20:03,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:20:03,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:20:03,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:20:03,270 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:20:03,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:20:03,271 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:20:03,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:20:03,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:20:03,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:20:03,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:20:03,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:20:03,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:20:03,272 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:20:03,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:20:03,273 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:20:03,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:20:03,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:20:03,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:20:03,274 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:20:03,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:20:03,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:20:03,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:20:03,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:20:03,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:20:03,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:20:03,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:20:03,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:20:03,275 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_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/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 -> 221d8ee995a69c986b355f515c858471b19e54a2 [2019-11-20 10:20:03,425 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:20:03,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:20:03,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:20:03,439 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:20:03,439 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:20:03,440 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-11-20 10:20:03,488 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/data/669c70788/658c6830b3574151b7e37f98fc0c28e7/FLAGce5947f3e [2019-11-20 10:20:04,055 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:20:04,055 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-11-20 10:20:04,077 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/data/669c70788/658c6830b3574151b7e37f98fc0c28e7/FLAGce5947f3e [2019-11-20 10:20:04,459 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/data/669c70788/658c6830b3574151b7e37f98fc0c28e7 [2019-11-20 10:20:04,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:20:04,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:20:04,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:20:04,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:20:04,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:20:04,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:20:04" (1/1) ... [2019-11-20 10:20:04,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fceab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:04, skipping insertion in model container [2019-11-20 10:20:04,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:20:04" (1/1) ... [2019-11-20 10:20:04,475 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:20:04,538 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:20:05,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:20:05,049 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:20:05,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:20:05,213 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:20:05,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:05 WrapperNode [2019-11-20 10:20:05,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:20:05,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:20:05,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:20:05,215 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:20:05,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:05" (1/1) ... [2019-11-20 10:20:05,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:05" (1/1) ... [2019-11-20 10:20:05,317 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:20:05,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:20:05,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:20:05,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:20:05,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:05" (1/1) ... [2019-11-20 10:20:05,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:05" (1/1) ... [2019-11-20 10:20:05,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:05" (1/1) ... [2019-11-20 10:20:05,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:05" (1/1) ... [2019-11-20 10:20:05,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:05" (1/1) ... [2019-11-20 10:20:05,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:05" (1/1) ... [2019-11-20 10:20:05,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:05" (1/1) ... [2019-11-20 10:20:05,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:20:05,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:20:05,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:20:05,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:20:05,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:20:05,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 10:20:05,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:20:05,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 10:20:05,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 10:20:05,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 10:20:05,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 10:20:05,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:20:05,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:20:05,640 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 10:20:06,443 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 10:20:06,443 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 10:20:06,444 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:20:06,445 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:20:06,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:20:06 BoogieIcfgContainer [2019-11-20 10:20:06,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:20:06,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:20:06,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:20:06,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:20:06,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:20:04" (1/3) ... [2019-11-20 10:20:06,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36dac30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:20:06, skipping insertion in model container [2019-11-20 10:20:06,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:20:05" (2/3) ... [2019-11-20 10:20:06,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36dac30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:20:06, skipping insertion in model container [2019-11-20 10:20:06,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:20:06" (3/3) ... [2019-11-20 10:20:06,455 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-1.c [2019-11-20 10:20:06,465 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:20:06,475 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:20:06,485 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:20:06,511 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:20:06,511 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:20:06,512 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:20:06,512 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:20:06,512 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:20:06,512 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:20:06,512 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:20:06,512 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:20:06,540 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-20 10:20:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 10:20:06,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:06,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:06,554 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:06,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:06,560 INFO L82 PathProgramCache]: Analyzing trace with hash 62050873, now seen corresponding path program 1 times [2019-11-20 10:20:06,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:06,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139595244] [2019-11-20 10:20:06,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:06,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139595244] [2019-11-20 10:20:06,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:06,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:06,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059537136] [2019-11-20 10:20:06,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:06,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:06,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:06,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:06,911 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 4 states. [2019-11-20 10:20:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:07,355 INFO L93 Difference]: Finished difference Result 329 states and 559 transitions. [2019-11-20 10:20:07,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:07,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-20 10:20:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:07,379 INFO L225 Difference]: With dead ends: 329 [2019-11-20 10:20:07,379 INFO L226 Difference]: Without dead ends: 166 [2019-11-20 10:20:07,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:07,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-20 10:20:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-11-20 10:20:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 10:20:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 232 transitions. [2019-11-20 10:20:07,453 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 232 transitions. Word has length 43 [2019-11-20 10:20:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:07,454 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 232 transitions. [2019-11-20 10:20:07,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 232 transitions. [2019-11-20 10:20:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-20 10:20:07,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:07,463 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:07,463 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:07,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:07,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1905377872, now seen corresponding path program 1 times [2019-11-20 10:20:07,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:07,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676009947] [2019-11-20 10:20:07,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:07,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676009947] [2019-11-20 10:20:07,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:07,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:07,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609701280] [2019-11-20 10:20:07,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:07,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:07,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:07,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:07,602 INFO L87 Difference]: Start difference. First operand 149 states and 232 transitions. Second operand 4 states. [2019-11-20 10:20:07,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:07,956 INFO L93 Difference]: Finished difference Result 296 states and 455 transitions. [2019-11-20 10:20:07,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:07,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-20 10:20:07,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:07,958 INFO L225 Difference]: With dead ends: 296 [2019-11-20 10:20:07,958 INFO L226 Difference]: Without dead ends: 166 [2019-11-20 10:20:07,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-20 10:20:07,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 149. [2019-11-20 10:20:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 10:20:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 231 transitions. [2019-11-20 10:20:07,982 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 231 transitions. Word has length 56 [2019-11-20 10:20:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:07,983 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 231 transitions. [2019-11-20 10:20:07,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 231 transitions. [2019-11-20 10:20:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 10:20:07,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:07,989 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:07,990 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:07,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:07,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1255882526, now seen corresponding path program 1 times [2019-11-20 10:20:07,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:07,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502091044] [2019-11-20 10:20:07,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:08,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:08,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502091044] [2019-11-20 10:20:08,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:08,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:08,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984039846] [2019-11-20 10:20:08,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:08,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:08,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:08,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:08,171 INFO L87 Difference]: Start difference. First operand 149 states and 231 transitions. Second operand 4 states. [2019-11-20 10:20:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:08,498 INFO L93 Difference]: Finished difference Result 295 states and 453 transitions. [2019-11-20 10:20:08,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:08,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-20 10:20:08,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:08,501 INFO L225 Difference]: With dead ends: 295 [2019-11-20 10:20:08,501 INFO L226 Difference]: Without dead ends: 165 [2019-11-20 10:20:08,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-20 10:20:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2019-11-20 10:20:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 10:20:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 230 transitions. [2019-11-20 10:20:08,514 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 230 transitions. Word has length 57 [2019-11-20 10:20:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:08,514 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 230 transitions. [2019-11-20 10:20:08,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:08,515 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 230 transitions. [2019-11-20 10:20:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 10:20:08,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:08,516 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:08,516 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:08,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:08,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2070651149, now seen corresponding path program 1 times [2019-11-20 10:20:08,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:08,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480395953] [2019-11-20 10:20:08,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:08,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480395953] [2019-11-20 10:20:08,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:08,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:08,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975495392] [2019-11-20 10:20:08,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:08,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:08,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:08,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:08,633 INFO L87 Difference]: Start difference. First operand 149 states and 230 transitions. Second operand 4 states. [2019-11-20 10:20:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:08,908 INFO L93 Difference]: Finished difference Result 293 states and 450 transitions. [2019-11-20 10:20:08,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:08,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-20 10:20:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:08,911 INFO L225 Difference]: With dead ends: 293 [2019-11-20 10:20:08,911 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 10:20:08,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:08,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 10:20:08,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2019-11-20 10:20:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 10:20:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 229 transitions. [2019-11-20 10:20:08,931 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 229 transitions. Word has length 57 [2019-11-20 10:20:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:08,932 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 229 transitions. [2019-11-20 10:20:08,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:08,933 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 229 transitions. [2019-11-20 10:20:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 10:20:08,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:08,934 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:08,935 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:08,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:08,935 INFO L82 PathProgramCache]: Analyzing trace with hash -221095859, now seen corresponding path program 1 times [2019-11-20 10:20:08,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:08,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778817421] [2019-11-20 10:20:08,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:09,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778817421] [2019-11-20 10:20:09,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:09,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:09,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002148458] [2019-11-20 10:20:09,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:09,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:09,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:09,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:09,035 INFO L87 Difference]: Start difference. First operand 149 states and 229 transitions. Second operand 4 states. [2019-11-20 10:20:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:09,310 INFO L93 Difference]: Finished difference Result 292 states and 448 transitions. [2019-11-20 10:20:09,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:09,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-20 10:20:09,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:09,312 INFO L225 Difference]: With dead ends: 292 [2019-11-20 10:20:09,313 INFO L226 Difference]: Without dead ends: 162 [2019-11-20 10:20:09,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-11-20 10:20:09,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-20 10:20:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-20 10:20:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 10:20:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 228 transitions. [2019-11-20 10:20:09,320 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 228 transitions. Word has length 57 [2019-11-20 10:20:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:09,321 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 228 transitions. [2019-11-20 10:20:09,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 228 transitions. [2019-11-20 10:20:09,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-20 10:20:09,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:09,322 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:09,329 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:09,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:09,329 INFO L82 PathProgramCache]: Analyzing trace with hash 631020918, now seen corresponding path program 1 times [2019-11-20 10:20:09,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:09,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136375009] [2019-11-20 10:20:09,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:09,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136375009] [2019-11-20 10:20:09,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:09,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:09,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767872655] [2019-11-20 10:20:09,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:09,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:09,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:09,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:09,414 INFO L87 Difference]: Start difference. First operand 149 states and 228 transitions. Second operand 4 states. [2019-11-20 10:20:09,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:09,666 INFO L93 Difference]: Finished difference Result 292 states and 447 transitions. [2019-11-20 10:20:09,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:09,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-20 10:20:09,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:09,668 INFO L225 Difference]: With dead ends: 292 [2019-11-20 10:20:09,668 INFO L226 Difference]: Without dead ends: 162 [2019-11-20 10:20:09,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-20 10:20:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-20 10:20:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 10:20:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 227 transitions. [2019-11-20 10:20:09,675 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 227 transitions. Word has length 57 [2019-11-20 10:20:09,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:09,676 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 227 transitions. [2019-11-20 10:20:09,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 227 transitions. [2019-11-20 10:20:09,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 10:20:09,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:09,677 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:09,677 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:09,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:09,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1772080409, now seen corresponding path program 1 times [2019-11-20 10:20:09,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:09,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181026215] [2019-11-20 10:20:09,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:09,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181026215] [2019-11-20 10:20:09,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:09,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:09,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105320218] [2019-11-20 10:20:09,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:09,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:09,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:09,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:09,741 INFO L87 Difference]: Start difference. First operand 149 states and 227 transitions. Second operand 4 states. [2019-11-20 10:20:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:09,958 INFO L93 Difference]: Finished difference Result 292 states and 446 transitions. [2019-11-20 10:20:09,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:09,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 10:20:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:09,960 INFO L225 Difference]: With dead ends: 292 [2019-11-20 10:20:09,960 INFO L226 Difference]: Without dead ends: 162 [2019-11-20 10:20:09,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:09,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-20 10:20:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-20 10:20:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 10:20:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 226 transitions. [2019-11-20 10:20:09,966 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 226 transitions. Word has length 58 [2019-11-20 10:20:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:09,966 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 226 transitions. [2019-11-20 10:20:09,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 226 transitions. [2019-11-20 10:20:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-20 10:20:09,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:09,967 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:09,968 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:09,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:09,968 INFO L82 PathProgramCache]: Analyzing trace with hash -245018341, now seen corresponding path program 1 times [2019-11-20 10:20:09,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:09,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015359190] [2019-11-20 10:20:09,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:10,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:10,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015359190] [2019-11-20 10:20:10,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:10,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:10,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481615181] [2019-11-20 10:20:10,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:10,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:10,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:10,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:10,024 INFO L87 Difference]: Start difference. First operand 149 states and 226 transitions. Second operand 4 states. [2019-11-20 10:20:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:10,303 INFO L93 Difference]: Finished difference Result 292 states and 445 transitions. [2019-11-20 10:20:10,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:10,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-20 10:20:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:10,304 INFO L225 Difference]: With dead ends: 292 [2019-11-20 10:20:10,304 INFO L226 Difference]: Without dead ends: 162 [2019-11-20 10:20:10,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-20 10:20:10,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2019-11-20 10:20:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 10:20:10,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 225 transitions. [2019-11-20 10:20:10,309 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 225 transitions. Word has length 59 [2019-11-20 10:20:10,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:10,310 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 225 transitions. [2019-11-20 10:20:10,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:10,310 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 225 transitions. [2019-11-20 10:20:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 10:20:10,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:10,311 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:10,311 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:10,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:10,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1380774754, now seen corresponding path program 1 times [2019-11-20 10:20:10,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:10,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673231563] [2019-11-20 10:20:10,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:10,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673231563] [2019-11-20 10:20:10,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:10,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:10,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805519539] [2019-11-20 10:20:10,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:10,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:10,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:10,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:10,366 INFO L87 Difference]: Start difference. First operand 149 states and 225 transitions. Second operand 4 states. [2019-11-20 10:20:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:10,610 INFO L93 Difference]: Finished difference Result 282 states and 431 transitions. [2019-11-20 10:20:10,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:10,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-20 10:20:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:10,612 INFO L225 Difference]: With dead ends: 282 [2019-11-20 10:20:10,612 INFO L226 Difference]: Without dead ends: 152 [2019-11-20 10:20:10,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:10,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-20 10:20:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2019-11-20 10:20:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-20 10:20:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2019-11-20 10:20:10,617 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 60 [2019-11-20 10:20:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:10,617 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2019-11-20 10:20:10,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2019-11-20 10:20:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 10:20:10,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:10,618 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:10,618 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:10,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1992648186, now seen corresponding path program 1 times [2019-11-20 10:20:10,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:10,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161115471] [2019-11-20 10:20:10,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:10,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161115471] [2019-11-20 10:20:10,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:10,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:10,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497753107] [2019-11-20 10:20:10,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:10,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:10,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:10,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:10,673 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand 4 states. [2019-11-20 10:20:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:10,992 INFO L93 Difference]: Finished difference Result 322 states and 492 transitions. [2019-11-20 10:20:10,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:10,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-20 10:20:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:10,995 INFO L225 Difference]: With dead ends: 322 [2019-11-20 10:20:10,995 INFO L226 Difference]: Without dead ends: 192 [2019-11-20 10:20:10,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-11-20 10:20:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-20 10:20:11,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2019-11-20 10:20:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 10:20:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 262 transitions. [2019-11-20 10:20:11,009 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 262 transitions. Word has length 60 [2019-11-20 10:20:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:11,010 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 262 transitions. [2019-11-20 10:20:11,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 262 transitions. [2019-11-20 10:20:11,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 10:20:11,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:11,011 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:11,011 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:11,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:11,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1514156125, now seen corresponding path program 1 times [2019-11-20 10:20:11,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:11,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205601540] [2019-11-20 10:20:11,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:11,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205601540] [2019-11-20 10:20:11,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:11,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:11,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432866148] [2019-11-20 10:20:11,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:11,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:11,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:11,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:11,078 INFO L87 Difference]: Start difference. First operand 171 states and 262 transitions. Second operand 4 states. [2019-11-20 10:20:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:11,412 INFO L93 Difference]: Finished difference Result 344 states and 529 transitions. [2019-11-20 10:20:11,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:11,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-20 10:20:11,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:11,414 INFO L225 Difference]: With dead ends: 344 [2019-11-20 10:20:11,414 INFO L226 Difference]: Without dead ends: 192 [2019-11-20 10:20:11,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-20 10:20:11,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2019-11-20 10:20:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 10:20:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 261 transitions. [2019-11-20 10:20:11,420 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 261 transitions. Word has length 73 [2019-11-20 10:20:11,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:11,420 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 261 transitions. [2019-11-20 10:20:11,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 261 transitions. [2019-11-20 10:20:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 10:20:11,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:11,422 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:11,423 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:11,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash 112745967, now seen corresponding path program 1 times [2019-11-20 10:20:11,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:11,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161269464] [2019-11-20 10:20:11,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:11,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161269464] [2019-11-20 10:20:11,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:11,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:11,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044866747] [2019-11-20 10:20:11,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:11,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:11,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:11,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:11,486 INFO L87 Difference]: Start difference. First operand 171 states and 261 transitions. Second operand 4 states. [2019-11-20 10:20:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:11,828 INFO L93 Difference]: Finished difference Result 343 states and 526 transitions. [2019-11-20 10:20:11,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:11,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 10:20:11,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:11,830 INFO L225 Difference]: With dead ends: 343 [2019-11-20 10:20:11,830 INFO L226 Difference]: Without dead ends: 191 [2019-11-20 10:20:11,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-11-20 10:20:11,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 171. [2019-11-20 10:20:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 10:20:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 260 transitions. [2019-11-20 10:20:11,835 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 260 transitions. Word has length 74 [2019-11-20 10:20:11,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:11,836 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 260 transitions. [2019-11-20 10:20:11,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:11,836 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 260 transitions. [2019-11-20 10:20:11,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 10:20:11,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:11,837 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:11,837 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:11,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:11,837 INFO L82 PathProgramCache]: Analyzing trace with hash -855687654, now seen corresponding path program 1 times [2019-11-20 10:20:11,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:11,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923500528] [2019-11-20 10:20:11,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:11,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923500528] [2019-11-20 10:20:11,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:11,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:11,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570196524] [2019-11-20 10:20:11,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:11,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:11,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:11,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:11,888 INFO L87 Difference]: Start difference. First operand 171 states and 260 transitions. Second operand 4 states. [2019-11-20 10:20:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:12,203 INFO L93 Difference]: Finished difference Result 341 states and 522 transitions. [2019-11-20 10:20:12,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:12,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 10:20:12,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:12,205 INFO L225 Difference]: With dead ends: 341 [2019-11-20 10:20:12,205 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 10:20:12,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 10:20:12,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 171. [2019-11-20 10:20:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 10:20:12,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 259 transitions. [2019-11-20 10:20:12,214 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 259 transitions. Word has length 74 [2019-11-20 10:20:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:12,215 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 259 transitions. [2019-11-20 10:20:12,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 259 transitions. [2019-11-20 10:20:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 10:20:12,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:12,216 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:12,217 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:12,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:12,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1147532634, now seen corresponding path program 1 times [2019-11-20 10:20:12,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:12,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520723831] [2019-11-20 10:20:12,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:12,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520723831] [2019-11-20 10:20:12,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:12,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:12,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143793204] [2019-11-20 10:20:12,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:12,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:12,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:12,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:12,281 INFO L87 Difference]: Start difference. First operand 171 states and 259 transitions. Second operand 4 states. [2019-11-20 10:20:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:12,636 INFO L93 Difference]: Finished difference Result 340 states and 519 transitions. [2019-11-20 10:20:12,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:12,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 10:20:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:12,662 INFO L225 Difference]: With dead ends: 340 [2019-11-20 10:20:12,662 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 10:20:12,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 10:20:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-20 10:20:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 10:20:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 258 transitions. [2019-11-20 10:20:12,668 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 258 transitions. Word has length 74 [2019-11-20 10:20:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:12,668 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 258 transitions. [2019-11-20 10:20:12,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 258 transitions. [2019-11-20 10:20:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 10:20:12,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:12,669 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:12,669 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:12,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:12,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1999649411, now seen corresponding path program 1 times [2019-11-20 10:20:12,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:12,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253105264] [2019-11-20 10:20:12,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:12,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253105264] [2019-11-20 10:20:12,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:12,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:12,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404151214] [2019-11-20 10:20:12,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:12,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:12,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:12,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:12,710 INFO L87 Difference]: Start difference. First operand 171 states and 258 transitions. Second operand 4 states. [2019-11-20 10:20:13,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:13,024 INFO L93 Difference]: Finished difference Result 340 states and 517 transitions. [2019-11-20 10:20:13,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:13,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 10:20:13,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:13,026 INFO L225 Difference]: With dead ends: 340 [2019-11-20 10:20:13,026 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 10:20:13,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 10:20:13,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-20 10:20:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 10:20:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 257 transitions. [2019-11-20 10:20:13,031 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 257 transitions. Word has length 74 [2019-11-20 10:20:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:13,032 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 257 transitions. [2019-11-20 10:20:13,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 257 transitions. [2019-11-20 10:20:13,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 10:20:13,033 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:13,033 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:13,033 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:13,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:13,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1249890732, now seen corresponding path program 1 times [2019-11-20 10:20:13,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:13,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50611648] [2019-11-20 10:20:13,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:13,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50611648] [2019-11-20 10:20:13,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:13,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:13,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069582997] [2019-11-20 10:20:13,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:13,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:13,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:13,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:13,084 INFO L87 Difference]: Start difference. First operand 171 states and 257 transitions. Second operand 4 states. [2019-11-20 10:20:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:13,406 INFO L93 Difference]: Finished difference Result 340 states and 515 transitions. [2019-11-20 10:20:13,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:13,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 10:20:13,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:13,408 INFO L225 Difference]: With dead ends: 340 [2019-11-20 10:20:13,408 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 10:20:13,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:13,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 10:20:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-20 10:20:13,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 10:20:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 256 transitions. [2019-11-20 10:20:13,417 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 256 transitions. Word has length 75 [2019-11-20 10:20:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:13,417 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 256 transitions. [2019-11-20 10:20:13,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2019-11-20 10:20:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 10:20:13,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:13,419 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:13,419 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:13,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:13,419 INFO L82 PathProgramCache]: Analyzing trace with hash 746970856, now seen corresponding path program 1 times [2019-11-20 10:20:13,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:13,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333931382] [2019-11-20 10:20:13,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:13,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333931382] [2019-11-20 10:20:13,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:13,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:13,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956943512] [2019-11-20 10:20:13,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:13,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:13,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:13,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:13,470 INFO L87 Difference]: Start difference. First operand 171 states and 256 transitions. Second operand 4 states. [2019-11-20 10:20:13,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:13,780 INFO L93 Difference]: Finished difference Result 340 states and 513 transitions. [2019-11-20 10:20:13,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:13,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-20 10:20:13,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:13,782 INFO L225 Difference]: With dead ends: 340 [2019-11-20 10:20:13,782 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 10:20:13,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:13,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 10:20:13,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 171. [2019-11-20 10:20:13,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 10:20:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 255 transitions. [2019-11-20 10:20:13,787 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 255 transitions. Word has length 76 [2019-11-20 10:20:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:13,787 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 255 transitions. [2019-11-20 10:20:13,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 255 transitions. [2019-11-20 10:20:13,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 10:20:13,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:13,788 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:13,788 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:13,789 INFO L82 PathProgramCache]: Analyzing trace with hash -693880719, now seen corresponding path program 1 times [2019-11-20 10:20:13,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:13,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970143331] [2019-11-20 10:20:13,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:20:13,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970143331] [2019-11-20 10:20:13,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:13,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:13,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48571943] [2019-11-20 10:20:13,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:13,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:13,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:13,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:13,832 INFO L87 Difference]: Start difference. First operand 171 states and 255 transitions. Second operand 4 states. [2019-11-20 10:20:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:14,109 INFO L93 Difference]: Finished difference Result 330 states and 498 transitions. [2019-11-20 10:20:14,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:14,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-20 10:20:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:14,111 INFO L225 Difference]: With dead ends: 330 [2019-11-20 10:20:14,111 INFO L226 Difference]: Without dead ends: 178 [2019-11-20 10:20:14,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-20 10:20:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 171. [2019-11-20 10:20:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-20 10:20:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 254 transitions. [2019-11-20 10:20:14,116 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 254 transitions. Word has length 77 [2019-11-20 10:20:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:14,116 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 254 transitions. [2019-11-20 10:20:14,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 254 transitions. [2019-11-20 10:20:14,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 10:20:14,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:14,117 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-11-20 10:20:14,117 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:14,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:14,117 INFO L82 PathProgramCache]: Analyzing trace with hash -242622967, now seen corresponding path program 1 times [2019-11-20 10:20:14,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:14,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918176921] [2019-11-20 10:20:14,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:14,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918176921] [2019-11-20 10:20:14,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:14,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:14,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641828895] [2019-11-20 10:20:14,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:14,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:14,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:14,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:14,184 INFO L87 Difference]: Start difference. First operand 171 states and 254 transitions. Second operand 4 states. [2019-11-20 10:20:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:14,670 INFO L93 Difference]: Finished difference Result 432 states and 655 transitions. [2019-11-20 10:20:14,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:14,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-20 10:20:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:14,672 INFO L225 Difference]: With dead ends: 432 [2019-11-20 10:20:14,672 INFO L226 Difference]: Without dead ends: 280 [2019-11-20 10:20:14,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-20 10:20:14,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 212. [2019-11-20 10:20:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-20 10:20:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 328 transitions. [2019-11-20 10:20:14,681 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 328 transitions. Word has length 82 [2019-11-20 10:20:14,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:14,681 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 328 transitions. [2019-11-20 10:20:14,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 328 transitions. [2019-11-20 10:20:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 10:20:14,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:14,682 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-11-20 10:20:14,683 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:14,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:14,683 INFO L82 PathProgramCache]: Analyzing trace with hash 181023755, now seen corresponding path program 1 times [2019-11-20 10:20:14,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:14,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375159743] [2019-11-20 10:20:14,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:14,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375159743] [2019-11-20 10:20:14,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:14,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:14,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567806670] [2019-11-20 10:20:14,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:14,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:14,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:14,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:14,741 INFO L87 Difference]: Start difference. First operand 212 states and 328 transitions. Second operand 4 states. [2019-11-20 10:20:15,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:15,137 INFO L93 Difference]: Finished difference Result 454 states and 709 transitions. [2019-11-20 10:20:15,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:15,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-20 10:20:15,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:15,140 INFO L225 Difference]: With dead ends: 454 [2019-11-20 10:20:15,140 INFO L226 Difference]: Without dead ends: 261 [2019-11-20 10:20:15,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-20 10:20:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 236. [2019-11-20 10:20:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-11-20 10:20:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 370 transitions. [2019-11-20 10:20:15,150 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 370 transitions. Word has length 82 [2019-11-20 10:20:15,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:15,150 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 370 transitions. [2019-11-20 10:20:15,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 370 transitions. [2019-11-20 10:20:15,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 10:20:15,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:15,151 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:15,152 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:15,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:15,152 INFO L82 PathProgramCache]: Analyzing trace with hash -910969721, now seen corresponding path program 1 times [2019-11-20 10:20:15,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:15,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249339142] [2019-11-20 10:20:15,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:15,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249339142] [2019-11-20 10:20:15,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:15,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:15,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905203974] [2019-11-20 10:20:15,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:15,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:15,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:15,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:15,228 INFO L87 Difference]: Start difference. First operand 236 states and 370 transitions. Second operand 4 states. [2019-11-20 10:20:15,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:15,676 INFO L93 Difference]: Finished difference Result 513 states and 801 transitions. [2019-11-20 10:20:15,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:15,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-20 10:20:15,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:15,678 INFO L225 Difference]: With dead ends: 513 [2019-11-20 10:20:15,679 INFO L226 Difference]: Without dead ends: 296 [2019-11-20 10:20:15,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:15,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-20 10:20:15,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 237. [2019-11-20 10:20:15,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-20 10:20:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 371 transitions. [2019-11-20 10:20:15,686 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 371 transitions. Word has length 83 [2019-11-20 10:20:15,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:15,686 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 371 transitions. [2019-11-20 10:20:15,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:15,686 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 371 transitions. [2019-11-20 10:20:15,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 10:20:15,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:15,687 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:15,688 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:15,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:15,688 INFO L82 PathProgramCache]: Analyzing trace with hash 83388544, now seen corresponding path program 1 times [2019-11-20 10:20:15,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:15,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559138412] [2019-11-20 10:20:15,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:15,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559138412] [2019-11-20 10:20:15,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:15,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:15,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620220142] [2019-11-20 10:20:15,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:15,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:15,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:15,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:15,749 INFO L87 Difference]: Start difference. First operand 237 states and 371 transitions. Second operand 4 states. [2019-11-20 10:20:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:16,222 INFO L93 Difference]: Finished difference Result 514 states and 801 transitions. [2019-11-20 10:20:16,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:16,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 10:20:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:16,226 INFO L225 Difference]: With dead ends: 514 [2019-11-20 10:20:16,226 INFO L226 Difference]: Without dead ends: 296 [2019-11-20 10:20:16,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:16,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-11-20 10:20:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 237. [2019-11-20 10:20:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-20 10:20:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 370 transitions. [2019-11-20 10:20:16,237 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 370 transitions. Word has length 95 [2019-11-20 10:20:16,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:16,237 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 370 transitions. [2019-11-20 10:20:16,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 370 transitions. [2019-11-20 10:20:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 10:20:16,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:16,239 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:16,239 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:16,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:16,240 INFO L82 PathProgramCache]: Analyzing trace with hash 959407550, now seen corresponding path program 1 times [2019-11-20 10:20:16,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:16,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8674481] [2019-11-20 10:20:16,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:16,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8674481] [2019-11-20 10:20:16,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:16,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:16,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337020333] [2019-11-20 10:20:16,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:16,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:16,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:16,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:16,301 INFO L87 Difference]: Start difference. First operand 237 states and 370 transitions. Second operand 4 states. [2019-11-20 10:20:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:16,638 INFO L93 Difference]: Finished difference Result 480 states and 750 transitions. [2019-11-20 10:20:16,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:16,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-20 10:20:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:16,641 INFO L225 Difference]: With dead ends: 480 [2019-11-20 10:20:16,641 INFO L226 Difference]: Without dead ends: 262 [2019-11-20 10:20:16,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-20 10:20:16,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 237. [2019-11-20 10:20:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-20 10:20:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 369 transitions. [2019-11-20 10:20:16,647 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 369 transitions. Word has length 95 [2019-11-20 10:20:16,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:16,647 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 369 transitions. [2019-11-20 10:20:16,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 369 transitions. [2019-11-20 10:20:16,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 10:20:16,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:16,649 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:16,649 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:16,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:16,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1902976846, now seen corresponding path program 1 times [2019-11-20 10:20:16,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:16,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867616483] [2019-11-20 10:20:16,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:16,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867616483] [2019-11-20 10:20:16,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:16,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:16,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536136301] [2019-11-20 10:20:16,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:16,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:16,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:16,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:16,716 INFO L87 Difference]: Start difference. First operand 237 states and 369 transitions. Second operand 4 states. [2019-11-20 10:20:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:17,190 INFO L93 Difference]: Finished difference Result 513 states and 796 transitions. [2019-11-20 10:20:17,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:17,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 10:20:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:17,192 INFO L225 Difference]: With dead ends: 513 [2019-11-20 10:20:17,192 INFO L226 Difference]: Without dead ends: 295 [2019-11-20 10:20:17,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:17,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-20 10:20:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 237. [2019-11-20 10:20:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-20 10:20:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 368 transitions. [2019-11-20 10:20:17,200 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 368 transitions. Word has length 96 [2019-11-20 10:20:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:17,200 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 368 transitions. [2019-11-20 10:20:17,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 368 transitions. [2019-11-20 10:20:17,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 10:20:17,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:17,202 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:17,202 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:17,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:17,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1423556829, now seen corresponding path program 1 times [2019-11-20 10:20:17,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:17,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502365855] [2019-11-20 10:20:17,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:17,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502365855] [2019-11-20 10:20:17,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:17,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:17,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676475190] [2019-11-20 10:20:17,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:17,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:17,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:17,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:17,269 INFO L87 Difference]: Start difference. First operand 237 states and 368 transitions. Second operand 4 states. [2019-11-20 10:20:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:17,674 INFO L93 Difference]: Finished difference Result 511 states and 792 transitions. [2019-11-20 10:20:17,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:17,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 10:20:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:17,676 INFO L225 Difference]: With dead ends: 511 [2019-11-20 10:20:17,676 INFO L226 Difference]: Without dead ends: 293 [2019-11-20 10:20:17,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-20 10:20:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 237. [2019-11-20 10:20:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-20 10:20:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 367 transitions. [2019-11-20 10:20:17,684 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 367 transitions. Word has length 96 [2019-11-20 10:20:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:17,684 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 367 transitions. [2019-11-20 10:20:17,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:17,685 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 367 transitions. [2019-11-20 10:20:17,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 10:20:17,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:17,686 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:17,686 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:17,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:17,687 INFO L82 PathProgramCache]: Analyzing trace with hash -868190179, now seen corresponding path program 1 times [2019-11-20 10:20:17,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:17,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774474389] [2019-11-20 10:20:17,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:17,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774474389] [2019-11-20 10:20:17,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:17,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:17,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104422992] [2019-11-20 10:20:17,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:17,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:17,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:17,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:17,781 INFO L87 Difference]: Start difference. First operand 237 states and 367 transitions. Second operand 4 states. [2019-11-20 10:20:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:18,250 INFO L93 Difference]: Finished difference Result 510 states and 789 transitions. [2019-11-20 10:20:18,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:18,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 10:20:18,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:18,252 INFO L225 Difference]: With dead ends: 510 [2019-11-20 10:20:18,253 INFO L226 Difference]: Without dead ends: 292 [2019-11-20 10:20:18,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:18,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-20 10:20:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 237. [2019-11-20 10:20:18,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-20 10:20:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 366 transitions. [2019-11-20 10:20:18,260 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 366 transitions. Word has length 96 [2019-11-20 10:20:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:18,260 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 366 transitions. [2019-11-20 10:20:18,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 366 transitions. [2019-11-20 10:20:18,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 10:20:18,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:18,261 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-11-20 10:20:18,262 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:18,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:18,262 INFO L82 PathProgramCache]: Analyzing trace with hash -16073402, now seen corresponding path program 1 times [2019-11-20 10:20:18,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:18,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611759600] [2019-11-20 10:20:18,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 10:20:18,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611759600] [2019-11-20 10:20:18,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:18,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:20:18,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843110656] [2019-11-20 10:20:18,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:20:18,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:18,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:20:18,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:18,330 INFO L87 Difference]: Start difference. First operand 237 states and 366 transitions. Second operand 5 states. [2019-11-20 10:20:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:18,720 INFO L93 Difference]: Finished difference Result 476 states and 740 transitions. [2019-11-20 10:20:18,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:20:18,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-11-20 10:20:18,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:18,722 INFO L225 Difference]: With dead ends: 476 [2019-11-20 10:20:18,722 INFO L226 Difference]: Without dead ends: 258 [2019-11-20 10:20:18,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:20:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-20 10:20:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-11-20 10:20:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 10:20:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 392 transitions. [2019-11-20 10:20:18,729 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 392 transitions. Word has length 96 [2019-11-20 10:20:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:18,729 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 392 transitions. [2019-11-20 10:20:18,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:20:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 392 transitions. [2019-11-20 10:20:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 10:20:18,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:18,730 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:18,730 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:18,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:18,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1484625057, now seen corresponding path program 1 times [2019-11-20 10:20:18,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:18,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767441459] [2019-11-20 10:20:18,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:18,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767441459] [2019-11-20 10:20:18,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:18,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:18,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70989314] [2019-11-20 10:20:18,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:18,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:18,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:18,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:18,790 INFO L87 Difference]: Start difference. First operand 257 states and 392 transitions. Second operand 4 states. [2019-11-20 10:20:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:19,044 INFO L93 Difference]: Finished difference Result 517 states and 790 transitions. [2019-11-20 10:20:19,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:19,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 10:20:19,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:19,046 INFO L225 Difference]: With dead ends: 517 [2019-11-20 10:20:19,046 INFO L226 Difference]: Without dead ends: 279 [2019-11-20 10:20:19,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-20 10:20:19,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2019-11-20 10:20:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 10:20:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 391 transitions. [2019-11-20 10:20:19,053 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 391 transitions. Word has length 96 [2019-11-20 10:20:19,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:19,053 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 391 transitions. [2019-11-20 10:20:19,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:19,054 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 391 transitions. [2019-11-20 10:20:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 10:20:19,054 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:19,055 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:19,055 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:19,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:19,055 INFO L82 PathProgramCache]: Analyzing trace with hash 518595231, now seen corresponding path program 1 times [2019-11-20 10:20:19,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:19,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390214739] [2019-11-20 10:20:19,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:19,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390214739] [2019-11-20 10:20:19,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:19,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:19,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055557153] [2019-11-20 10:20:19,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:19,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:19,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:19,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:19,118 INFO L87 Difference]: Start difference. First operand 257 states and 391 transitions. Second operand 4 states. [2019-11-20 10:20:19,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:19,429 INFO L93 Difference]: Finished difference Result 516 states and 787 transitions. [2019-11-20 10:20:19,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:19,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 10:20:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:19,431 INFO L225 Difference]: With dead ends: 516 [2019-11-20 10:20:19,431 INFO L226 Difference]: Without dead ends: 278 [2019-11-20 10:20:19,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-11-20 10:20:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-20 10:20:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-11-20 10:20:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 10:20:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 390 transitions. [2019-11-20 10:20:19,436 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 390 transitions. Word has length 96 [2019-11-20 10:20:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:19,437 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 390 transitions. [2019-11-20 10:20:19,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 390 transitions. [2019-11-20 10:20:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 10:20:19,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:19,438 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:19,439 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:19,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:19,439 INFO L82 PathProgramCache]: Analyzing trace with hash -445614852, now seen corresponding path program 1 times [2019-11-20 10:20:19,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:19,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667440324] [2019-11-20 10:20:19,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:19,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667440324] [2019-11-20 10:20:19,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:19,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:19,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113824324] [2019-11-20 10:20:19,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:19,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:19,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:19,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:19,492 INFO L87 Difference]: Start difference. First operand 257 states and 390 transitions. Second operand 4 states. [2019-11-20 10:20:19,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:19,809 INFO L93 Difference]: Finished difference Result 550 states and 834 transitions. [2019-11-20 10:20:19,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:19,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 10:20:19,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:19,811 INFO L225 Difference]: With dead ends: 550 [2019-11-20 10:20:19,811 INFO L226 Difference]: Without dead ends: 312 [2019-11-20 10:20:19,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-20 10:20:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 257. [2019-11-20 10:20:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 10:20:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 389 transitions. [2019-11-20 10:20:19,819 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 389 transitions. Word has length 97 [2019-11-20 10:20:19,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:19,820 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 389 transitions. [2019-11-20 10:20:19,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:19,820 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 389 transitions. [2019-11-20 10:20:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 10:20:19,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:19,821 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:19,821 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:19,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:19,822 INFO L82 PathProgramCache]: Analyzing trace with hash -404940102, now seen corresponding path program 1 times [2019-11-20 10:20:19,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:19,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9503982] [2019-11-20 10:20:19,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:19,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9503982] [2019-11-20 10:20:19,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:19,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:19,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787240086] [2019-11-20 10:20:19,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:19,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:19,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:19,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:19,876 INFO L87 Difference]: Start difference. First operand 257 states and 389 transitions. Second operand 4 states. [2019-11-20 10:20:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:20,252 INFO L93 Difference]: Finished difference Result 516 states and 783 transitions. [2019-11-20 10:20:20,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:20,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 10:20:20,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:20,254 INFO L225 Difference]: With dead ends: 516 [2019-11-20 10:20:20,254 INFO L226 Difference]: Without dead ends: 278 [2019-11-20 10:20:20,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:20,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-20 10:20:20,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-11-20 10:20:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 10:20:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 388 transitions. [2019-11-20 10:20:20,261 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 388 transitions. Word has length 97 [2019-11-20 10:20:20,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:20,261 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 388 transitions. [2019-11-20 10:20:20,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 388 transitions. [2019-11-20 10:20:20,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:20:20,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:20,262 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:20,262 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:20,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:20,263 INFO L82 PathProgramCache]: Analyzing trace with hash 65194841, now seen corresponding path program 1 times [2019-11-20 10:20:20,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:20,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964562799] [2019-11-20 10:20:20,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:20,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964562799] [2019-11-20 10:20:20,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:20,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:20,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153025983] [2019-11-20 10:20:20,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:20,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:20,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:20,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:20,365 INFO L87 Difference]: Start difference. First operand 257 states and 388 transitions. Second operand 4 states. [2019-11-20 10:20:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:20,786 INFO L93 Difference]: Finished difference Result 550 states and 830 transitions. [2019-11-20 10:20:20,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:20,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 10:20:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:20,789 INFO L225 Difference]: With dead ends: 550 [2019-11-20 10:20:20,789 INFO L226 Difference]: Without dead ends: 312 [2019-11-20 10:20:20,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-11-20 10:20:20,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-20 10:20:20,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 257. [2019-11-20 10:20:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 10:20:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 387 transitions. [2019-11-20 10:20:20,798 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 387 transitions. Word has length 98 [2019-11-20 10:20:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:20,798 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 387 transitions. [2019-11-20 10:20:20,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 387 transitions. [2019-11-20 10:20:20,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 10:20:20,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:20,800 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:20,800 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:20,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:20,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1326112091, now seen corresponding path program 1 times [2019-11-20 10:20:20,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:20,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002974145] [2019-11-20 10:20:20,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:20,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002974145] [2019-11-20 10:20:20,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:20,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:20,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132950836] [2019-11-20 10:20:20,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:20,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:20,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:20,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:20,849 INFO L87 Difference]: Start difference. First operand 257 states and 387 transitions. Second operand 4 states. [2019-11-20 10:20:21,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:21,184 INFO L93 Difference]: Finished difference Result 516 states and 779 transitions. [2019-11-20 10:20:21,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:21,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-20 10:20:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:21,186 INFO L225 Difference]: With dead ends: 516 [2019-11-20 10:20:21,186 INFO L226 Difference]: Without dead ends: 278 [2019-11-20 10:20:21,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-20 10:20:21,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-11-20 10:20:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 10:20:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 386 transitions. [2019-11-20 10:20:21,196 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 386 transitions. Word has length 98 [2019-11-20 10:20:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:21,196 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 386 transitions. [2019-11-20 10:20:21,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 386 transitions. [2019-11-20 10:20:21,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 10:20:21,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:21,198 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:21,198 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:21,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:21,198 INFO L82 PathProgramCache]: Analyzing trace with hash -726636041, now seen corresponding path program 1 times [2019-11-20 10:20:21,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:21,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054785590] [2019-11-20 10:20:21,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:21,248 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:21,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054785590] [2019-11-20 10:20:21,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:21,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:21,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837417420] [2019-11-20 10:20:21,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:21,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:21,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:21,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:21,250 INFO L87 Difference]: Start difference. First operand 257 states and 386 transitions. Second operand 4 states. [2019-11-20 10:20:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:21,614 INFO L93 Difference]: Finished difference Result 550 states and 826 transitions. [2019-11-20 10:20:21,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:21,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 10:20:21,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:21,617 INFO L225 Difference]: With dead ends: 550 [2019-11-20 10:20:21,617 INFO L226 Difference]: Without dead ends: 312 [2019-11-20 10:20:21,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:21,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-20 10:20:21,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 257. [2019-11-20 10:20:21,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 10:20:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 385 transitions. [2019-11-20 10:20:21,624 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 385 transitions. Word has length 99 [2019-11-20 10:20:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:21,625 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 385 transitions. [2019-11-20 10:20:21,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 385 transitions. [2019-11-20 10:20:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 10:20:21,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:21,626 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:21,626 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:21,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:21,627 INFO L82 PathProgramCache]: Analyzing trace with hash -292906955, now seen corresponding path program 1 times [2019-11-20 10:20:21,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:21,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874023257] [2019-11-20 10:20:21,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:21,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874023257] [2019-11-20 10:20:21,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:21,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:21,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898946711] [2019-11-20 10:20:21,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:21,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:21,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:21,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:21,679 INFO L87 Difference]: Start difference. First operand 257 states and 385 transitions. Second operand 4 states. [2019-11-20 10:20:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:22,019 INFO L93 Difference]: Finished difference Result 516 states and 775 transitions. [2019-11-20 10:20:22,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:22,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-20 10:20:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:22,021 INFO L225 Difference]: With dead ends: 516 [2019-11-20 10:20:22,021 INFO L226 Difference]: Without dead ends: 278 [2019-11-20 10:20:22,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:22,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-11-20 10:20:22,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 257. [2019-11-20 10:20:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 10:20:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 384 transitions. [2019-11-20 10:20:22,028 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 384 transitions. Word has length 99 [2019-11-20 10:20:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:22,028 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 384 transitions. [2019-11-20 10:20:22,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 384 transitions. [2019-11-20 10:20:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 10:20:22,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:22,029 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:22,029 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:22,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:22,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1049348212, now seen corresponding path program 1 times [2019-11-20 10:20:22,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:22,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627850417] [2019-11-20 10:20:22,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:22,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627850417] [2019-11-20 10:20:22,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:22,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:22,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566182963] [2019-11-20 10:20:22,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:22,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:22,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:22,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:22,082 INFO L87 Difference]: Start difference. First operand 257 states and 384 transitions. Second operand 4 states. [2019-11-20 10:20:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:22,422 INFO L93 Difference]: Finished difference Result 540 states and 810 transitions. [2019-11-20 10:20:22,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:22,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-20 10:20:22,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:22,424 INFO L225 Difference]: With dead ends: 540 [2019-11-20 10:20:22,424 INFO L226 Difference]: Without dead ends: 302 [2019-11-20 10:20:22,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-20 10:20:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 257. [2019-11-20 10:20:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 10:20:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 383 transitions. [2019-11-20 10:20:22,431 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 383 transitions. Word has length 100 [2019-11-20 10:20:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:22,431 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 383 transitions. [2019-11-20 10:20:22,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:22,432 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 383 transitions. [2019-11-20 10:20:22,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 10:20:22,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:22,433 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:22,433 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:22,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:22,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1610047990, now seen corresponding path program 1 times [2019-11-20 10:20:22,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:22,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894009822] [2019-11-20 10:20:22,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:22,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894009822] [2019-11-20 10:20:22,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:22,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:22,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121333593] [2019-11-20 10:20:22,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:22,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:22,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:22,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:22,495 INFO L87 Difference]: Start difference. First operand 257 states and 383 transitions. Second operand 4 states. [2019-11-20 10:20:22,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:22,803 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2019-11-20 10:20:22,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:22,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-20 10:20:22,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:22,805 INFO L225 Difference]: With dead ends: 506 [2019-11-20 10:20:22,805 INFO L226 Difference]: Without dead ends: 268 [2019-11-20 10:20:22,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-20 10:20:22,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 257. [2019-11-20 10:20:22,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 10:20:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 382 transitions. [2019-11-20 10:20:22,812 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 382 transitions. Word has length 100 [2019-11-20 10:20:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:22,812 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 382 transitions. [2019-11-20 10:20:22,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 382 transitions. [2019-11-20 10:20:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 10:20:22,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:22,813 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] [2019-11-20 10:20:22,813 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1540193984, now seen corresponding path program 1 times [2019-11-20 10:20:22,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:22,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727198006] [2019-11-20 10:20:22,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:22,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727198006] [2019-11-20 10:20:22,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:22,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:22,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126414067] [2019-11-20 10:20:22,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:22,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:22,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:22,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:22,870 INFO L87 Difference]: Start difference. First operand 257 states and 382 transitions. Second operand 4 states. [2019-11-20 10:20:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:23,261 INFO L93 Difference]: Finished difference Result 540 states and 806 transitions. [2019-11-20 10:20:23,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:23,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-20 10:20:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:23,264 INFO L225 Difference]: With dead ends: 540 [2019-11-20 10:20:23,264 INFO L226 Difference]: Without dead ends: 302 [2019-11-20 10:20:23,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-20 10:20:23,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 257. [2019-11-20 10:20:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-20 10:20:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 381 transitions. [2019-11-20 10:20:23,273 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 381 transitions. Word has length 104 [2019-11-20 10:20:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:23,274 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 381 transitions. [2019-11-20 10:20:23,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 381 transitions. [2019-11-20 10:20:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 10:20:23,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:23,275 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] [2019-11-20 10:20:23,276 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:23,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:23,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1957590590, now seen corresponding path program 1 times [2019-11-20 10:20:23,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:23,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110511015] [2019-11-20 10:20:23,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:23,362 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:23,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110511015] [2019-11-20 10:20:23,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:23,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:23,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294188502] [2019-11-20 10:20:23,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:23,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:23,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:23,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:23,364 INFO L87 Difference]: Start difference. First operand 257 states and 381 transitions. Second operand 4 states. [2019-11-20 10:20:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:23,721 INFO L93 Difference]: Finished difference Result 547 states and 819 transitions. [2019-11-20 10:20:23,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:23,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-20 10:20:23,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:23,724 INFO L225 Difference]: With dead ends: 547 [2019-11-20 10:20:23,724 INFO L226 Difference]: Without dead ends: 309 [2019-11-20 10:20:23,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:23,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-20 10:20:23,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2019-11-20 10:20:23,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-20 10:20:23,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 426 transitions. [2019-11-20 10:20:23,731 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 426 transitions. Word has length 104 [2019-11-20 10:20:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:23,731 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 426 transitions. [2019-11-20 10:20:23,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 426 transitions. [2019-11-20 10:20:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 10:20:23,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:23,733 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:23,733 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:23,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:23,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1642233629, now seen corresponding path program 1 times [2019-11-20 10:20:23,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:23,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301131623] [2019-11-20 10:20:23,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:23,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301131623] [2019-11-20 10:20:23,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:23,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:23,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822502375] [2019-11-20 10:20:23,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:23,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:23,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:23,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:23,804 INFO L87 Difference]: Start difference. First operand 283 states and 426 transitions. Second operand 4 states. [2019-11-20 10:20:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:24,236 INFO L93 Difference]: Finished difference Result 592 states and 894 transitions. [2019-11-20 10:20:24,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:24,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-20 10:20:24,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:24,238 INFO L225 Difference]: With dead ends: 592 [2019-11-20 10:20:24,239 INFO L226 Difference]: Without dead ends: 328 [2019-11-20 10:20:24,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:24,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-11-20 10:20:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 283. [2019-11-20 10:20:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-20 10:20:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 425 transitions. [2019-11-20 10:20:24,247 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 425 transitions. Word has length 107 [2019-11-20 10:20:24,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:24,247 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 425 transitions. [2019-11-20 10:20:24,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:24,247 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 425 transitions. [2019-11-20 10:20:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 10:20:24,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:24,248 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:24,249 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:24,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:24,249 INFO L82 PathProgramCache]: Analyzing trace with hash 35471872, now seen corresponding path program 1 times [2019-11-20 10:20:24,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:24,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058821161] [2019-11-20 10:20:24,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:24,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058821161] [2019-11-20 10:20:24,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:24,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:24,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021984914] [2019-11-20 10:20:24,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:24,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:24,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:24,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:24,328 INFO L87 Difference]: Start difference. First operand 283 states and 425 transitions. Second operand 4 states. [2019-11-20 10:20:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:24,726 INFO L93 Difference]: Finished difference Result 584 states and 879 transitions. [2019-11-20 10:20:24,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:24,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-20 10:20:24,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:24,728 INFO L225 Difference]: With dead ends: 584 [2019-11-20 10:20:24,728 INFO L226 Difference]: Without dead ends: 320 [2019-11-20 10:20:24,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-20 10:20:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 283. [2019-11-20 10:20:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-20 10:20:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 424 transitions. [2019-11-20 10:20:24,737 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 424 transitions. Word has length 108 [2019-11-20 10:20:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:24,738 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 424 transitions. [2019-11-20 10:20:24,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 424 transitions. [2019-11-20 10:20:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 10:20:24,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:24,739 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:24,740 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:24,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:24,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1751499325, now seen corresponding path program 1 times [2019-11-20 10:20:24,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:24,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660450177] [2019-11-20 10:20:24,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:24,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660450177] [2019-11-20 10:20:24,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:24,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:24,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469735134] [2019-11-20 10:20:24,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:24,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:24,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:24,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:24,808 INFO L87 Difference]: Start difference. First operand 283 states and 424 transitions. Second operand 4 states. [2019-11-20 10:20:25,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:25,177 INFO L93 Difference]: Finished difference Result 584 states and 877 transitions. [2019-11-20 10:20:25,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:25,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-20 10:20:25,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:25,180 INFO L225 Difference]: With dead ends: 584 [2019-11-20 10:20:25,180 INFO L226 Difference]: Without dead ends: 320 [2019-11-20 10:20:25,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:25,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-20 10:20:25,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 283. [2019-11-20 10:20:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-20 10:20:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 423 transitions. [2019-11-20 10:20:25,188 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 423 transitions. Word has length 109 [2019-11-20 10:20:25,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:25,188 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 423 transitions. [2019-11-20 10:20:25,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 423 transitions. [2019-11-20 10:20:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 10:20:25,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:25,189 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:25,190 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:25,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:25,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1247479925, now seen corresponding path program 1 times [2019-11-20 10:20:25,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:25,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890180839] [2019-11-20 10:20:25,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:25,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890180839] [2019-11-20 10:20:25,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:25,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:25,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547747355] [2019-11-20 10:20:25,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:25,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:25,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:25,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:25,258 INFO L87 Difference]: Start difference. First operand 283 states and 423 transitions. Second operand 4 states. [2019-11-20 10:20:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:25,650 INFO L93 Difference]: Finished difference Result 584 states and 875 transitions. [2019-11-20 10:20:25,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:25,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-20 10:20:25,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:25,652 INFO L225 Difference]: With dead ends: 584 [2019-11-20 10:20:25,652 INFO L226 Difference]: Without dead ends: 320 [2019-11-20 10:20:25,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-20 10:20:25,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 283. [2019-11-20 10:20:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-20 10:20:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 422 transitions. [2019-11-20 10:20:25,662 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 422 transitions. Word has length 110 [2019-11-20 10:20:25,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:25,663 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 422 transitions. [2019-11-20 10:20:25,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 422 transitions. [2019-11-20 10:20:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 10:20:25,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:25,665 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:25,665 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:25,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:25,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1790632826, now seen corresponding path program 1 times [2019-11-20 10:20:25,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:25,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661600714] [2019-11-20 10:20:25,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:25,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661600714] [2019-11-20 10:20:25,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:25,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:25,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614520878] [2019-11-20 10:20:25,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:25,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:25,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:25,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:25,738 INFO L87 Difference]: Start difference. First operand 283 states and 422 transitions. Second operand 4 states. [2019-11-20 10:20:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:26,053 INFO L93 Difference]: Finished difference Result 582 states and 871 transitions. [2019-11-20 10:20:26,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:26,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-20 10:20:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:26,055 INFO L225 Difference]: With dead ends: 582 [2019-11-20 10:20:26,055 INFO L226 Difference]: Without dead ends: 318 [2019-11-20 10:20:26,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:26,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-20 10:20:26,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 283. [2019-11-20 10:20:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-20 10:20:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 421 transitions. [2019-11-20 10:20:26,061 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 421 transitions. Word has length 110 [2019-11-20 10:20:26,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:26,062 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 421 transitions. [2019-11-20 10:20:26,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:26,062 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 421 transitions. [2019-11-20 10:20:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 10:20:26,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:26,063 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:26,063 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:26,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:26,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1521793640, now seen corresponding path program 1 times [2019-11-20 10:20:26,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:26,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382248193] [2019-11-20 10:20:26,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:26,124 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:26,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382248193] [2019-11-20 10:20:26,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:26,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:26,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312053354] [2019-11-20 10:20:26,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:26,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:26,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:26,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:26,126 INFO L87 Difference]: Start difference. First operand 283 states and 421 transitions. Second operand 4 states. [2019-11-20 10:20:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:26,417 INFO L93 Difference]: Finished difference Result 580 states and 866 transitions. [2019-11-20 10:20:26,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:26,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-20 10:20:26,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:26,419 INFO L225 Difference]: With dead ends: 580 [2019-11-20 10:20:26,419 INFO L226 Difference]: Without dead ends: 316 [2019-11-20 10:20:26,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:26,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-20 10:20:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 283. [2019-11-20 10:20:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-20 10:20:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 420 transitions. [2019-11-20 10:20:26,427 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 420 transitions. Word has length 111 [2019-11-20 10:20:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:26,427 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 420 transitions. [2019-11-20 10:20:26,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 420 transitions. [2019-11-20 10:20:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 10:20:26,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:26,429 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:26,429 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:26,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:26,429 INFO L82 PathProgramCache]: Analyzing trace with hash 244047579, now seen corresponding path program 1 times [2019-11-20 10:20:26,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:26,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157386402] [2019-11-20 10:20:26,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:26,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157386402] [2019-11-20 10:20:26,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:26,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:26,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526601524] [2019-11-20 10:20:26,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:26,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:26,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:26,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:26,525 INFO L87 Difference]: Start difference. First operand 283 states and 420 transitions. Second operand 4 states. [2019-11-20 10:20:26,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:26,821 INFO L93 Difference]: Finished difference Result 577 states and 860 transitions. [2019-11-20 10:20:26,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:26,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-20 10:20:26,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:26,823 INFO L225 Difference]: With dead ends: 577 [2019-11-20 10:20:26,823 INFO L226 Difference]: Without dead ends: 313 [2019-11-20 10:20:26,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:26,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-20 10:20:26,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 283. [2019-11-20 10:20:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-20 10:20:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 419 transitions. [2019-11-20 10:20:26,831 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 419 transitions. Word has length 111 [2019-11-20 10:20:26,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:26,831 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 419 transitions. [2019-11-20 10:20:26,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:26,832 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 419 transitions. [2019-11-20 10:20:26,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 10:20:26,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:26,833 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:26,833 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:26,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:26,833 INFO L82 PathProgramCache]: Analyzing trace with hash -344193252, now seen corresponding path program 1 times [2019-11-20 10:20:26,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:26,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196877133] [2019-11-20 10:20:26,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:26,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196877133] [2019-11-20 10:20:26,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:26,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:26,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731730531] [2019-11-20 10:20:26,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:26,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:26,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:26,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:26,902 INFO L87 Difference]: Start difference. First operand 283 states and 419 transitions. Second operand 4 states. [2019-11-20 10:20:27,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:27,193 INFO L93 Difference]: Finished difference Result 577 states and 858 transitions. [2019-11-20 10:20:27,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:27,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-20 10:20:27,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:27,195 INFO L225 Difference]: With dead ends: 577 [2019-11-20 10:20:27,195 INFO L226 Difference]: Without dead ends: 313 [2019-11-20 10:20:27,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:27,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-20 10:20:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 283. [2019-11-20 10:20:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-20 10:20:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 418 transitions. [2019-11-20 10:20:27,203 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 418 transitions. Word has length 113 [2019-11-20 10:20:27,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:27,203 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 418 transitions. [2019-11-20 10:20:27,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 418 transitions. [2019-11-20 10:20:27,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 10:20:27,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:27,204 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:27,205 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:27,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:27,205 INFO L82 PathProgramCache]: Analyzing trace with hash -574798082, now seen corresponding path program 1 times [2019-11-20 10:20:27,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:27,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254552977] [2019-11-20 10:20:27,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:27,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254552977] [2019-11-20 10:20:27,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:27,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:27,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305922598] [2019-11-20 10:20:27,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:27,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:27,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:27,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:27,287 INFO L87 Difference]: Start difference. First operand 283 states and 418 transitions. Second operand 4 states. [2019-11-20 10:20:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:27,601 INFO L93 Difference]: Finished difference Result 573 states and 851 transitions. [2019-11-20 10:20:27,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:27,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-20 10:20:27,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:27,603 INFO L225 Difference]: With dead ends: 573 [2019-11-20 10:20:27,603 INFO L226 Difference]: Without dead ends: 309 [2019-11-20 10:20:27,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:27,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-20 10:20:27,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2019-11-20 10:20:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-20 10:20:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 417 transitions. [2019-11-20 10:20:27,611 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 417 transitions. Word has length 114 [2019-11-20 10:20:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:27,611 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 417 transitions. [2019-11-20 10:20:27,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 417 transitions. [2019-11-20 10:20:27,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 10:20:27,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:27,612 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:27,613 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash -53439120, now seen corresponding path program 1 times [2019-11-20 10:20:27,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:27,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150312909] [2019-11-20 10:20:27,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:27,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150312909] [2019-11-20 10:20:27,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:27,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:27,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918224762] [2019-11-20 10:20:27,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:27,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:27,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:27,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:27,690 INFO L87 Difference]: Start difference. First operand 283 states and 417 transitions. Second operand 4 states. [2019-11-20 10:20:28,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:28,048 INFO L93 Difference]: Finished difference Result 573 states and 849 transitions. [2019-11-20 10:20:28,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:28,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-20 10:20:28,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:28,050 INFO L225 Difference]: With dead ends: 573 [2019-11-20 10:20:28,050 INFO L226 Difference]: Without dead ends: 309 [2019-11-20 10:20:28,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-20 10:20:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2019-11-20 10:20:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-20 10:20:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 416 transitions. [2019-11-20 10:20:28,058 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 416 transitions. Word has length 114 [2019-11-20 10:20:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:28,059 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 416 transitions. [2019-11-20 10:20:28,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2019-11-20 10:20:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-20 10:20:28,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:28,060 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:28,060 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:28,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:28,061 INFO L82 PathProgramCache]: Analyzing trace with hash -235371218, now seen corresponding path program 1 times [2019-11-20 10:20:28,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:28,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602599868] [2019-11-20 10:20:28,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:28,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602599868] [2019-11-20 10:20:28,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:28,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:28,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815960752] [2019-11-20 10:20:28,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:28,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:28,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:28,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:28,126 INFO L87 Difference]: Start difference. First operand 283 states and 416 transitions. Second operand 4 states. [2019-11-20 10:20:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:28,482 INFO L93 Difference]: Finished difference Result 571 states and 845 transitions. [2019-11-20 10:20:28,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:28,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-20 10:20:28,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:28,485 INFO L225 Difference]: With dead ends: 571 [2019-11-20 10:20:28,485 INFO L226 Difference]: Without dead ends: 307 [2019-11-20 10:20:28,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:28,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-20 10:20:28,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2019-11-20 10:20:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-20 10:20:28,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 415 transitions. [2019-11-20 10:20:28,495 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 415 transitions. Word has length 115 [2019-11-20 10:20:28,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:28,496 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 415 transitions. [2019-11-20 10:20:28,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:28,496 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 415 transitions. [2019-11-20 10:20:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:20:28,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:28,497 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:28,498 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:28,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:28,498 INFO L82 PathProgramCache]: Analyzing trace with hash 16472555, now seen corresponding path program 1 times [2019-11-20 10:20:28,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:28,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104515676] [2019-11-20 10:20:28,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:28,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104515676] [2019-11-20 10:20:28,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:28,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:28,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553073419] [2019-11-20 10:20:28,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:28,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:28,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:28,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:28,576 INFO L87 Difference]: Start difference. First operand 283 states and 415 transitions. Second operand 4 states. [2019-11-20 10:20:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:28,887 INFO L93 Difference]: Finished difference Result 571 states and 843 transitions. [2019-11-20 10:20:28,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:28,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-20 10:20:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:28,889 INFO L225 Difference]: With dead ends: 571 [2019-11-20 10:20:28,889 INFO L226 Difference]: Without dead ends: 307 [2019-11-20 10:20:28,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-20 10:20:28,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2019-11-20 10:20:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-20 10:20:28,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 414 transitions. [2019-11-20 10:20:28,897 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 414 transitions. Word has length 116 [2019-11-20 10:20:28,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:28,897 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 414 transitions. [2019-11-20 10:20:28,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:28,898 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 414 transitions. [2019-11-20 10:20:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 10:20:28,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:28,900 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:28,900 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:28,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:28,900 INFO L82 PathProgramCache]: Analyzing trace with hash -349731447, now seen corresponding path program 1 times [2019-11-20 10:20:28,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:28,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219463011] [2019-11-20 10:20:28,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:28,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219463011] [2019-11-20 10:20:28,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:28,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:28,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83539765] [2019-11-20 10:20:28,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:28,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:28,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:28,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:28,983 INFO L87 Difference]: Start difference. First operand 283 states and 414 transitions. Second operand 4 states. [2019-11-20 10:20:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:29,402 INFO L93 Difference]: Finished difference Result 569 states and 839 transitions. [2019-11-20 10:20:29,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:29,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-20 10:20:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:29,407 INFO L225 Difference]: With dead ends: 569 [2019-11-20 10:20:29,407 INFO L226 Difference]: Without dead ends: 305 [2019-11-20 10:20:29,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-20 10:20:29,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 283. [2019-11-20 10:20:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-20 10:20:29,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 413 transitions. [2019-11-20 10:20:29,417 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 413 transitions. Word has length 117 [2019-11-20 10:20:29,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:29,417 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 413 transitions. [2019-11-20 10:20:29,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:29,417 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 413 transitions. [2019-11-20 10:20:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 10:20:29,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:29,419 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:29,419 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:29,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:29,419 INFO L82 PathProgramCache]: Analyzing trace with hash 629494119, now seen corresponding path program 1 times [2019-11-20 10:20:29,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:29,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758020579] [2019-11-20 10:20:29,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-20 10:20:29,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758020579] [2019-11-20 10:20:29,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:29,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:29,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685966763] [2019-11-20 10:20:29,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:29,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:29,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:29,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:29,523 INFO L87 Difference]: Start difference. First operand 283 states and 413 transitions. Second operand 4 states. [2019-11-20 10:20:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:29,870 INFO L93 Difference]: Finished difference Result 618 states and 914 transitions. [2019-11-20 10:20:29,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:29,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-20 10:20:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:29,880 INFO L225 Difference]: With dead ends: 618 [2019-11-20 10:20:29,880 INFO L226 Difference]: Without dead ends: 354 [2019-11-20 10:20:29,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:29,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-20 10:20:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 315. [2019-11-20 10:20:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-20 10:20:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 470 transitions. [2019-11-20 10:20:29,892 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 470 transitions. Word has length 117 [2019-11-20 10:20:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:29,892 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 470 transitions. [2019-11-20 10:20:29,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 470 transitions. [2019-11-20 10:20:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 10:20:29,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:29,894 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:29,894 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:29,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:29,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1118786538, now seen corresponding path program 1 times [2019-11-20 10:20:29,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:29,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619789739] [2019-11-20 10:20:29,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:29,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619789739] [2019-11-20 10:20:29,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:29,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:29,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350931140] [2019-11-20 10:20:29,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:29,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:29,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:29,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:29,957 INFO L87 Difference]: Start difference. First operand 315 states and 470 transitions. Second operand 4 states. [2019-11-20 10:20:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:30,319 INFO L93 Difference]: Finished difference Result 717 states and 1082 transitions. [2019-11-20 10:20:30,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:30,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-20 10:20:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:30,322 INFO L225 Difference]: With dead ends: 717 [2019-11-20 10:20:30,322 INFO L226 Difference]: Without dead ends: 421 [2019-11-20 10:20:30,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:30,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-20 10:20:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 354. [2019-11-20 10:20:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-11-20 10:20:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 541 transitions. [2019-11-20 10:20:30,332 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 541 transitions. Word has length 118 [2019-11-20 10:20:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:30,332 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 541 transitions. [2019-11-20 10:20:30,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 541 transitions. [2019-11-20 10:20:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:20:30,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:30,333 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:30,334 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:30,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:30,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1992730650, now seen corresponding path program 1 times [2019-11-20 10:20:30,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:30,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292225570] [2019-11-20 10:20:30,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:30,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292225570] [2019-11-20 10:20:30,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:30,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:30,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587833942] [2019-11-20 10:20:30,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:30,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:30,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:30,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:30,397 INFO L87 Difference]: Start difference. First operand 354 states and 541 transitions. Second operand 4 states. [2019-11-20 10:20:30,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:30,839 INFO L93 Difference]: Finished difference Result 748 states and 1141 transitions. [2019-11-20 10:20:30,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:30,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-20 10:20:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:30,841 INFO L225 Difference]: With dead ends: 748 [2019-11-20 10:20:30,841 INFO L226 Difference]: Without dead ends: 413 [2019-11-20 10:20:30,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-11-20 10:20:30,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 353. [2019-11-20 10:20:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-20 10:20:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 540 transitions. [2019-11-20 10:20:30,851 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 540 transitions. Word has length 119 [2019-11-20 10:20:30,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:30,852 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 540 transitions. [2019-11-20 10:20:30,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 540 transitions. [2019-11-20 10:20:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 10:20:30,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:30,853 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:30,853 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:30,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:30,854 INFO L82 PathProgramCache]: Analyzing trace with hash 375832611, now seen corresponding path program 1 times [2019-11-20 10:20:30,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:30,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716930668] [2019-11-20 10:20:30,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:30,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716930668] [2019-11-20 10:20:30,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:30,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:30,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744554388] [2019-11-20 10:20:30,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:30,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:30,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:30,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:30,910 INFO L87 Difference]: Start difference. First operand 353 states and 540 transitions. Second operand 4 states. [2019-11-20 10:20:31,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:31,283 INFO L93 Difference]: Finished difference Result 713 states and 1091 transitions. [2019-11-20 10:20:31,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:31,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-20 10:20:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:31,286 INFO L225 Difference]: With dead ends: 713 [2019-11-20 10:20:31,286 INFO L226 Difference]: Without dead ends: 379 [2019-11-20 10:20:31,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:31,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-11-20 10:20:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2019-11-20 10:20:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-20 10:20:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 539 transitions. [2019-11-20 10:20:31,296 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 539 transitions. Word has length 119 [2019-11-20 10:20:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:31,296 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 539 transitions. [2019-11-20 10:20:31,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:31,296 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 539 transitions. [2019-11-20 10:20:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 10:20:31,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:31,297 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:31,297 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:31,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash -239737582, now seen corresponding path program 1 times [2019-11-20 10:20:31,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:31,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113720019] [2019-11-20 10:20:31,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:31,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113720019] [2019-11-20 10:20:31,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:31,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:31,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913258620] [2019-11-20 10:20:31,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:31,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:31,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:31,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:31,357 INFO L87 Difference]: Start difference. First operand 353 states and 539 transitions. Second operand 4 states. [2019-11-20 10:20:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:31,623 INFO L93 Difference]: Finished difference Result 713 states and 1089 transitions. [2019-11-20 10:20:31,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:31,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-20 10:20:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:31,626 INFO L225 Difference]: With dead ends: 713 [2019-11-20 10:20:31,626 INFO L226 Difference]: Without dead ends: 379 [2019-11-20 10:20:31,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:31,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-11-20 10:20:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2019-11-20 10:20:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-20 10:20:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 538 transitions. [2019-11-20 10:20:31,635 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 538 transitions. Word has length 120 [2019-11-20 10:20:31,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:31,635 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 538 transitions. [2019-11-20 10:20:31,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 538 transitions. [2019-11-20 10:20:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 10:20:31,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:31,636 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:31,637 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:31,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:31,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1589606562, now seen corresponding path program 1 times [2019-11-20 10:20:31,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:31,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598475080] [2019-11-20 10:20:31,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:31,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598475080] [2019-11-20 10:20:31,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:31,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:31,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603053192] [2019-11-20 10:20:31,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:31,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:31,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:31,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:31,690 INFO L87 Difference]: Start difference. First operand 353 states and 538 transitions. Second operand 4 states. [2019-11-20 10:20:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:31,933 INFO L93 Difference]: Finished difference Result 713 states and 1087 transitions. [2019-11-20 10:20:31,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:31,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-20 10:20:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:31,935 INFO L225 Difference]: With dead ends: 713 [2019-11-20 10:20:31,935 INFO L226 Difference]: Without dead ends: 379 [2019-11-20 10:20:31,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:31,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-11-20 10:20:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 353. [2019-11-20 10:20:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-20 10:20:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 537 transitions. [2019-11-20 10:20:31,944 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 537 transitions. Word has length 121 [2019-11-20 10:20:31,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:31,944 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 537 transitions. [2019-11-20 10:20:31,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:31,945 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 537 transitions. [2019-11-20 10:20:31,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-20 10:20:31,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:31,946 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:31,946 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:31,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:31,946 INFO L82 PathProgramCache]: Analyzing trace with hash 67065837, now seen corresponding path program 1 times [2019-11-20 10:20:31,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:31,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006370277] [2019-11-20 10:20:31,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:32,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006370277] [2019-11-20 10:20:32,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:32,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:32,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863922727] [2019-11-20 10:20:32,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:32,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:32,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:32,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:32,014 INFO L87 Difference]: Start difference. First operand 353 states and 537 transitions. Second operand 4 states. [2019-11-20 10:20:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:32,246 INFO L93 Difference]: Finished difference Result 703 states and 1073 transitions. [2019-11-20 10:20:32,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:32,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-20 10:20:32,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:32,248 INFO L225 Difference]: With dead ends: 703 [2019-11-20 10:20:32,248 INFO L226 Difference]: Without dead ends: 369 [2019-11-20 10:20:32,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:32,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-20 10:20:32,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 353. [2019-11-20 10:20:32,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-20 10:20:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 536 transitions. [2019-11-20 10:20:32,256 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 536 transitions. Word has length 122 [2019-11-20 10:20:32,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:32,256 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 536 transitions. [2019-11-20 10:20:32,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 536 transitions. [2019-11-20 10:20:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 10:20:32,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:32,257 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:32,258 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:32,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:32,258 INFO L82 PathProgramCache]: Analyzing trace with hash -184111027, now seen corresponding path program 1 times [2019-11-20 10:20:32,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:32,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740893981] [2019-11-20 10:20:32,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:32,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740893981] [2019-11-20 10:20:32,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:32,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:32,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012031162] [2019-11-20 10:20:32,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:32,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:32,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:32,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:32,322 INFO L87 Difference]: Start difference. First operand 353 states and 536 transitions. Second operand 4 states. [2019-11-20 10:20:32,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:32,705 INFO L93 Difference]: Finished difference Result 793 states and 1214 transitions. [2019-11-20 10:20:32,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:32,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-11-20 10:20:32,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:32,707 INFO L225 Difference]: With dead ends: 793 [2019-11-20 10:20:32,707 INFO L226 Difference]: Without dead ends: 459 [2019-11-20 10:20:32,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:32,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-11-20 10:20:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 392. [2019-11-20 10:20:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-11-20 10:20:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 607 transitions. [2019-11-20 10:20:32,717 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 607 transitions. Word has length 123 [2019-11-20 10:20:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:32,718 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 607 transitions. [2019-11-20 10:20:32,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 607 transitions. [2019-11-20 10:20:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 10:20:32,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:32,719 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:32,719 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:32,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:32,719 INFO L82 PathProgramCache]: Analyzing trace with hash 902900419, now seen corresponding path program 1 times [2019-11-20 10:20:32,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:32,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406030186] [2019-11-20 10:20:32,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:32,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406030186] [2019-11-20 10:20:32,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:32,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:32,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967168347] [2019-11-20 10:20:32,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:32,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:32,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:32,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:32,798 INFO L87 Difference]: Start difference. First operand 392 states and 607 transitions. Second operand 4 states. [2019-11-20 10:20:33,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:33,144 INFO L93 Difference]: Finished difference Result 824 states and 1273 transitions. [2019-11-20 10:20:33,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:33,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-20 10:20:33,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:33,146 INFO L225 Difference]: With dead ends: 824 [2019-11-20 10:20:33,146 INFO L226 Difference]: Without dead ends: 451 [2019-11-20 10:20:33,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:33,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-20 10:20:33,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 353. [2019-11-20 10:20:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-11-20 10:20:33,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 536 transitions. [2019-11-20 10:20:33,156 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 536 transitions. Word has length 124 [2019-11-20 10:20:33,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:33,156 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 536 transitions. [2019-11-20 10:20:33,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 536 transitions. [2019-11-20 10:20:33,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 10:20:33,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:33,157 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:33,157 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:33,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:33,157 INFO L82 PathProgramCache]: Analyzing trace with hash 155929017, now seen corresponding path program 1 times [2019-11-20 10:20:33,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:33,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959285147] [2019-11-20 10:20:33,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 10:20:33,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959285147] [2019-11-20 10:20:33,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:33,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:33,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813978791] [2019-11-20 10:20:33,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:33,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:33,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:33,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:33,228 INFO L87 Difference]: Start difference. First operand 353 states and 536 transitions. Second operand 4 states. [2019-11-20 10:20:33,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:33,471 INFO L93 Difference]: Finished difference Result 702 states and 1070 transitions. [2019-11-20 10:20:33,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:33,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-11-20 10:20:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:33,473 INFO L225 Difference]: With dead ends: 702 [2019-11-20 10:20:33,473 INFO L226 Difference]: Without dead ends: 368 [2019-11-20 10:20:33,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:33,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-11-20 10:20:33,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 356. [2019-11-20 10:20:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-20 10:20:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 539 transitions. [2019-11-20 10:20:33,481 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 539 transitions. Word has length 125 [2019-11-20 10:20:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:33,481 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 539 transitions. [2019-11-20 10:20:33,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 539 transitions. [2019-11-20 10:20:33,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 10:20:33,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:33,483 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:33,483 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:33,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:33,483 INFO L82 PathProgramCache]: Analyzing trace with hash 911219166, now seen corresponding path program 1 times [2019-11-20 10:20:33,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:33,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142103256] [2019-11-20 10:20:33,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 10:20:33,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142103256] [2019-11-20 10:20:33,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:33,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:33,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754717212] [2019-11-20 10:20:33,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:33,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:33,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:33,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:33,544 INFO L87 Difference]: Start difference. First operand 356 states and 539 transitions. Second operand 4 states. [2019-11-20 10:20:33,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:33,811 INFO L93 Difference]: Finished difference Result 709 states and 1077 transitions. [2019-11-20 10:20:33,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:33,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-20 10:20:33,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:33,813 INFO L225 Difference]: With dead ends: 709 [2019-11-20 10:20:33,813 INFO L226 Difference]: Without dead ends: 372 [2019-11-20 10:20:33,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:33,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-20 10:20:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 356. [2019-11-20 10:20:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-20 10:20:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 538 transitions. [2019-11-20 10:20:33,820 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 538 transitions. Word has length 132 [2019-11-20 10:20:33,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:33,820 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 538 transitions. [2019-11-20 10:20:33,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 538 transitions. [2019-11-20 10:20:33,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 10:20:33,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:33,821 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] [2019-11-20 10:20:33,821 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:33,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:33,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1006654638, now seen corresponding path program 1 times [2019-11-20 10:20:33,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:33,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817675034] [2019-11-20 10:20:33,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 10:20:33,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817675034] [2019-11-20 10:20:33,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:33,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:33,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931969953] [2019-11-20 10:20:33,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:33,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:33,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:33,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:33,888 INFO L87 Difference]: Start difference. First operand 356 states and 538 transitions. Second operand 4 states. [2019-11-20 10:20:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:34,184 INFO L93 Difference]: Finished difference Result 755 states and 1150 transitions. [2019-11-20 10:20:34,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:34,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-20 10:20:34,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:34,186 INFO L225 Difference]: With dead ends: 755 [2019-11-20 10:20:34,186 INFO L226 Difference]: Without dead ends: 418 [2019-11-20 10:20:34,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-11-20 10:20:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 384. [2019-11-20 10:20:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-20 10:20:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 587 transitions. [2019-11-20 10:20:34,196 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 587 transitions. Word has length 132 [2019-11-20 10:20:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:34,196 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 587 transitions. [2019-11-20 10:20:34,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 587 transitions. [2019-11-20 10:20:34,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-20 10:20:34,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:34,197 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:34,197 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:34,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:34,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1878018703, now seen corresponding path program 1 times [2019-11-20 10:20:34,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:34,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110057534] [2019-11-20 10:20:34,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 10:20:34,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110057534] [2019-11-20 10:20:34,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:34,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:34,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783790901] [2019-11-20 10:20:34,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:34,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:34,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:34,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:34,258 INFO L87 Difference]: Start difference. First operand 384 states and 587 transitions. Second operand 4 states. [2019-11-20 10:20:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:34,522 INFO L93 Difference]: Finished difference Result 763 states and 1171 transitions. [2019-11-20 10:20:34,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:34,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-20 10:20:34,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:34,524 INFO L225 Difference]: With dead ends: 763 [2019-11-20 10:20:34,524 INFO L226 Difference]: Without dead ends: 398 [2019-11-20 10:20:34,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:34,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-11-20 10:20:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 384. [2019-11-20 10:20:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-20 10:20:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 586 transitions. [2019-11-20 10:20:34,533 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 586 transitions. Word has length 133 [2019-11-20 10:20:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:34,533 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 586 transitions. [2019-11-20 10:20:34,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 586 transitions. [2019-11-20 10:20:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-20 10:20:34,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:34,535 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:34,535 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:34,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:34,535 INFO L82 PathProgramCache]: Analyzing trace with hash 702294863, now seen corresponding path program 1 times [2019-11-20 10:20:34,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:34,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191785190] [2019-11-20 10:20:34,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:34,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191785190] [2019-11-20 10:20:34,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:34,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:34,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243124975] [2019-11-20 10:20:34,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:34,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:34,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:34,591 INFO L87 Difference]: Start difference. First operand 384 states and 586 transitions. Second operand 4 states. [2019-11-20 10:20:34,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:34,890 INFO L93 Difference]: Finished difference Result 847 states and 1301 transitions. [2019-11-20 10:20:34,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:34,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-20 10:20:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:34,892 INFO L225 Difference]: With dead ends: 847 [2019-11-20 10:20:34,892 INFO L226 Difference]: Without dead ends: 482 [2019-11-20 10:20:34,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-20 10:20:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 396. [2019-11-20 10:20:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-11-20 10:20:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 603 transitions. [2019-11-20 10:20:34,903 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 603 transitions. Word has length 133 [2019-11-20 10:20:34,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:34,903 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 603 transitions. [2019-11-20 10:20:34,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:34,903 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 603 transitions. [2019-11-20 10:20:34,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 10:20:34,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:34,904 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:34,904 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:34,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:34,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1290657638, now seen corresponding path program 1 times [2019-11-20 10:20:34,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:34,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193972211] [2019-11-20 10:20:34,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:34,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193972211] [2019-11-20 10:20:34,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:34,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:34,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312693081] [2019-11-20 10:20:34,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:34,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:34,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:34,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:34,966 INFO L87 Difference]: Start difference. First operand 396 states and 603 transitions. Second operand 4 states. [2019-11-20 10:20:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:35,317 INFO L93 Difference]: Finished difference Result 859 states and 1317 transitions. [2019-11-20 10:20:35,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:35,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-20 10:20:35,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:35,320 INFO L225 Difference]: With dead ends: 859 [2019-11-20 10:20:35,320 INFO L226 Difference]: Without dead ends: 482 [2019-11-20 10:20:35,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-20 10:20:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 397. [2019-11-20 10:20:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-20 10:20:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 604 transitions. [2019-11-20 10:20:35,334 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 604 transitions. Word has length 134 [2019-11-20 10:20:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:35,335 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 604 transitions. [2019-11-20 10:20:35,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 604 transitions. [2019-11-20 10:20:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-20 10:20:35,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:35,336 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:35,337 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:35,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1391994998, now seen corresponding path program 1 times [2019-11-20 10:20:35,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:35,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652065925] [2019-11-20 10:20:35,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:35,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652065925] [2019-11-20 10:20:35,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:35,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:35,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005716395] [2019-11-20 10:20:35,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:35,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:35,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:35,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:35,435 INFO L87 Difference]: Start difference. First operand 397 states and 604 transitions. Second operand 4 states. [2019-11-20 10:20:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:35,735 INFO L93 Difference]: Finished difference Result 860 states and 1317 transitions. [2019-11-20 10:20:35,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:35,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-11-20 10:20:35,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:35,737 INFO L225 Difference]: With dead ends: 860 [2019-11-20 10:20:35,737 INFO L226 Difference]: Without dead ends: 482 [2019-11-20 10:20:35,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-20 10:20:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 398. [2019-11-20 10:20:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-11-20 10:20:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 605 transitions. [2019-11-20 10:20:35,750 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 605 transitions. Word has length 135 [2019-11-20 10:20:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:35,751 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 605 transitions. [2019-11-20 10:20:35,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 605 transitions. [2019-11-20 10:20:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 10:20:35,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:35,752 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:35,752 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:35,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:35,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1898057025, now seen corresponding path program 1 times [2019-11-20 10:20:35,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:35,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102651944] [2019-11-20 10:20:35,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:35,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102651944] [2019-11-20 10:20:35,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:35,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:35,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865559738] [2019-11-20 10:20:35,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:35,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:35,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:35,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:35,816 INFO L87 Difference]: Start difference. First operand 398 states and 605 transitions. Second operand 4 states. [2019-11-20 10:20:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:36,138 INFO L93 Difference]: Finished difference Result 851 states and 1305 transitions. [2019-11-20 10:20:36,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:36,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-11-20 10:20:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:36,140 INFO L225 Difference]: With dead ends: 851 [2019-11-20 10:20:36,140 INFO L226 Difference]: Without dead ends: 472 [2019-11-20 10:20:36,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-11-20 10:20:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-11-20 10:20:36,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 399. [2019-11-20 10:20:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-11-20 10:20:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 606 transitions. [2019-11-20 10:20:36,149 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 606 transitions. Word has length 136 [2019-11-20 10:20:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:36,149 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 606 transitions. [2019-11-20 10:20:36,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 606 transitions. [2019-11-20 10:20:36,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 10:20:36,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:36,150 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:36,150 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:36,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:36,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1925950920, now seen corresponding path program 1 times [2019-11-20 10:20:36,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:36,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403200721] [2019-11-20 10:20:36,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:36,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403200721] [2019-11-20 10:20:36,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:36,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:36,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880250495] [2019-11-20 10:20:36,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:36,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:36,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:36,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:36,212 INFO L87 Difference]: Start difference. First operand 399 states and 606 transitions. Second operand 4 states. [2019-11-20 10:20:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:36,543 INFO L93 Difference]: Finished difference Result 862 states and 1317 transitions. [2019-11-20 10:20:36,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:36,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-11-20 10:20:36,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:36,545 INFO L225 Difference]: With dead ends: 862 [2019-11-20 10:20:36,546 INFO L226 Difference]: Without dead ends: 482 [2019-11-20 10:20:36,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:36,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-20 10:20:36,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 399. [2019-11-20 10:20:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-11-20 10:20:36,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 605 transitions. [2019-11-20 10:20:36,554 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 605 transitions. Word has length 138 [2019-11-20 10:20:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:36,555 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 605 transitions. [2019-11-20 10:20:36,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 605 transitions. [2019-11-20 10:20:36,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 10:20:36,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:36,555 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:36,556 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:36,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:36,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1419416989, now seen corresponding path program 1 times [2019-11-20 10:20:36,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:36,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142451113] [2019-11-20 10:20:36,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:36,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142451113] [2019-11-20 10:20:36,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:36,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:36,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952362347] [2019-11-20 10:20:36,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:36,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:36,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:36,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:36,609 INFO L87 Difference]: Start difference. First operand 399 states and 605 transitions. Second operand 4 states. [2019-11-20 10:20:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:36,940 INFO L93 Difference]: Finished difference Result 862 states and 1315 transitions. [2019-11-20 10:20:36,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:36,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-11-20 10:20:36,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:36,942 INFO L225 Difference]: With dead ends: 862 [2019-11-20 10:20:36,942 INFO L226 Difference]: Without dead ends: 482 [2019-11-20 10:20:36,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-20 10:20:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 399. [2019-11-20 10:20:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-11-20 10:20:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 604 transitions. [2019-11-20 10:20:36,952 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 604 transitions. Word has length 139 [2019-11-20 10:20:36,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:36,952 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 604 transitions. [2019-11-20 10:20:36,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:36,952 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 604 transitions. [2019-11-20 10:20:36,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-20 10:20:36,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:36,953 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:36,953 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:36,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:36,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1695422413, now seen corresponding path program 1 times [2019-11-20 10:20:36,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:36,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952500643] [2019-11-20 10:20:36,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:36,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952500643] [2019-11-20 10:20:36,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:36,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:36,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331069917] [2019-11-20 10:20:36,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:36,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:36,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:36,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:36,995 INFO L87 Difference]: Start difference. First operand 399 states and 604 transitions. Second operand 4 states. [2019-11-20 10:20:37,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:37,344 INFO L93 Difference]: Finished difference Result 862 states and 1313 transitions. [2019-11-20 10:20:37,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:37,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-20 10:20:37,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:37,346 INFO L225 Difference]: With dead ends: 862 [2019-11-20 10:20:37,346 INFO L226 Difference]: Without dead ends: 482 [2019-11-20 10:20:37,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:37,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-20 10:20:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 399. [2019-11-20 10:20:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-11-20 10:20:37,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 603 transitions. [2019-11-20 10:20:37,359 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 603 transitions. Word has length 140 [2019-11-20 10:20:37,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:37,360 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 603 transitions. [2019-11-20 10:20:37,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:37,360 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 603 transitions. [2019-11-20 10:20:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-20 10:20:37,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:37,361 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:37,361 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:37,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:37,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1081741752, now seen corresponding path program 1 times [2019-11-20 10:20:37,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:37,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936812927] [2019-11-20 10:20:37,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:37,408 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:37,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936812927] [2019-11-20 10:20:37,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:37,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:37,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114764587] [2019-11-20 10:20:37,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:37,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:37,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:37,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:37,409 INFO L87 Difference]: Start difference. First operand 399 states and 603 transitions. Second operand 4 states. [2019-11-20 10:20:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:37,754 INFO L93 Difference]: Finished difference Result 852 states and 1299 transitions. [2019-11-20 10:20:37,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:37,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-20 10:20:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:37,756 INFO L225 Difference]: With dead ends: 852 [2019-11-20 10:20:37,756 INFO L226 Difference]: Without dead ends: 472 [2019-11-20 10:20:37,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:37,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-11-20 10:20:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 384. [2019-11-20 10:20:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-11-20 10:20:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 582 transitions. [2019-11-20 10:20:37,773 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 582 transitions. Word has length 141 [2019-11-20 10:20:37,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:37,773 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 582 transitions. [2019-11-20 10:20:37,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 582 transitions. [2019-11-20 10:20:37,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 10:20:37,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:37,775 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:37,775 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:37,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:37,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1979951990, now seen corresponding path program 1 times [2019-11-20 10:20:37,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:37,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458298051] [2019-11-20 10:20:37,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:37,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458298051] [2019-11-20 10:20:37,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:37,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:37,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557485382] [2019-11-20 10:20:37,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:37,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:37,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:37,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:37,839 INFO L87 Difference]: Start difference. First operand 384 states and 582 transitions. Second operand 4 states. [2019-11-20 10:20:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:38,136 INFO L93 Difference]: Finished difference Result 837 states and 1277 transitions. [2019-11-20 10:20:38,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:38,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-20 10:20:38,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:38,138 INFO L225 Difference]: With dead ends: 837 [2019-11-20 10:20:38,138 INFO L226 Difference]: Without dead ends: 472 [2019-11-20 10:20:38,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:38,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-11-20 10:20:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 412. [2019-11-20 10:20:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-11-20 10:20:38,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 627 transitions. [2019-11-20 10:20:38,148 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 627 transitions. Word has length 143 [2019-11-20 10:20:38,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:38,148 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 627 transitions. [2019-11-20 10:20:38,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 627 transitions. [2019-11-20 10:20:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-20 10:20:38,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:38,149 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:38,149 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:38,150 INFO L82 PathProgramCache]: Analyzing trace with hash 654076365, now seen corresponding path program 1 times [2019-11-20 10:20:38,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:38,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236436456] [2019-11-20 10:20:38,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:38,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236436456] [2019-11-20 10:20:38,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:38,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:38,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690827458] [2019-11-20 10:20:38,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:38,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:38,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:38,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:38,247 INFO L87 Difference]: Start difference. First operand 412 states and 627 transitions. Second operand 4 states. [2019-11-20 10:20:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:38,544 INFO L93 Difference]: Finished difference Result 857 states and 1308 transitions. [2019-11-20 10:20:38,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:38,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-11-20 10:20:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:38,547 INFO L225 Difference]: With dead ends: 857 [2019-11-20 10:20:38,547 INFO L226 Difference]: Without dead ends: 464 [2019-11-20 10:20:38,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:38,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-20 10:20:38,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 413. [2019-11-20 10:20:38,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-20 10:20:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 628 transitions. [2019-11-20 10:20:38,561 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 628 transitions. Word has length 144 [2019-11-20 10:20:38,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:38,561 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 628 transitions. [2019-11-20 10:20:38,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 628 transitions. [2019-11-20 10:20:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 10:20:38,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:38,562 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:38,563 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:38,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:38,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1369491918, now seen corresponding path program 1 times [2019-11-20 10:20:38,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:38,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779144306] [2019-11-20 10:20:38,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-20 10:20:38,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779144306] [2019-11-20 10:20:38,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:38,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:38,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357257220] [2019-11-20 10:20:38,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:38,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:38,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:38,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:38,627 INFO L87 Difference]: Start difference. First operand 413 states and 628 transitions. Second operand 4 states. [2019-11-20 10:20:38,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:38,957 INFO L93 Difference]: Finished difference Result 858 states and 1308 transitions. [2019-11-20 10:20:38,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:38,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-20 10:20:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:38,959 INFO L225 Difference]: With dead ends: 858 [2019-11-20 10:20:38,959 INFO L226 Difference]: Without dead ends: 464 [2019-11-20 10:20:38,960 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:38,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-20 10:20:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 413. [2019-11-20 10:20:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-20 10:20:38,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 627 transitions. [2019-11-20 10:20:38,970 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 627 transitions. Word has length 146 [2019-11-20 10:20:38,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:38,970 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 627 transitions. [2019-11-20 10:20:38,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:38,970 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 627 transitions. [2019-11-20 10:20:38,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 10:20:38,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:38,971 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:38,971 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:38,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:38,971 INFO L82 PathProgramCache]: Analyzing trace with hash -104548165, now seen corresponding path program 1 times [2019-11-20 10:20:38,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:38,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314050501] [2019-11-20 10:20:38,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:39,045 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-20 10:20:39,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314050501] [2019-11-20 10:20:39,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:39,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:39,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664984334] [2019-11-20 10:20:39,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:39,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:39,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:39,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:39,047 INFO L87 Difference]: Start difference. First operand 413 states and 627 transitions. Second operand 4 states. [2019-11-20 10:20:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:39,327 INFO L93 Difference]: Finished difference Result 856 states and 1304 transitions. [2019-11-20 10:20:39,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:39,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-20 10:20:39,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:39,329 INFO L225 Difference]: With dead ends: 856 [2019-11-20 10:20:39,329 INFO L226 Difference]: Without dead ends: 462 [2019-11-20 10:20:39,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:39,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-11-20 10:20:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 413. [2019-11-20 10:20:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-20 10:20:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 626 transitions. [2019-11-20 10:20:39,342 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 626 transitions. Word has length 147 [2019-11-20 10:20:39,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:39,342 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 626 transitions. [2019-11-20 10:20:39,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:39,342 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 626 transitions. [2019-11-20 10:20:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 10:20:39,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:39,343 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:39,343 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash -614168594, now seen corresponding path program 1 times [2019-11-20 10:20:39,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:39,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252249335] [2019-11-20 10:20:39,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:39,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252249335] [2019-11-20 10:20:39,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:39,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:39,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391638276] [2019-11-20 10:20:39,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:39,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:39,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:39,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:39,391 INFO L87 Difference]: Start difference. First operand 413 states and 626 transitions. Second operand 4 states. [2019-11-20 10:20:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:39,670 INFO L93 Difference]: Finished difference Result 853 states and 1298 transitions. [2019-11-20 10:20:39,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:39,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-20 10:20:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:39,672 INFO L225 Difference]: With dead ends: 853 [2019-11-20 10:20:39,673 INFO L226 Difference]: Without dead ends: 459 [2019-11-20 10:20:39,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:39,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-11-20 10:20:39,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 416. [2019-11-20 10:20:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-20 10:20:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 631 transitions. [2019-11-20 10:20:39,687 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 631 transitions. Word has length 147 [2019-11-20 10:20:39,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:39,687 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 631 transitions. [2019-11-20 10:20:39,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 631 transitions. [2019-11-20 10:20:39,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 10:20:39,688 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:39,689 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] [2019-11-20 10:20:39,689 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:39,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:39,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1065566135, now seen corresponding path program 1 times [2019-11-20 10:20:39,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:39,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701602542] [2019-11-20 10:20:39,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 10:20:39,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701602542] [2019-11-20 10:20:39,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:39,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:39,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548156341] [2019-11-20 10:20:39,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:39,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:39,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:39,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:39,767 INFO L87 Difference]: Start difference. First operand 416 states and 631 transitions. Second operand 4 states. [2019-11-20 10:20:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:40,044 INFO L93 Difference]: Finished difference Result 847 states and 1286 transitions. [2019-11-20 10:20:40,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:40,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-20 10:20:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:40,046 INFO L225 Difference]: With dead ends: 847 [2019-11-20 10:20:40,047 INFO L226 Difference]: Without dead ends: 450 [2019-11-20 10:20:40,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-20 10:20:40,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 416. [2019-11-20 10:20:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-20 10:20:40,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 630 transitions. [2019-11-20 10:20:40,063 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 630 transitions. Word has length 147 [2019-11-20 10:20:40,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:40,064 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 630 transitions. [2019-11-20 10:20:40,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 630 transitions. [2019-11-20 10:20:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 10:20:40,065 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:40,065 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:40,065 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:40,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:40,066 INFO L82 PathProgramCache]: Analyzing trace with hash 34276127, now seen corresponding path program 1 times [2019-11-20 10:20:40,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:40,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194541114] [2019-11-20 10:20:40,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:40,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194541114] [2019-11-20 10:20:40,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:40,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:40,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754529917] [2019-11-20 10:20:40,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:40,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:40,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:40,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:40,122 INFO L87 Difference]: Start difference. First operand 416 states and 630 transitions. Second operand 4 states. [2019-11-20 10:20:40,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:40,427 INFO L93 Difference]: Finished difference Result 869 states and 1319 transitions. [2019-11-20 10:20:40,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:40,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-20 10:20:40,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:40,429 INFO L225 Difference]: With dead ends: 869 [2019-11-20 10:20:40,429 INFO L226 Difference]: Without dead ends: 472 [2019-11-20 10:20:40,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:40,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-11-20 10:20:40,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 416. [2019-11-20 10:20:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-20 10:20:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 629 transitions. [2019-11-20 10:20:40,444 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 629 transitions. Word has length 148 [2019-11-20 10:20:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:40,444 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 629 transitions. [2019-11-20 10:20:40,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 629 transitions. [2019-11-20 10:20:40,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 10:20:40,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:40,445 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] [2019-11-20 10:20:40,445 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:40,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:40,445 INFO L82 PathProgramCache]: Analyzing trace with hash -332834818, now seen corresponding path program 1 times [2019-11-20 10:20:40,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:40,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254278188] [2019-11-20 10:20:40,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 10:20:40,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254278188] [2019-11-20 10:20:40,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:40,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:40,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229847383] [2019-11-20 10:20:40,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:40,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:40,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:40,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:40,497 INFO L87 Difference]: Start difference. First operand 416 states and 629 transitions. Second operand 4 states. [2019-11-20 10:20:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:40,787 INFO L93 Difference]: Finished difference Result 847 states and 1282 transitions. [2019-11-20 10:20:40,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:40,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-20 10:20:40,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:40,788 INFO L225 Difference]: With dead ends: 847 [2019-11-20 10:20:40,788 INFO L226 Difference]: Without dead ends: 450 [2019-11-20 10:20:40,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-20 10:20:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 416. [2019-11-20 10:20:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-20 10:20:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 628 transitions. [2019-11-20 10:20:40,803 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 628 transitions. Word has length 148 [2019-11-20 10:20:40,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:40,804 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 628 transitions. [2019-11-20 10:20:40,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 628 transitions. [2019-11-20 10:20:40,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 10:20:40,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:40,805 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:40,805 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:40,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:40,806 INFO L82 PathProgramCache]: Analyzing trace with hash 467666756, now seen corresponding path program 1 times [2019-11-20 10:20:40,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:40,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105748465] [2019-11-20 10:20:40,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:40,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105748465] [2019-11-20 10:20:40,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:40,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:40,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028302043] [2019-11-20 10:20:40,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:40,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:40,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:40,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:40,872 INFO L87 Difference]: Start difference. First operand 416 states and 628 transitions. Second operand 4 states. [2019-11-20 10:20:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:41,174 INFO L93 Difference]: Finished difference Result 861 states and 1302 transitions. [2019-11-20 10:20:41,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:41,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-20 10:20:41,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:41,175 INFO L225 Difference]: With dead ends: 861 [2019-11-20 10:20:41,175 INFO L226 Difference]: Without dead ends: 464 [2019-11-20 10:20:41,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:41,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-20 10:20:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 416. [2019-11-20 10:20:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-20 10:20:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 627 transitions. [2019-11-20 10:20:41,189 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 627 transitions. Word has length 149 [2019-11-20 10:20:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:41,189 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 627 transitions. [2019-11-20 10:20:41,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 627 transitions. [2019-11-20 10:20:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 10:20:41,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:41,191 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:41,191 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:41,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:41,191 INFO L82 PathProgramCache]: Analyzing trace with hash -456214673, now seen corresponding path program 1 times [2019-11-20 10:20:41,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:41,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001767958] [2019-11-20 10:20:41,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:41,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001767958] [2019-11-20 10:20:41,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:41,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:41,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594329618] [2019-11-20 10:20:41,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:41,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:41,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:41,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:41,275 INFO L87 Difference]: Start difference. First operand 416 states and 627 transitions. Second operand 4 states. [2019-11-20 10:20:41,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:41,539 INFO L93 Difference]: Finished difference Result 856 states and 1294 transitions. [2019-11-20 10:20:41,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:41,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-20 10:20:41,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:41,540 INFO L225 Difference]: With dead ends: 856 [2019-11-20 10:20:41,541 INFO L226 Difference]: Without dead ends: 459 [2019-11-20 10:20:41,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-11-20 10:20:41,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2019-11-20 10:20:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-20 10:20:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 628 transitions. [2019-11-20 10:20:41,559 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 628 transitions. Word has length 149 [2019-11-20 10:20:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:41,559 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 628 transitions. [2019-11-20 10:20:41,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 628 transitions. [2019-11-20 10:20:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 10:20:41,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:41,561 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] [2019-11-20 10:20:41,561 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:41,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:41,561 INFO L82 PathProgramCache]: Analyzing trace with hash -180653582, now seen corresponding path program 1 times [2019-11-20 10:20:41,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:41,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811293739] [2019-11-20 10:20:41,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 10:20:41,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811293739] [2019-11-20 10:20:41,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:41,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:41,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74758820] [2019-11-20 10:20:41,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:41,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:41,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:41,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:41,623 INFO L87 Difference]: Start difference. First operand 417 states and 628 transitions. Second operand 4 states. [2019-11-20 10:20:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:42,014 INFO L93 Difference]: Finished difference Result 849 states and 1280 transitions. [2019-11-20 10:20:42,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:42,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-20 10:20:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:42,015 INFO L225 Difference]: With dead ends: 849 [2019-11-20 10:20:42,015 INFO L226 Difference]: Without dead ends: 451 [2019-11-20 10:20:42,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:42,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-20 10:20:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 417. [2019-11-20 10:20:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-20 10:20:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 627 transitions. [2019-11-20 10:20:42,034 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 627 transitions. Word has length 149 [2019-11-20 10:20:42,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:42,034 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 627 transitions. [2019-11-20 10:20:42,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 627 transitions. [2019-11-20 10:20:42,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-20 10:20:42,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:42,035 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:42,036 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:42,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:42,036 INFO L82 PathProgramCache]: Analyzing trace with hash 247505163, now seen corresponding path program 1 times [2019-11-20 10:20:42,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:42,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465280608] [2019-11-20 10:20:42,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:42,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465280608] [2019-11-20 10:20:42,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:42,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:42,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454955009] [2019-11-20 10:20:42,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:42,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:42,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:42,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:42,108 INFO L87 Difference]: Start difference. First operand 417 states and 627 transitions. Second operand 4 states. [2019-11-20 10:20:42,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:42,394 INFO L93 Difference]: Finished difference Result 853 states and 1287 transitions. [2019-11-20 10:20:42,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:42,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-20 10:20:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:42,395 INFO L225 Difference]: With dead ends: 853 [2019-11-20 10:20:42,395 INFO L226 Difference]: Without dead ends: 455 [2019-11-20 10:20:42,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:42,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-20 10:20:42,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 418. [2019-11-20 10:20:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-20 10:20:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 628 transitions. [2019-11-20 10:20:42,407 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 628 transitions. Word has length 150 [2019-11-20 10:20:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:42,408 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 628 transitions. [2019-11-20 10:20:42,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:42,408 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 628 transitions. [2019-11-20 10:20:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-20 10:20:42,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:42,409 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:42,409 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:42,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:42,409 INFO L82 PathProgramCache]: Analyzing trace with hash 768864125, now seen corresponding path program 1 times [2019-11-20 10:20:42,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:42,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803552756] [2019-11-20 10:20:42,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:42,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803552756] [2019-11-20 10:20:42,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:42,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:42,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109845395] [2019-11-20 10:20:42,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:42,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:42,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:42,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:42,464 INFO L87 Difference]: Start difference. First operand 418 states and 628 transitions. Second operand 4 states. [2019-11-20 10:20:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:42,735 INFO L93 Difference]: Finished difference Result 854 states and 1287 transitions. [2019-11-20 10:20:42,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:42,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-20 10:20:42,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:42,736 INFO L225 Difference]: With dead ends: 854 [2019-11-20 10:20:42,736 INFO L226 Difference]: Without dead ends: 455 [2019-11-20 10:20:42,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-20 10:20:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 419. [2019-11-20 10:20:42,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-20 10:20:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 629 transitions. [2019-11-20 10:20:42,752 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 629 transitions. Word has length 150 [2019-11-20 10:20:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:42,752 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 629 transitions. [2019-11-20 10:20:42,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 629 transitions. [2019-11-20 10:20:42,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-20 10:20:42,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:42,753 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] [2019-11-20 10:20:42,754 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:42,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:42,754 INFO L82 PathProgramCache]: Analyzing trace with hash 794935257, now seen corresponding path program 1 times [2019-11-20 10:20:42,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:42,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706617425] [2019-11-20 10:20:42,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 10:20:42,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706617425] [2019-11-20 10:20:42,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:42,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:42,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320698565] [2019-11-20 10:20:42,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:42,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:42,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:42,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:42,806 INFO L87 Difference]: Start difference. First operand 419 states and 629 transitions. Second operand 4 states. [2019-11-20 10:20:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:43,076 INFO L93 Difference]: Finished difference Result 843 states and 1270 transitions. [2019-11-20 10:20:43,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:43,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-20 10:20:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:43,077 INFO L225 Difference]: With dead ends: 843 [2019-11-20 10:20:43,077 INFO L226 Difference]: Without dead ends: 443 [2019-11-20 10:20:43,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-20 10:20:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 419. [2019-11-20 10:20:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-20 10:20:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 628 transitions. [2019-11-20 10:20:43,091 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 628 transitions. Word has length 150 [2019-11-20 10:20:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:43,091 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 628 transitions. [2019-11-20 10:20:43,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 628 transitions. [2019-11-20 10:20:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 10:20:43,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:43,092 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:43,092 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:43,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:43,092 INFO L82 PathProgramCache]: Analyzing trace with hash -120499735, now seen corresponding path program 1 times [2019-11-20 10:20:43,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:43,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754854038] [2019-11-20 10:20:43,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 10:20:43,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754854038] [2019-11-20 10:20:43,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:43,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:43,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61376986] [2019-11-20 10:20:43,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:43,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:43,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:43,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:43,147 INFO L87 Difference]: Start difference. First operand 419 states and 628 transitions. Second operand 4 states. [2019-11-20 10:20:43,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:43,444 INFO L93 Difference]: Finished difference Result 864 states and 1296 transitions. [2019-11-20 10:20:43,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:43,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-20 10:20:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:43,445 INFO L225 Difference]: With dead ends: 864 [2019-11-20 10:20:43,445 INFO L226 Difference]: Without dead ends: 464 [2019-11-20 10:20:43,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-11-20 10:20:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 419. [2019-11-20 10:20:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-20 10:20:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 627 transitions. [2019-11-20 10:20:43,458 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 627 transitions. Word has length 151 [2019-11-20 10:20:43,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:43,458 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 627 transitions. [2019-11-20 10:20:43,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 627 transitions. [2019-11-20 10:20:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 10:20:43,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:43,459 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, 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] [2019-11-20 10:20:43,459 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:43,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:43,460 INFO L82 PathProgramCache]: Analyzing trace with hash -513774399, now seen corresponding path program 1 times [2019-11-20 10:20:43,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:43,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740527962] [2019-11-20 10:20:43,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:43,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740527962] [2019-11-20 10:20:43,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:43,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:43,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076934934] [2019-11-20 10:20:43,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:43,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:43,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:43,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:43,541 INFO L87 Difference]: Start difference. First operand 419 states and 627 transitions. Second operand 4 states. [2019-11-20 10:20:43,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:43,814 INFO L93 Difference]: Finished difference Result 853 states and 1281 transitions. [2019-11-20 10:20:43,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:43,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-20 10:20:43,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:43,815 INFO L225 Difference]: With dead ends: 853 [2019-11-20 10:20:43,815 INFO L226 Difference]: Without dead ends: 453 [2019-11-20 10:20:43,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-20 10:20:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 420. [2019-11-20 10:20:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-11-20 10:20:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 628 transitions. [2019-11-20 10:20:43,830 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 628 transitions. Word has length 151 [2019-11-20 10:20:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:43,830 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 628 transitions. [2019-11-20 10:20:43,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 628 transitions. [2019-11-20 10:20:43,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 10:20:43,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:43,831 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:43,831 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:43,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:43,831 INFO L82 PathProgramCache]: Analyzing trace with hash -40496156, now seen corresponding path program 1 times [2019-11-20 10:20:43,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:43,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742538954] [2019-11-20 10:20:43,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 10:20:43,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742538954] [2019-11-20 10:20:43,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:43,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:43,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42666985] [2019-11-20 10:20:43,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:43,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:43,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:43,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:43,881 INFO L87 Difference]: Start difference. First operand 420 states and 628 transitions. Second operand 4 states. [2019-11-20 10:20:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:44,174 INFO L93 Difference]: Finished difference Result 863 states and 1292 transitions. [2019-11-20 10:20:44,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:44,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-20 10:20:44,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:44,175 INFO L225 Difference]: With dead ends: 863 [2019-11-20 10:20:44,175 INFO L226 Difference]: Without dead ends: 462 [2019-11-20 10:20:44,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:44,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-11-20 10:20:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 420. [2019-11-20 10:20:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-11-20 10:20:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 627 transitions. [2019-11-20 10:20:44,194 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 627 transitions. Word has length 152 [2019-11-20 10:20:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:44,195 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 627 transitions. [2019-11-20 10:20:44,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 627 transitions. [2019-11-20 10:20:44,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 10:20:44,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:44,196 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:44,196 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:44,197 INFO L82 PathProgramCache]: Analyzing trace with hash -550116585, now seen corresponding path program 1 times [2019-11-20 10:20:44,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:44,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128912235] [2019-11-20 10:20:44,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:44,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128912235] [2019-11-20 10:20:44,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:44,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:44,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600846133] [2019-11-20 10:20:44,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:44,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:44,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:44,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:44,294 INFO L87 Difference]: Start difference. First operand 420 states and 627 transitions. Second operand 4 states. [2019-11-20 10:20:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:44,723 INFO L93 Difference]: Finished difference Result 860 states and 1286 transitions. [2019-11-20 10:20:44,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:44,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-20 10:20:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:44,724 INFO L225 Difference]: With dead ends: 860 [2019-11-20 10:20:44,724 INFO L226 Difference]: Without dead ends: 459 [2019-11-20 10:20:44,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-11-20 10:20:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 420. [2019-11-20 10:20:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-11-20 10:20:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 626 transitions. [2019-11-20 10:20:44,745 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 626 transitions. Word has length 152 [2019-11-20 10:20:44,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:44,746 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 626 transitions. [2019-11-20 10:20:44,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 626 transitions. [2019-11-20 10:20:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 10:20:44,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:44,747 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:44,747 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:44,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:44,748 INFO L82 PathProgramCache]: Analyzing trace with hash -24091464, now seen corresponding path program 1 times [2019-11-20 10:20:44,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:44,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211659825] [2019-11-20 10:20:44,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:44,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211659825] [2019-11-20 10:20:44,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:44,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:44,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253461717] [2019-11-20 10:20:44,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:44,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:44,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:44,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:44,807 INFO L87 Difference]: Start difference. First operand 420 states and 626 transitions. Second operand 4 states. [2019-11-20 10:20:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:45,222 INFO L93 Difference]: Finished difference Result 854 states and 1277 transitions. [2019-11-20 10:20:45,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:45,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-11-20 10:20:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:45,224 INFO L225 Difference]: With dead ends: 854 [2019-11-20 10:20:45,224 INFO L226 Difference]: Without dead ends: 453 [2019-11-20 10:20:45,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-20 10:20:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 421. [2019-11-20 10:20:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-20 10:20:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 627 transitions. [2019-11-20 10:20:45,246 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 627 transitions. Word has length 152 [2019-11-20 10:20:45,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:45,246 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 627 transitions. [2019-11-20 10:20:45,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:45,246 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 627 transitions. [2019-11-20 10:20:45,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-20 10:20:45,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:45,247 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:45,248 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:45,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:45,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1607216036, now seen corresponding path program 1 times [2019-11-20 10:20:45,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:45,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130825984] [2019-11-20 10:20:45,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:45,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130825984] [2019-11-20 10:20:45,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:45,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:45,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884660345] [2019-11-20 10:20:45,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:45,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:45,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:45,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:45,316 INFO L87 Difference]: Start difference. First operand 421 states and 627 transitions. Second operand 4 states. [2019-11-20 10:20:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:45,632 INFO L93 Difference]: Finished difference Result 853 states and 1275 transitions. [2019-11-20 10:20:45,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:45,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-11-20 10:20:45,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:45,633 INFO L225 Difference]: With dead ends: 853 [2019-11-20 10:20:45,633 INFO L226 Difference]: Without dead ends: 451 [2019-11-20 10:20:45,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:45,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-20 10:20:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 422. [2019-11-20 10:20:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-20 10:20:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 628 transitions. [2019-11-20 10:20:45,648 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 628 transitions. Word has length 153 [2019-11-20 10:20:45,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:45,648 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 628 transitions. [2019-11-20 10:20:45,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 628 transitions. [2019-11-20 10:20:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 10:20:45,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:45,649 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:45,649 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:45,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:45,649 INFO L82 PathProgramCache]: Analyzing trace with hash 968223832, now seen corresponding path program 1 times [2019-11-20 10:20:45,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:45,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163523511] [2019-11-20 10:20:45,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:45,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163523511] [2019-11-20 10:20:45,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:45,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:45,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011988777] [2019-11-20 10:20:45,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:45,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:45,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:45,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:45,711 INFO L87 Difference]: Start difference. First operand 422 states and 628 transitions. Second operand 4 states. [2019-11-20 10:20:45,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:45,996 INFO L93 Difference]: Finished difference Result 862 states and 1284 transitions. [2019-11-20 10:20:45,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:45,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-11-20 10:20:45,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:45,997 INFO L225 Difference]: With dead ends: 862 [2019-11-20 10:20:45,998 INFO L226 Difference]: Without dead ends: 459 [2019-11-20 10:20:45,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:45,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-11-20 10:20:46,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 422. [2019-11-20 10:20:46,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-20 10:20:46,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 627 transitions. [2019-11-20 10:20:46,018 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 627 transitions. Word has length 154 [2019-11-20 10:20:46,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:46,019 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 627 transitions. [2019-11-20 10:20:46,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:46,019 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 627 transitions. [2019-11-20 10:20:46,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-20 10:20:46,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:46,020 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:46,020 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:46,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:46,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1455425858, now seen corresponding path program 1 times [2019-11-20 10:20:46,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:46,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054405944] [2019-11-20 10:20:46,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:46,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054405944] [2019-11-20 10:20:46,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:46,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:46,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004759687] [2019-11-20 10:20:46,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:46,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:46,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:46,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:46,088 INFO L87 Difference]: Start difference. First operand 422 states and 627 transitions. Second operand 4 states. [2019-11-20 10:20:46,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:46,380 INFO L93 Difference]: Finished difference Result 858 states and 1277 transitions. [2019-11-20 10:20:46,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:46,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-20 10:20:46,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:46,381 INFO L225 Difference]: With dead ends: 858 [2019-11-20 10:20:46,381 INFO L226 Difference]: Without dead ends: 455 [2019-11-20 10:20:46,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:46,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-20 10:20:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 422. [2019-11-20 10:20:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-20 10:20:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 626 transitions. [2019-11-20 10:20:46,395 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 626 transitions. Word has length 155 [2019-11-20 10:20:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:46,395 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 626 transitions. [2019-11-20 10:20:46,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 626 transitions. [2019-11-20 10:20:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-20 10:20:46,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:46,396 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:46,396 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:46,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:46,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1976784820, now seen corresponding path program 1 times [2019-11-20 10:20:46,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:46,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678029363] [2019-11-20 10:20:46,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:46,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678029363] [2019-11-20 10:20:46,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:46,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:46,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054436882] [2019-11-20 10:20:46,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:46,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:46,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:46,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:46,454 INFO L87 Difference]: Start difference. First operand 422 states and 626 transitions. Second operand 4 states. [2019-11-20 10:20:46,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:46,730 INFO L93 Difference]: Finished difference Result 858 states and 1275 transitions. [2019-11-20 10:20:46,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:46,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-20 10:20:46,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:46,731 INFO L225 Difference]: With dead ends: 858 [2019-11-20 10:20:46,731 INFO L226 Difference]: Without dead ends: 455 [2019-11-20 10:20:46,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-20 10:20:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 422. [2019-11-20 10:20:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-20 10:20:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 625 transitions. [2019-11-20 10:20:46,745 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 625 transitions. Word has length 155 [2019-11-20 10:20:46,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:46,745 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 625 transitions. [2019-11-20 10:20:46,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:46,746 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 625 transitions. [2019-11-20 10:20:46,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 10:20:46,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:46,747 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:46,747 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:46,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:46,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1722938518, now seen corresponding path program 1 times [2019-11-20 10:20:46,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:46,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705906443] [2019-11-20 10:20:46,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:46,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705906443] [2019-11-20 10:20:46,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:46,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:46,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797109351] [2019-11-20 10:20:46,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:46,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:46,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:46,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:46,812 INFO L87 Difference]: Start difference. First operand 422 states and 625 transitions. Second operand 4 states. [2019-11-20 10:20:47,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:47,088 INFO L93 Difference]: Finished difference Result 856 states and 1271 transitions. [2019-11-20 10:20:47,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:47,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-20 10:20:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:47,089 INFO L225 Difference]: With dead ends: 856 [2019-11-20 10:20:47,089 INFO L226 Difference]: Without dead ends: 453 [2019-11-20 10:20:47,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-20 10:20:47,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 422. [2019-11-20 10:20:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-20 10:20:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 624 transitions. [2019-11-20 10:20:47,103 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 624 transitions. Word has length 156 [2019-11-20 10:20:47,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:47,103 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 624 transitions. [2019-11-20 10:20:47,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 624 transitions. [2019-11-20 10:20:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 10:20:47,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:47,104 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:47,104 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:47,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:47,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1146526511, now seen corresponding path program 1 times [2019-11-20 10:20:47,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:47,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319249276] [2019-11-20 10:20:47,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:47,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319249276] [2019-11-20 10:20:47,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:47,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:47,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146385438] [2019-11-20 10:20:47,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:47,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:47,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:47,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:47,154 INFO L87 Difference]: Start difference. First operand 422 states and 624 transitions. Second operand 4 states. [2019-11-20 10:20:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:47,455 INFO L93 Difference]: Finished difference Result 856 states and 1269 transitions. [2019-11-20 10:20:47,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:47,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-20 10:20:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:47,457 INFO L225 Difference]: With dead ends: 856 [2019-11-20 10:20:47,457 INFO L226 Difference]: Without dead ends: 453 [2019-11-20 10:20:47,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:47,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-20 10:20:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 422. [2019-11-20 10:20:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-20 10:20:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 623 transitions. [2019-11-20 10:20:47,483 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 623 transitions. Word has length 157 [2019-11-20 10:20:47,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:47,484 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 623 transitions. [2019-11-20 10:20:47,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:47,484 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 623 transitions. [2019-11-20 10:20:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 10:20:47,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:47,485 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] [2019-11-20 10:20:47,486 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:47,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:47,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1103781342, now seen corresponding path program 1 times [2019-11-20 10:20:47,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:47,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349337926] [2019-11-20 10:20:47,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:20:47,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349337926] [2019-11-20 10:20:47,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:47,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:47,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539169807] [2019-11-20 10:20:47,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:47,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:47,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:47,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:47,614 INFO L87 Difference]: Start difference. First operand 422 states and 623 transitions. Second operand 4 states. [2019-11-20 10:20:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:47,957 INFO L93 Difference]: Finished difference Result 891 states and 1326 transitions. [2019-11-20 10:20:47,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:47,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-20 10:20:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:47,958 INFO L225 Difference]: With dead ends: 891 [2019-11-20 10:20:47,958 INFO L226 Difference]: Without dead ends: 488 [2019-11-20 10:20:47,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:47,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-11-20 10:20:47,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 452. [2019-11-20 10:20:47,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-20 10:20:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 676 transitions. [2019-11-20 10:20:47,972 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 676 transitions. Word has length 157 [2019-11-20 10:20:47,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:47,973 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 676 transitions. [2019-11-20 10:20:47,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:47,973 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 676 transitions. [2019-11-20 10:20:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-20 10:20:47,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:47,973 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:47,974 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:47,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:47,974 INFO L82 PathProgramCache]: Analyzing trace with hash 322202821, now seen corresponding path program 1 times [2019-11-20 10:20:47,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:47,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154767311] [2019-11-20 10:20:47,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:48,037 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:48,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154767311] [2019-11-20 10:20:48,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:48,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:48,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029043532] [2019-11-20 10:20:48,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:48,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:48,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:48,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:48,038 INFO L87 Difference]: Start difference. First operand 452 states and 676 transitions. Second operand 4 states. [2019-11-20 10:20:48,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:48,320 INFO L93 Difference]: Finished difference Result 914 states and 1371 transitions. [2019-11-20 10:20:48,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:48,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-11-20 10:20:48,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:48,321 INFO L225 Difference]: With dead ends: 914 [2019-11-20 10:20:48,321 INFO L226 Difference]: Without dead ends: 481 [2019-11-20 10:20:48,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:48,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-11-20 10:20:48,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 414. [2019-11-20 10:20:48,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-20 10:20:48,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 620 transitions. [2019-11-20 10:20:48,335 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 620 transitions. Word has length 158 [2019-11-20 10:20:48,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:48,335 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 620 transitions. [2019-11-20 10:20:48,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:48,335 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 620 transitions. [2019-11-20 10:20:48,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 10:20:48,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:48,337 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:48,337 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:48,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:48,337 INFO L82 PathProgramCache]: Analyzing trace with hash 942215189, now seen corresponding path program 1 times [2019-11-20 10:20:48,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:48,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733755055] [2019-11-20 10:20:48,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-20 10:20:48,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733755055] [2019-11-20 10:20:48,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:48,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:48,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115440142] [2019-11-20 10:20:48,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:48,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:48,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:48,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:48,384 INFO L87 Difference]: Start difference. First operand 414 states and 620 transitions. Second operand 4 states. [2019-11-20 10:20:48,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:48,655 INFO L93 Difference]: Finished difference Result 876 states and 1314 transitions. [2019-11-20 10:20:48,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:48,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-20 10:20:48,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:48,656 INFO L225 Difference]: With dead ends: 876 [2019-11-20 10:20:48,656 INFO L226 Difference]: Without dead ends: 481 [2019-11-20 10:20:48,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:48,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-11-20 10:20:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 444. [2019-11-20 10:20:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-11-20 10:20:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 665 transitions. [2019-11-20 10:20:48,672 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 665 transitions. Word has length 160 [2019-11-20 10:20:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:48,672 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 665 transitions. [2019-11-20 10:20:48,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 665 transitions. [2019-11-20 10:20:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 10:20:48,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:48,673 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:48,673 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:48,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:48,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1441958602, now seen corresponding path program 1 times [2019-11-20 10:20:48,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:48,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288348517] [2019-11-20 10:20:48,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-20 10:20:48,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288348517] [2019-11-20 10:20:48,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:48,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:48,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514502012] [2019-11-20 10:20:48,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:48,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:48,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:48,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:48,717 INFO L87 Difference]: Start difference. First operand 444 states and 665 transitions. Second operand 4 states. [2019-11-20 10:20:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:48,978 INFO L93 Difference]: Finished difference Result 893 states and 1342 transitions. [2019-11-20 10:20:48,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:48,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-20 10:20:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:48,979 INFO L225 Difference]: With dead ends: 893 [2019-11-20 10:20:48,979 INFO L226 Difference]: Without dead ends: 468 [2019-11-20 10:20:48,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-11-20 10:20:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-11-20 10:20:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 444. [2019-11-20 10:20:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-11-20 10:20:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 664 transitions. [2019-11-20 10:20:48,995 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 664 transitions. Word has length 160 [2019-11-20 10:20:48,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:48,995 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 664 transitions. [2019-11-20 10:20:48,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:48,995 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 664 transitions. [2019-11-20 10:20:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 10:20:48,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:48,996 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:48,996 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:48,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:48,996 INFO L82 PathProgramCache]: Analyzing trace with hash 639470398, now seen corresponding path program 1 times [2019-11-20 10:20:48,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:48,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655895731] [2019-11-20 10:20:48,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-20 10:20:49,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655895731] [2019-11-20 10:20:49,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:49,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:49,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849886291] [2019-11-20 10:20:49,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:49,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:49,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:49,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:49,045 INFO L87 Difference]: Start difference. First operand 444 states and 664 transitions. Second operand 4 states. [2019-11-20 10:20:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:49,312 INFO L93 Difference]: Finished difference Result 904 states and 1354 transitions. [2019-11-20 10:20:49,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:49,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-20 10:20:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:49,313 INFO L225 Difference]: With dead ends: 904 [2019-11-20 10:20:49,313 INFO L226 Difference]: Without dead ends: 479 [2019-11-20 10:20:49,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-20 10:20:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 445. [2019-11-20 10:20:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-11-20 10:20:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 665 transitions. [2019-11-20 10:20:49,329 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 665 transitions. Word has length 161 [2019-11-20 10:20:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:49,329 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 665 transitions. [2019-11-20 10:20:49,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 665 transitions. [2019-11-20 10:20:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 10:20:49,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:49,330 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:49,330 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:49,330 INFO L82 PathProgramCache]: Analyzing trace with hash 9508236, now seen corresponding path program 1 times [2019-11-20 10:20:49,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:49,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281221926] [2019-11-20 10:20:49,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-20 10:20:49,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281221926] [2019-11-20 10:20:49,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:49,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:20:49,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414570545] [2019-11-20 10:20:49,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:20:49,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:49,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:20:49,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:20:49,382 INFO L87 Difference]: Start difference. First operand 445 states and 665 transitions. Second operand 3 states. [2019-11-20 10:20:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:49,447 INFO L93 Difference]: Finished difference Result 1293 states and 1946 transitions. [2019-11-20 10:20:49,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:20:49,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-20 10:20:49,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:49,449 INFO L225 Difference]: With dead ends: 1293 [2019-11-20 10:20:49,449 INFO L226 Difference]: Without dead ends: 867 [2019-11-20 10:20:49,449 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:20:49,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-11-20 10:20:49,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 865. [2019-11-20 10:20:49,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-11-20 10:20:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1292 transitions. [2019-11-20 10:20:49,495 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1292 transitions. Word has length 161 [2019-11-20 10:20:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:49,495 INFO L462 AbstractCegarLoop]: Abstraction has 865 states and 1292 transitions. [2019-11-20 10:20:49,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:20:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1292 transitions. [2019-11-20 10:20:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-20 10:20:49,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:49,497 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:49,497 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:49,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:49,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1151072035, now seen corresponding path program 1 times [2019-11-20 10:20:49,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:49,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144648004] [2019-11-20 10:20:49,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-20 10:20:49,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144648004] [2019-11-20 10:20:49,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:49,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:49,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213422936] [2019-11-20 10:20:49,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:49,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:49,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:49,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:49,569 INFO L87 Difference]: Start difference. First operand 865 states and 1292 transitions. Second operand 4 states. [2019-11-20 10:20:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:49,863 INFO L93 Difference]: Finished difference Result 1755 states and 2626 transitions. [2019-11-20 10:20:49,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:49,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-11-20 10:20:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:49,864 INFO L225 Difference]: With dead ends: 1755 [2019-11-20 10:20:49,864 INFO L226 Difference]: Without dead ends: 909 [2019-11-20 10:20:49,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-20 10:20:49,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 865. [2019-11-20 10:20:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-11-20 10:20:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1290 transitions. [2019-11-20 10:20:49,893 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1290 transitions. Word has length 161 [2019-11-20 10:20:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:49,894 INFO L462 AbstractCegarLoop]: Abstraction has 865 states and 1290 transitions. [2019-11-20 10:20:49,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1290 transitions. [2019-11-20 10:20:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 10:20:49,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:49,895 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:49,895 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:49,895 INFO L82 PathProgramCache]: Analyzing trace with hash -712421640, now seen corresponding path program 1 times [2019-11-20 10:20:49,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:49,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460981684] [2019-11-20 10:20:49,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:50,048 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:20:50,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460981684] [2019-11-20 10:20:50,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:50,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:20:50,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338159074] [2019-11-20 10:20:50,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:20:50,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:50,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:20:50,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:50,050 INFO L87 Difference]: Start difference. First operand 865 states and 1290 transitions. Second operand 5 states. [2019-11-20 10:20:50,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:50,531 INFO L93 Difference]: Finished difference Result 1863 states and 2792 transitions. [2019-11-20 10:20:50,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:20:50,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2019-11-20 10:20:50,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:50,532 INFO L225 Difference]: With dead ends: 1863 [2019-11-20 10:20:50,532 INFO L226 Difference]: Without dead ends: 1017 [2019-11-20 10:20:50,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 10:20:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-11-20 10:20:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 931. [2019-11-20 10:20:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-11-20 10:20:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1408 transitions. [2019-11-20 10:20:50,562 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1408 transitions. Word has length 162 [2019-11-20 10:20:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:50,562 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1408 transitions. [2019-11-20 10:20:50,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:20:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1408 transitions. [2019-11-20 10:20:50,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 10:20:50,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:50,563 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:50,564 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:50,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:50,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1482730618, now seen corresponding path program 1 times [2019-11-20 10:20:50,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:50,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782027265] [2019-11-20 10:20:50,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:50,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782027265] [2019-11-20 10:20:50,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:50,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:50,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741036593] [2019-11-20 10:20:50,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:50,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:50,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:50,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:50,691 INFO L87 Difference]: Start difference. First operand 931 states and 1408 transitions. Second operand 4 states. [2019-11-20 10:20:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:50,986 INFO L93 Difference]: Finished difference Result 1911 states and 2882 transitions. [2019-11-20 10:20:50,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:50,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-20 10:20:50,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:50,987 INFO L225 Difference]: With dead ends: 1911 [2019-11-20 10:20:50,987 INFO L226 Difference]: Without dead ends: 999 [2019-11-20 10:20:50,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-11-20 10:20:51,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 955. [2019-11-20 10:20:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-11-20 10:20:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1436 transitions. [2019-11-20 10:20:51,017 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1436 transitions. Word has length 164 [2019-11-20 10:20:51,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:51,017 INFO L462 AbstractCegarLoop]: Abstraction has 955 states and 1436 transitions. [2019-11-20 10:20:51,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1436 transitions. [2019-11-20 10:20:51,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 10:20:51,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:51,018 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:51,018 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:51,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:51,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1289166964, now seen corresponding path program 1 times [2019-11-20 10:20:51,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:51,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733857160] [2019-11-20 10:20:51,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 10:20:51,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733857160] [2019-11-20 10:20:51,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:51,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:51,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200872033] [2019-11-20 10:20:51,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:51,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:51,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:51,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:51,094 INFO L87 Difference]: Start difference. First operand 955 states and 1436 transitions. Second operand 4 states. [2019-11-20 10:20:51,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:51,517 INFO L93 Difference]: Finished difference Result 1945 states and 2924 transitions. [2019-11-20 10:20:51,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:51,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-20 10:20:51,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:51,519 INFO L225 Difference]: With dead ends: 1945 [2019-11-20 10:20:51,519 INFO L226 Difference]: Without dead ends: 1009 [2019-11-20 10:20:51,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-11-20 10:20:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2019-11-20 10:20:51,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 955. [2019-11-20 10:20:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-11-20 10:20:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1434 transitions. [2019-11-20 10:20:51,568 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1434 transitions. Word has length 165 [2019-11-20 10:20:51,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:51,568 INFO L462 AbstractCegarLoop]: Abstraction has 955 states and 1434 transitions. [2019-11-20 10:20:51,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1434 transitions. [2019-11-20 10:20:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 10:20:51,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:51,570 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:51,570 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash 156450878, now seen corresponding path program 1 times [2019-11-20 10:20:51,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:51,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708744920] [2019-11-20 10:20:51,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-11-20 10:20:51,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708744920] [2019-11-20 10:20:51,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:51,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:51,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89222329] [2019-11-20 10:20:51,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:51,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:51,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:51,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:51,651 INFO L87 Difference]: Start difference. First operand 955 states and 1434 transitions. Second operand 4 states. [2019-11-20 10:20:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:52,006 INFO L93 Difference]: Finished difference Result 1923 states and 2888 transitions. [2019-11-20 10:20:52,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:52,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-20 10:20:52,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:52,007 INFO L225 Difference]: With dead ends: 1923 [2019-11-20 10:20:52,007 INFO L226 Difference]: Without dead ends: 983 [2019-11-20 10:20:52,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:52,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2019-11-20 10:20:52,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 953. [2019-11-20 10:20:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-20 10:20:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1430 transitions. [2019-11-20 10:20:52,039 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1430 transitions. Word has length 165 [2019-11-20 10:20:52,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:52,039 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1430 transitions. [2019-11-20 10:20:52,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1430 transitions. [2019-11-20 10:20:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-20 10:20:52,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:52,040 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:52,041 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:52,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:52,041 INFO L82 PathProgramCache]: Analyzing trace with hash 186100391, now seen corresponding path program 1 times [2019-11-20 10:20:52,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:52,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141785584] [2019-11-20 10:20:52,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 10:20:52,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141785584] [2019-11-20 10:20:52,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:52,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:52,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092278129] [2019-11-20 10:20:52,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:52,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:52,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:52,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:52,131 INFO L87 Difference]: Start difference. First operand 953 states and 1430 transitions. Second operand 4 states. [2019-11-20 10:20:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:52,455 INFO L93 Difference]: Finished difference Result 1937 states and 2908 transitions. [2019-11-20 10:20:52,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:52,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-11-20 10:20:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:52,456 INFO L225 Difference]: With dead ends: 1937 [2019-11-20 10:20:52,457 INFO L226 Difference]: Without dead ends: 1003 [2019-11-20 10:20:52,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-11-20 10:20:52,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 953. [2019-11-20 10:20:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-20 10:20:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1428 transitions. [2019-11-20 10:20:52,488 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1428 transitions. Word has length 166 [2019-11-20 10:20:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:52,488 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1428 transitions. [2019-11-20 10:20:52,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1428 transitions. [2019-11-20 10:20:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-20 10:20:52,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:52,489 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:52,490 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:52,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:52,490 INFO L82 PathProgramCache]: Analyzing trace with hash -443861771, now seen corresponding path program 1 times [2019-11-20 10:20:52,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:52,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741112117] [2019-11-20 10:20:52,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-20 10:20:52,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741112117] [2019-11-20 10:20:52,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:52,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:20:52,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066757688] [2019-11-20 10:20:52,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:20:52,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:52,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:20:52,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:20:52,554 INFO L87 Difference]: Start difference. First operand 953 states and 1428 transitions. Second operand 3 states. [2019-11-20 10:20:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:52,704 INFO L93 Difference]: Finished difference Result 2349 states and 3535 transitions. [2019-11-20 10:20:52,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:20:52,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-20 10:20:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:52,705 INFO L225 Difference]: With dead ends: 2349 [2019-11-20 10:20:52,706 INFO L226 Difference]: Without dead ends: 1415 [2019-11-20 10:20:52,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:20:52,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2019-11-20 10:20:52,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1415. [2019-11-20 10:20:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-11-20 10:20:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2118 transitions. [2019-11-20 10:20:52,778 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2118 transitions. Word has length 166 [2019-11-20 10:20:52,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:52,778 INFO L462 AbstractCegarLoop]: Abstraction has 1415 states and 2118 transitions. [2019-11-20 10:20:52,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:20:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2118 transitions. [2019-11-20 10:20:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-20 10:20:52,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:52,780 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:52,780 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:52,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:52,781 INFO L82 PathProgramCache]: Analyzing trace with hash -317547734, now seen corresponding path program 1 times [2019-11-20 10:20:52,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:52,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450781807] [2019-11-20 10:20:52,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:20:52,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450781807] [2019-11-20 10:20:52,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:52,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:20:52,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765419517] [2019-11-20 10:20:52,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:20:52,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:52,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:20:52,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:20:52,837 INFO L87 Difference]: Start difference. First operand 1415 states and 2118 transitions. Second operand 3 states. [2019-11-20 10:20:52,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:52,994 INFO L93 Difference]: Finished difference Result 3271 states and 4910 transitions. [2019-11-20 10:20:52,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:20:52,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-20 10:20:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:52,995 INFO L225 Difference]: With dead ends: 3271 [2019-11-20 10:20:52,995 INFO L226 Difference]: Without dead ends: 1875 [2019-11-20 10:20:52,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:20:52,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2019-11-20 10:20:53,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1869. [2019-11-20 10:20:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1869 states. [2019-11-20 10:20:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2799 transitions. [2019-11-20 10:20:53,088 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2799 transitions. Word has length 167 [2019-11-20 10:20:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:53,089 INFO L462 AbstractCegarLoop]: Abstraction has 1869 states and 2799 transitions. [2019-11-20 10:20:53,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:20:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2799 transitions. [2019-11-20 10:20:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-20 10:20:53,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:53,092 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:53,092 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:53,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:53,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1811150326, now seen corresponding path program 1 times [2019-11-20 10:20:53,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:53,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262834011] [2019-11-20 10:20:53,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-20 10:20:53,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262834011] [2019-11-20 10:20:53,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:53,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:20:53,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922453445] [2019-11-20 10:20:53,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:20:53,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:53,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:20:53,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:20:53,150 INFO L87 Difference]: Start difference. First operand 1869 states and 2799 transitions. Second operand 3 states. [2019-11-20 10:20:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:53,301 INFO L93 Difference]: Finished difference Result 4140 states and 6212 transitions. [2019-11-20 10:20:53,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:20:53,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-20 10:20:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:53,303 INFO L225 Difference]: With dead ends: 4140 [2019-11-20 10:20:53,303 INFO L226 Difference]: Without dead ends: 2290 [2019-11-20 10:20:53,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:20:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2019-11-20 10:20:53,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2284. [2019-11-20 10:20:53,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2019-11-20 10:20:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3427 transitions. [2019-11-20 10:20:53,387 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3427 transitions. Word has length 172 [2019-11-20 10:20:53,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:53,387 INFO L462 AbstractCegarLoop]: Abstraction has 2284 states and 3427 transitions. [2019-11-20 10:20:53,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:20:53,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3427 transitions. [2019-11-20 10:20:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-20 10:20:53,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:53,389 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:53,389 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:53,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:53,390 INFO L82 PathProgramCache]: Analyzing trace with hash 413118599, now seen corresponding path program 1 times [2019-11-20 10:20:53,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:53,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999925721] [2019-11-20 10:20:53,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:20:53,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999925721] [2019-11-20 10:20:53,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:53,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:53,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575674820] [2019-11-20 10:20:53,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:53,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:53,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:53,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:53,480 INFO L87 Difference]: Start difference. First operand 2284 states and 3427 transitions. Second operand 4 states. [2019-11-20 10:20:53,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:53,864 INFO L93 Difference]: Finished difference Result 4729 states and 7066 transitions. [2019-11-20 10:20:53,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:53,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-11-20 10:20:53,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:53,867 INFO L225 Difference]: With dead ends: 4729 [2019-11-20 10:20:53,867 INFO L226 Difference]: Without dead ends: 2464 [2019-11-20 10:20:53,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:53,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-11-20 10:20:53,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2284. [2019-11-20 10:20:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2019-11-20 10:20:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3422 transitions. [2019-11-20 10:20:53,987 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3422 transitions. Word has length 172 [2019-11-20 10:20:53,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:53,987 INFO L462 AbstractCegarLoop]: Abstraction has 2284 states and 3422 transitions. [2019-11-20 10:20:53,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:53,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3422 transitions. [2019-11-20 10:20:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-20 10:20:53,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:53,989 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:53,990 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:53,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:53,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2120350472, now seen corresponding path program 1 times [2019-11-20 10:20:53,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:53,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416986638] [2019-11-20 10:20:53,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:54,032 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-20 10:20:54,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416986638] [2019-11-20 10:20:54,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:54,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:20:54,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313007736] [2019-11-20 10:20:54,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:20:54,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:54,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:20:54,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:20:54,034 INFO L87 Difference]: Start difference. First operand 2284 states and 3422 transitions. Second operand 3 states. [2019-11-20 10:20:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:54,172 INFO L93 Difference]: Finished difference Result 4576 states and 6859 transitions. [2019-11-20 10:20:54,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:20:54,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-20 10:20:54,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:54,174 INFO L225 Difference]: With dead ends: 4576 [2019-11-20 10:20:54,174 INFO L226 Difference]: Without dead ends: 2311 [2019-11-20 10:20:54,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:20:54,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2019-11-20 10:20:54,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2311. [2019-11-20 10:20:54,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2311 states. [2019-11-20 10:20:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 3457 transitions. [2019-11-20 10:20:54,288 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 3457 transitions. Word has length 172 [2019-11-20 10:20:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:54,288 INFO L462 AbstractCegarLoop]: Abstraction has 2311 states and 3457 transitions. [2019-11-20 10:20:54,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:20:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3457 transitions. [2019-11-20 10:20:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-20 10:20:54,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:54,289 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:54,289 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:54,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:54,289 INFO L82 PathProgramCache]: Analyzing trace with hash 769425146, now seen corresponding path program 1 times [2019-11-20 10:20:54,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:54,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795232707] [2019-11-20 10:20:54,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 10:20:54,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795232707] [2019-11-20 10:20:54,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:54,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:20:54,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011323239] [2019-11-20 10:20:54,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:20:54,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:54,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:20:54,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:20:54,329 INFO L87 Difference]: Start difference. First operand 2311 states and 3457 transitions. Second operand 3 states. [2019-11-20 10:20:54,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:54,453 INFO L93 Difference]: Finished difference Result 4145 states and 6205 transitions. [2019-11-20 10:20:54,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:20:54,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-20 10:20:54,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:54,455 INFO L225 Difference]: With dead ends: 4145 [2019-11-20 10:20:54,455 INFO L226 Difference]: Without dead ends: 1853 [2019-11-20 10:20:54,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:20:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2019-11-20 10:20:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1853. [2019-11-20 10:20:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-11-20 10:20:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2769 transitions. [2019-11-20 10:20:54,537 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2769 transitions. Word has length 172 [2019-11-20 10:20:54,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:54,537 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2769 transitions. [2019-11-20 10:20:54,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:20:54,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2769 transitions. [2019-11-20 10:20:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-20 10:20:54,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:54,538 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:54,539 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:54,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:54,539 INFO L82 PathProgramCache]: Analyzing trace with hash 916128046, now seen corresponding path program 1 times [2019-11-20 10:20:54,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:54,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105571080] [2019-11-20 10:20:54,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:20:54,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105571080] [2019-11-20 10:20:54,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:54,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:54,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791733709] [2019-11-20 10:20:54,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:54,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:54,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:54,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:54,594 INFO L87 Difference]: Start difference. First operand 1853 states and 2769 transitions. Second operand 4 states. [2019-11-20 10:20:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:54,968 INFO L93 Difference]: Finished difference Result 3830 states and 5701 transitions. [2019-11-20 10:20:54,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:54,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-11-20 10:20:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:54,972 INFO L225 Difference]: With dead ends: 3830 [2019-11-20 10:20:54,972 INFO L226 Difference]: Without dead ends: 1998 [2019-11-20 10:20:54,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:54,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-11-20 10:20:55,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1853. [2019-11-20 10:20:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-11-20 10:20:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2765 transitions. [2019-11-20 10:20:55,040 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2765 transitions. Word has length 173 [2019-11-20 10:20:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:55,041 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2765 transitions. [2019-11-20 10:20:55,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2765 transitions. [2019-11-20 10:20:55,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 10:20:55,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:55,042 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:55,042 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:55,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:55,042 INFO L82 PathProgramCache]: Analyzing trace with hash -117510462, now seen corresponding path program 1 times [2019-11-20 10:20:55,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:55,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314635162] [2019-11-20 10:20:55,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:20:55,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314635162] [2019-11-20 10:20:55,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:55,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:55,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649285241] [2019-11-20 10:20:55,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:55,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:55,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:55,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:55,095 INFO L87 Difference]: Start difference. First operand 1853 states and 2765 transitions. Second operand 4 states. [2019-11-20 10:20:55,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:55,496 INFO L93 Difference]: Finished difference Result 3830 states and 5693 transitions. [2019-11-20 10:20:55,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:55,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-20 10:20:55,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:55,498 INFO L225 Difference]: With dead ends: 3830 [2019-11-20 10:20:55,498 INFO L226 Difference]: Without dead ends: 1998 [2019-11-20 10:20:55,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:55,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2019-11-20 10:20:55,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1853. [2019-11-20 10:20:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-11-20 10:20:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2761 transitions. [2019-11-20 10:20:55,565 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2761 transitions. Word has length 174 [2019-11-20 10:20:55,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:55,566 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2761 transitions. [2019-11-20 10:20:55,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2761 transitions. [2019-11-20 10:20:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-20 10:20:55,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:55,567 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:55,567 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:55,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:55,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1542595319, now seen corresponding path program 1 times [2019-11-20 10:20:55,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:55,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532434825] [2019-11-20 10:20:55,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:20:55,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532434825] [2019-11-20 10:20:55,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:55,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:20:55,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065779244] [2019-11-20 10:20:55,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:20:55,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:55,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:20:55,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:20:55,626 INFO L87 Difference]: Start difference. First operand 1853 states and 2761 transitions. Second operand 4 states. [2019-11-20 10:20:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:55,991 INFO L93 Difference]: Finished difference Result 3790 states and 5637 transitions. [2019-11-20 10:20:55,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:55,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-11-20 10:20:55,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:55,992 INFO L225 Difference]: With dead ends: 3790 [2019-11-20 10:20:55,993 INFO L226 Difference]: Without dead ends: 1958 [2019-11-20 10:20:55,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2019-11-20 10:20:56,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1853. [2019-11-20 10:20:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-11-20 10:20:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2757 transitions. [2019-11-20 10:20:56,061 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2757 transitions. Word has length 175 [2019-11-20 10:20:56,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:56,062 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 2757 transitions. [2019-11-20 10:20:56,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:20:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2757 transitions. [2019-11-20 10:20:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-20 10:20:56,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:56,063 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:56,063 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:56,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:56,063 INFO L82 PathProgramCache]: Analyzing trace with hash 198256685, now seen corresponding path program 1 times [2019-11-20 10:20:56,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:56,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772041876] [2019-11-20 10:20:56,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:56,183 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-20 10:20:56,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772041876] [2019-11-20 10:20:56,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:56,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:20:56,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691451603] [2019-11-20 10:20:56,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:20:56,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:56,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:20:56,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:56,185 INFO L87 Difference]: Start difference. First operand 1853 states and 2757 transitions. Second operand 5 states. [2019-11-20 10:20:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:56,661 INFO L93 Difference]: Finished difference Result 4139 states and 6177 transitions. [2019-11-20 10:20:56,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:56,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2019-11-20 10:20:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:56,663 INFO L225 Difference]: With dead ends: 4139 [2019-11-20 10:20:56,663 INFO L226 Difference]: Without dead ends: 2307 [2019-11-20 10:20:56,664 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-11-20 10:20:56,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-11-20 10:20:56,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2012. [2019-11-20 10:20:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-11-20 10:20:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 3044 transitions. [2019-11-20 10:20:56,734 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 3044 transitions. Word has length 177 [2019-11-20 10:20:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:56,734 INFO L462 AbstractCegarLoop]: Abstraction has 2012 states and 3044 transitions. [2019-11-20 10:20:56,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:20:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 3044 transitions. [2019-11-20 10:20:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 10:20:56,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:56,735 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:56,735 INFO L410 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:56,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:56,735 INFO L82 PathProgramCache]: Analyzing trace with hash -128602397, now seen corresponding path program 1 times [2019-11-20 10:20:56,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:56,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394620487] [2019-11-20 10:20:56,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:56,824 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-20 10:20:56,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394620487] [2019-11-20 10:20:56,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:20:56,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:20:56,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413091016] [2019-11-20 10:20:56,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:20:56,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:20:56,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:20:56,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:20:56,825 INFO L87 Difference]: Start difference. First operand 2012 states and 3044 transitions. Second operand 5 states. [2019-11-20 10:20:57,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:20:57,273 INFO L93 Difference]: Finished difference Result 4410 states and 6684 transitions. [2019-11-20 10:20:57,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:20:57,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-11-20 10:20:57,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:20:57,275 INFO L225 Difference]: With dead ends: 4410 [2019-11-20 10:20:57,275 INFO L226 Difference]: Without dead ends: 2419 [2019-11-20 10:20:57,276 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-11-20 10:20:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2019-11-20 10:20:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2122. [2019-11-20 10:20:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2019-11-20 10:20:57,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 3266 transitions. [2019-11-20 10:20:57,354 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 3266 transitions. Word has length 178 [2019-11-20 10:20:57,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:20:57,355 INFO L462 AbstractCegarLoop]: Abstraction has 2122 states and 3266 transitions. [2019-11-20 10:20:57,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:20:57,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3266 transitions. [2019-11-20 10:20:57,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-20 10:20:57,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:20:57,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:20:57,357 INFO L410 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:20:57,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:20:57,358 INFO L82 PathProgramCache]: Analyzing trace with hash 725002316, now seen corresponding path program 1 times [2019-11-20 10:20:57,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:20:57,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323315876] [2019-11-20 10:20:57,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:20:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:57,628 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:20:57,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323315876] [2019-11-20 10:20:57,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863678180] [2019-11-20 10:20:57,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:20:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:20:57,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-20 10:20:57,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:20:57,953 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:57,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 10:20:57,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:57,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:57,984 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_165|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-11-20 10:20:57,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:57,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:58,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:58,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:58,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:58,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:58,051 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 10:20:58,052 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:58,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:58,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:58,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:58,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:58,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:58,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:58,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:20:58,100 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:58,150 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:20:58,150 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-11-20 10:20:58,151 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:58,170 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,171 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-20 10:20:58,225 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:20:58,225 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-11-20 10:20:58,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:58,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:20:58,275 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:20:58,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 10:20:58,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:58,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:20:58,296 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_168|]} [2019-11-20 10:20:58,301 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:20:58,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:58,376 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 10:20:58,376 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-11-20 10:20:58,377 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:58,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,385 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 10:20:58,439 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:20:58,440 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-11-20 10:20:58,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:58,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:20:58,489 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 10:20:58,489 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-11-20 10:20:58,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:58,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 10:20:58,506 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-11-20 10:20:58,507 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:20:58,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:58,568 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 10:20:58,568 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-11-20 10:20:58,569 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:58,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,578 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 10:20:58,591 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-11-20 10:20:58,597 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-11-20 10:20:58,597 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:20:58,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:58,717 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-20 10:20:58,717 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-20 10:20:58,718 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-11-20 10:20:58,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:20:58,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:20:58,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:20:58,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:20:58,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:58,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-20 10:20:58,837 INFO L567 ElimStorePlain]: treesize reduction 1115, result has 4.6 percent of original size [2019-11-20 10:20:58,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-20 10:20:58,844 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-11-20 10:20:58,849 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:20:58,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:58,925 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 10:20:58,925 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-11-20 10:20:58,926 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:58,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:58,938 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 10:20:58,947 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_161|], 12=[|v_#memory_$Pointer$.base_174|]} [2019-11-20 10:20:58,950 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-11-20 10:20:58,951 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:20:58,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:59,086 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-11-20 10:20:59,086 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-11-20 10:20:59,087 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-11-20 10:20:59,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:59,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:59,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:59,090 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:59,123 INFO L567 ElimStorePlain]: treesize reduction 156, result has 25.7 percent of original size [2019-11-20 10:20:59,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:59,124 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-11-20 10:20:59,130 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 2=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.offset_159|, |v_#memory_$Pointer$.base_163|], 6=[|v_#memory_$Pointer$.base_164|], 12=[|v_#memory_$Pointer$.base_175|]} [2019-11-20 10:20:59,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,147 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-11-20 10:20:59,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:59,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:59,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,230 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-11-20 10:20:59,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:59,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:59,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,272 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 90 treesize of output 62 [2019-11-20 10:20:59,273 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:59,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:59,317 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:20:59,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:59,349 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:20:59,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:59,376 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 0 case distinctions, treesize of input 214 treesize of output 162 [2019-11-20 10:20:59,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 119 [2019-11-20 10:20:59,397 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:59,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:59,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,510 INFO L343 Elim1Store]: treesize reduction 152, result has 48.3 percent of original size [2019-11-20 10:20:59,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 179 [2019-11-20 10:20:59,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:59,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:59,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:59,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:59,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:20:59,514 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:59,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:59,536 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:59,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:59,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:20:59,560 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:317, output treesize:92 [2019-11-20 10:20:59,594 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|], 6=[|v_#memory_$Pointer$.base_176|], 12=[|v_#memory_int_179|]} [2019-11-20 10:20:59,599 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 53 treesize of output 41 [2019-11-20 10:20:59,600 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:20:59,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:59,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:20:59,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 45 [2019-11-20 10:20:59,623 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:20:59,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:59,642 INFO L343 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-11-20 10:20:59,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:20:59,643 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:20:59,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:20:59,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 10:20:59,650 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:38 [2019-11-20 10:21:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:21:00,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:21:00,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-20 10:21:00,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570154061] [2019-11-20 10:21:00,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:21:00,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:21:00,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:21:00,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:21:00,074 INFO L87 Difference]: Start difference. First operand 2122 states and 3266 transitions. Second operand 10 states. [2019-11-20 10:21:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:21:02,892 INFO L93 Difference]: Finished difference Result 9082 states and 13871 transitions. [2019-11-20 10:21:02,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 10:21:02,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2019-11-20 10:21:02,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:21:02,917 INFO L225 Difference]: With dead ends: 9082 [2019-11-20 10:21:02,917 INFO L226 Difference]: Without dead ends: 6981 [2019-11-20 10:21:02,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-11-20 10:21:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6981 states. [2019-11-20 10:21:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6981 to 4657. [2019-11-20 10:21:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4657 states. [2019-11-20 10:21:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 7311 transitions. [2019-11-20 10:21:03,163 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 7311 transitions. Word has length 191 [2019-11-20 10:21:03,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:21:03,163 INFO L462 AbstractCegarLoop]: Abstraction has 4657 states and 7311 transitions. [2019-11-20 10:21:03,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:21:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 7311 transitions. [2019-11-20 10:21:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-20 10:21:03,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:21:03,172 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:21:03,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:21:03,376 INFO L410 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:21:03,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:21:03,376 INFO L82 PathProgramCache]: Analyzing trace with hash 877150553, now seen corresponding path program 1 times [2019-11-20 10:21:03,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:21:03,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359379911] [2019-11-20 10:21:03,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:21:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:21:03,456 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-20 10:21:03,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359379911] [2019-11-20 10:21:03,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:21:03,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:21:03,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410073648] [2019-11-20 10:21:03,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:21:03,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:21:03,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:21:03,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:21:03,458 INFO L87 Difference]: Start difference. First operand 4657 states and 7311 transitions. Second operand 4 states. [2019-11-20 10:21:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:21:04,043 INFO L93 Difference]: Finished difference Result 9503 states and 14876 transitions. [2019-11-20 10:21:04,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:21:04,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-11-20 10:21:04,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:21:04,057 INFO L225 Difference]: With dead ends: 9503 [2019-11-20 10:21:04,058 INFO L226 Difference]: Without dead ends: 4867 [2019-11-20 10:21:04,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:21:04,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4867 states. [2019-11-20 10:21:04,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4867 to 4657. [2019-11-20 10:21:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4657 states. [2019-11-20 10:21:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 7303 transitions. [2019-11-20 10:21:04,399 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 7303 transitions. Word has length 199 [2019-11-20 10:21:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:21:04,399 INFO L462 AbstractCegarLoop]: Abstraction has 4657 states and 7303 transitions. [2019-11-20 10:21:04,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:21:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 7303 transitions. [2019-11-20 10:21:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-20 10:21:04,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:21:04,403 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:21:04,403 INFO L410 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:21:04,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:21:04,404 INFO L82 PathProgramCache]: Analyzing trace with hash -19453550, now seen corresponding path program 1 times [2019-11-20 10:21:04,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:21:04,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226597256] [2019-11-20 10:21:04,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:21:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:21:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-11-20 10:21:04,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226597256] [2019-11-20 10:21:04,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:21:04,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:21:04,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097491763] [2019-11-20 10:21:04,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:21:04,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:21:04,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:21:04,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:21:04,488 INFO L87 Difference]: Start difference. First operand 4657 states and 7303 transitions. Second operand 4 states. [2019-11-20 10:21:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:21:05,041 INFO L93 Difference]: Finished difference Result 9487 states and 14844 transitions. [2019-11-20 10:21:05,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:21:05,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-11-20 10:21:05,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:21:05,048 INFO L225 Difference]: With dead ends: 9487 [2019-11-20 10:21:05,048 INFO L226 Difference]: Without dead ends: 4851 [2019-11-20 10:21:05,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:21:05,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2019-11-20 10:21:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 4657. [2019-11-20 10:21:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4657 states. [2019-11-20 10:21:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 7295 transitions. [2019-11-20 10:21:05,323 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 7295 transitions. Word has length 200 [2019-11-20 10:21:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:21:05,323 INFO L462 AbstractCegarLoop]: Abstraction has 4657 states and 7295 transitions. [2019-11-20 10:21:05,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:21:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 7295 transitions. [2019-11-20 10:21:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-20 10:21:05,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:21:05,327 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:21:05,327 INFO L410 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:21:05,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:21:05,328 INFO L82 PathProgramCache]: Analyzing trace with hash 477049331, now seen corresponding path program 1 times [2019-11-20 10:21:05,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:21:05,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612086734] [2019-11-20 10:21:05,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:21:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:21:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-11-20 10:21:05,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612086734] [2019-11-20 10:21:05,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:21:05,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:21:05,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606343542] [2019-11-20 10:21:05,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:21:05,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:21:05,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:21:05,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:21:05,523 INFO L87 Difference]: Start difference. First operand 4657 states and 7295 transitions. Second operand 6 states. [2019-11-20 10:21:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:21:06,967 INFO L93 Difference]: Finished difference Result 10701 states and 16727 transitions. [2019-11-20 10:21:06,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:21:06,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-11-20 10:21:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:21:06,977 INFO L225 Difference]: With dead ends: 10701 [2019-11-20 10:21:06,977 INFO L226 Difference]: Without dead ends: 6065 [2019-11-20 10:21:06,981 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-11-20 10:21:06,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2019-11-20 10:21:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 4725. [2019-11-20 10:21:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-20 10:21:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 7399 transitions. [2019-11-20 10:21:07,269 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 7399 transitions. Word has length 204 [2019-11-20 10:21:07,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:21:07,269 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 7399 transitions. [2019-11-20 10:21:07,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:21:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 7399 transitions. [2019-11-20 10:21:07,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-20 10:21:07,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:21:07,274 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:21:07,274 INFO L410 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:21:07,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:21:07,274 INFO L82 PathProgramCache]: Analyzing trace with hash 462310456, now seen corresponding path program 1 times [2019-11-20 10:21:07,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:21:07,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080035649] [2019-11-20 10:21:07,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:21:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:21:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-11-20 10:21:07,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080035649] [2019-11-20 10:21:07,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:21:07,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 10:21:07,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391976031] [2019-11-20 10:21:07,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:21:07,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:21:07,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:21:07,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:21:07,411 INFO L87 Difference]: Start difference. First operand 4725 states and 7399 transitions. Second operand 6 states. [2019-11-20 10:21:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:21:08,589 INFO L93 Difference]: Finished difference Result 10401 states and 16163 transitions. [2019-11-20 10:21:08,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:21:08,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 205 [2019-11-20 10:21:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:21:08,595 INFO L225 Difference]: With dead ends: 10401 [2019-11-20 10:21:08,595 INFO L226 Difference]: Without dead ends: 5697 [2019-11-20 10:21:08,597 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-11-20 10:21:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5697 states. [2019-11-20 10:21:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5697 to 4729. [2019-11-20 10:21:08,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4729 states. [2019-11-20 10:21:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4729 states to 4729 states and 7387 transitions. [2019-11-20 10:21:08,835 INFO L78 Accepts]: Start accepts. Automaton has 4729 states and 7387 transitions. Word has length 205 [2019-11-20 10:21:08,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:21:08,835 INFO L462 AbstractCegarLoop]: Abstraction has 4729 states and 7387 transitions. [2019-11-20 10:21:08,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:21:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand 4729 states and 7387 transitions. [2019-11-20 10:21:08,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-20 10:21:08,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:21:08,838 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:21:08,838 INFO L410 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:21:08,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:21:08,839 INFO L82 PathProgramCache]: Analyzing trace with hash -412411121, now seen corresponding path program 1 times [2019-11-20 10:21:08,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:21:08,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994358485] [2019-11-20 10:21:08,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:21:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:21:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-20 10:21:08,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994358485] [2019-11-20 10:21:08,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:21:08,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:21:08,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799917366] [2019-11-20 10:21:08,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:21:08,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:21:08,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:21:08,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:21:08,978 INFO L87 Difference]: Start difference. First operand 4729 states and 7387 transitions. Second operand 5 states. [2019-11-20 10:21:09,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:21:09,887 INFO L93 Difference]: Finished difference Result 10369 states and 16181 transitions. [2019-11-20 10:21:09,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:21:09,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2019-11-20 10:21:09,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:21:09,892 INFO L225 Difference]: With dead ends: 10369 [2019-11-20 10:21:09,892 INFO L226 Difference]: Without dead ends: 5661 [2019-11-20 10:21:09,895 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-11-20 10:21:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5661 states. [2019-11-20 10:21:10,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5661 to 5025. [2019-11-20 10:21:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5025 states. [2019-11-20 10:21:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5025 states to 5025 states and 7907 transitions. [2019-11-20 10:21:10,095 INFO L78 Accepts]: Start accepts. Automaton has 5025 states and 7907 transitions. Word has length 211 [2019-11-20 10:21:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:21:10,095 INFO L462 AbstractCegarLoop]: Abstraction has 5025 states and 7907 transitions. [2019-11-20 10:21:10,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:21:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 5025 states and 7907 transitions. [2019-11-20 10:21:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-20 10:21:10,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:21:10,100 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:21:10,100 INFO L410 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:21:10,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:21:10,100 INFO L82 PathProgramCache]: Analyzing trace with hash -760223515, now seen corresponding path program 1 times [2019-11-20 10:21:10,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:21:10,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340408978] [2019-11-20 10:21:10,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:21:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:21:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-11-20 10:21:10,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340408978] [2019-11-20 10:21:10,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:21:10,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 10:21:10,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607802668] [2019-11-20 10:21:10,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 10:21:10,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:21:10,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 10:21:10,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:21:10,246 INFO L87 Difference]: Start difference. First operand 5025 states and 7907 transitions. Second operand 5 states. [2019-11-20 10:21:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:21:10,999 INFO L93 Difference]: Finished difference Result 10641 states and 16653 transitions. [2019-11-20 10:21:10,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:21:10,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-11-20 10:21:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:21:11,004 INFO L225 Difference]: With dead ends: 10641 [2019-11-20 10:21:11,004 INFO L226 Difference]: Without dead ends: 5637 [2019-11-20 10:21:11,007 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-11-20 10:21:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5637 states. [2019-11-20 10:21:11,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5637 to 5013. [2019-11-20 10:21:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5013 states. [2019-11-20 10:21:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5013 states to 5013 states and 7879 transitions. [2019-11-20 10:21:11,220 INFO L78 Accepts]: Start accepts. Automaton has 5013 states and 7879 transitions. Word has length 212 [2019-11-20 10:21:11,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:21:11,220 INFO L462 AbstractCegarLoop]: Abstraction has 5013 states and 7879 transitions. [2019-11-20 10:21:11,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 10:21:11,220 INFO L276 IsEmpty]: Start isEmpty. Operand 5013 states and 7879 transitions. [2019-11-20 10:21:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-20 10:21:11,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:21:11,224 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:21:11,224 INFO L410 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:21:11,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:21:11,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2003024104, now seen corresponding path program 1 times [2019-11-20 10:21:11,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:21:11,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115716966] [2019-11-20 10:21:11,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:21:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:21:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 307 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-11-20 10:21:11,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115716966] [2019-11-20 10:21:11,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376656783] [2019-11-20 10:21:11,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:21:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:21:11,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:21:11,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:21:11,697 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-20 10:21:11,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:11,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:11,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:11,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-20 10:21:11,714 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_177|, |v_#memory_$Pointer$.offset_163|], 5=[|v_#memory_int_180|]} [2019-11-20 10:21:11,722 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-11-20 10:21:11,722 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:21:11,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:11,727 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-11-20 10:21:11,728 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:21:11,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:11,764 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:11,764 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-20 10:21:11,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:11,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:11,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:11,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:11,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:11,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:11,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:11,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:11,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:11,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 10:21:11,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:21:11,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 10:21:11,995 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 10:21:11,998 INFO L168 Benchmark]: Toolchain (without parser) took 67535.79 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 943.4 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 167.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:21:11,998 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:21:11,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-20 10:21:11,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:21:11,999 INFO L168 Benchmark]: Boogie Preprocessor took 69.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:21:11,999 INFO L168 Benchmark]: RCFGBuilder took 1058.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:21:11,999 INFO L168 Benchmark]: TraceAbstraction took 65548.97 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 87.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:21:12,001 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 751.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1058.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 65548.97 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 87.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 10:21:14,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:21:14,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:21:14,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:21:14,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:21:14,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:21:14,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:21:14,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:21:14,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:21:14,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:21:14,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:21:14,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:21:14,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:21:14,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:21:14,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:21:14,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:21:14,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:21:14,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:21:14,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:21:14,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:21:14,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:21:14,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:21:14,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:21:14,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:21:14,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:21:14,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:21:14,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:21:14,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:21:14,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:21:14,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:21:14,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:21:14,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:21:14,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:21:14,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:21:14,214 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:21:14,214 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:21:14,215 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:21:14,215 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:21:14,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:21:14,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:21:14,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:21:14,219 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 10:21:14,235 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:21:14,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:21:14,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:21:14,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:21:14,237 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:21:14,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:21:14,238 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:21:14,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:21:14,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:21:14,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:21:14,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:21:14,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:21:14,241 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 10:21:14,241 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 10:21:14,242 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:21:14,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:21:14,243 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:21:14,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:21:14,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:21:14,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:21:14,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:21:14,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:21:14,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:21:14,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:21:14,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:21:14,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:21:14,245 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 10:21:14,246 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 10:21:14,246 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:21:14,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 10:21:14,247 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_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/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 -> 221d8ee995a69c986b355f515c858471b19e54a2 [2019-11-20 10:21:14,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:21:14,594 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:21:14,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:21:14,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:21:14,602 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:21:14,603 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-11-20 10:21:14,668 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/data/e11c58a95/010b0691187445cb8761821e0ab41af0/FLAG96a26475a [2019-11-20 10:21:15,300 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:21:15,301 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-11-20 10:21:15,331 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/data/e11c58a95/010b0691187445cb8761821e0ab41af0/FLAG96a26475a [2019-11-20 10:21:15,436 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/data/e11c58a95/010b0691187445cb8761821e0ab41af0 [2019-11-20 10:21:15,439 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:21:15,440 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:21:15,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:21:15,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:21:15,445 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:21:15,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:21:15" (1/1) ... [2019-11-20 10:21:15,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1250310c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:21:15, skipping insertion in model container [2019-11-20 10:21:15,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:21:15" (1/1) ... [2019-11-20 10:21:15,456 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:21:15,532 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:21:16,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:21:16,130 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:21:16,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:21:16,320 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:21:16,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:21:16 WrapperNode [2019-11-20 10:21:16,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:21:16,322 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:21:16,322 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:21:16,322 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:21:16,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:21:16" (1/1) ... [2019-11-20 10:21:16,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:21:16" (1/1) ... [2019-11-20 10:21:16,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:21:16,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:21:16,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:21:16,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:21:16,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:21:16" (1/1) ... [2019-11-20 10:21:16,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:21:16" (1/1) ... [2019-11-20 10:21:16,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:21:16" (1/1) ... [2019-11-20 10:21:16,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:21:16" (1/1) ... [2019-11-20 10:21:16,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:21:16" (1/1) ... [2019-11-20 10:21:16,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:21:16" (1/1) ... [2019-11-20 10:21:16,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:21:16" (1/1) ... [2019-11-20 10:21:16,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:21:16,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:21:16,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:21:16,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:21:16,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:21:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:21:16,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 10:21:16,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:21:16,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 10:21:16,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 10:21:16,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 10:21:16,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:21:16,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:21:16,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 10:21:16,844 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 10:21:19,769 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 10:21:19,770 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 10:21:19,772 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:21:19,772 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:21:19,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:21:19 BoogieIcfgContainer [2019-11-20 10:21:19,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:21:19,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:21:19,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:21:19,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:21:19,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:21:15" (1/3) ... [2019-11-20 10:21:19,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127d44a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:21:19, skipping insertion in model container [2019-11-20 10:21:19,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:21:16" (2/3) ... [2019-11-20 10:21:19,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127d44a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:21:19, skipping insertion in model container [2019-11-20 10:21:19,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:21:19" (3/3) ... [2019-11-20 10:21:19,783 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-1.c [2019-11-20 10:21:19,794 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:21:19,802 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:21:19,814 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:21:19,843 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:21:19,843 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:21:19,843 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:21:19,844 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:21:19,844 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:21:19,844 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:21:19,845 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:21:19,845 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:21:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-20 10:21:19,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 10:21:19,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:21:19,877 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:21:19,878 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:21:19,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:21:19,885 INFO L82 PathProgramCache]: Analyzing trace with hash 62050873, now seen corresponding path program 1 times [2019-11-20 10:21:19,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:21:19,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1876641609] [2019-11-20 10:21:19,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:21:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:21:20,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:21:20,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:21:20,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:20,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:21:20,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:20,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:20,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:20,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:21:20,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:20,441 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:20,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:21:20,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:20,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:20,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:20,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:21:20,489 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 15 treesize of output 7 [2019-11-20 10:21:20,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:20,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:20,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:20,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:21:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:21:20,534 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:21:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:21:20,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1876641609] [2019-11-20 10:21:20,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:21:20,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:21:20,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660921252] [2019-11-20 10:21:20,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:21:20,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:21:20,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:21:20,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:21:20,661 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 6 states. [2019-11-20 10:21:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:21:31,083 INFO L93 Difference]: Finished difference Result 538 states and 918 transitions. [2019-11-20 10:21:31,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:21:31,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-20 10:21:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:21:31,105 INFO L225 Difference]: With dead ends: 538 [2019-11-20 10:21:31,106 INFO L226 Difference]: Without dead ends: 357 [2019-11-20 10:21:31,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:21:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-20 10:21:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 178. [2019-11-20 10:21:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-20 10:21:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 286 transitions. [2019-11-20 10:21:31,171 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 286 transitions. Word has length 43 [2019-11-20 10:21:31,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:21:31,172 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 286 transitions. [2019-11-20 10:21:31,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:21:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 286 transitions. [2019-11-20 10:21:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 10:21:31,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:21:31,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:21:31,379 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:21:31,379 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:21:31,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:21:31,380 INFO L82 PathProgramCache]: Analyzing trace with hash -56015273, now seen corresponding path program 1 times [2019-11-20 10:21:31,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:21:31,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [777745454] [2019-11-20 10:21:31,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:21:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:21:31,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:21:31,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:21:31,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:31,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:21:31,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:31,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:31,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:31,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:21:31,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:31,789 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:31,790 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:21:31,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:31,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:31,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:31,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:21:31,812 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 15 treesize of output 7 [2019-11-20 10:21:31,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:31,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:31,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:31,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:21:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:21:31,835 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:21:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:21:31,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [777745454] [2019-11-20 10:21:31,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:21:31,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:21:31,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179217549] [2019-11-20 10:21:31,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:21:31,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:21:31,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:21:31,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:21:31,909 INFO L87 Difference]: Start difference. First operand 178 states and 286 transitions. Second operand 6 states. [2019-11-20 10:21:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:21:41,620 INFO L93 Difference]: Finished difference Result 558 states and 889 transitions. [2019-11-20 10:21:41,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:21:41,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-11-20 10:21:41,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:21:41,627 INFO L225 Difference]: With dead ends: 558 [2019-11-20 10:21:41,627 INFO L226 Difference]: Without dead ends: 388 [2019-11-20 10:21:41,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:21:41,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-20 10:21:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 218. [2019-11-20 10:21:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-11-20 10:21:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 360 transitions. [2019-11-20 10:21:41,649 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 360 transitions. Word has length 44 [2019-11-20 10:21:41,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:21:41,650 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 360 transitions. [2019-11-20 10:21:41,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:21:41,650 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 360 transitions. [2019-11-20 10:21:41,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 10:21:41,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:21:41,654 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:21:41,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:21:41,858 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:21:41,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:21:41,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1051223893, now seen corresponding path program 1 times [2019-11-20 10:21:41,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:21:41,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [236510083] [2019-11-20 10:21:41,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:21:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:21:42,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:21:42,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:21:42,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:42,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:21:42,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:42,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:42,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:42,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:21:42,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:42,414 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:42,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:21:42,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:42,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:42,426 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:42,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:21:42,437 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:21:42,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:42,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:42,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:42,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:21:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:21:42,468 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:21:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:21:42,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [236510083] [2019-11-20 10:21:42,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:21:42,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:21:42,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906530555] [2019-11-20 10:21:42,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:21:42,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:21:42,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:21:42,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:21:42,547 INFO L87 Difference]: Start difference. First operand 218 states and 360 transitions. Second operand 6 states. [2019-11-20 10:21:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:21:48,818 INFO L93 Difference]: Finished difference Result 671 states and 1099 transitions. [2019-11-20 10:21:48,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:21:48,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-11-20 10:21:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:21:48,824 INFO L225 Difference]: With dead ends: 671 [2019-11-20 10:21:48,824 INFO L226 Difference]: Without dead ends: 461 [2019-11-20 10:21:48,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:21:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-11-20 10:21:48,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 282. [2019-11-20 10:21:48,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-20 10:21:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 476 transitions. [2019-11-20 10:21:48,848 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 476 transitions. Word has length 72 [2019-11-20 10:21:48,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:21:48,848 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 476 transitions. [2019-11-20 10:21:48,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:21:48,849 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 476 transitions. [2019-11-20 10:21:48,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 10:21:48,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:21:48,854 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:21:49,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:21:49,058 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:21:49,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:21:49,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1753956891, now seen corresponding path program 1 times [2019-11-20 10:21:49,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:21:49,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1763388392] [2019-11-20 10:21:49,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:21:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:21:49,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:21:49,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:21:49,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:49,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:21:49,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:49,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:49,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:49,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:21:49,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:49,531 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:49,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:21:49,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:49,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:49,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:49,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:21:49,559 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 15 treesize of output 7 [2019-11-20 10:21:49,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:49,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:49,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:49,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:21:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:21:49,598 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:21:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:21:49,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1763388392] [2019-11-20 10:21:49,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:21:49,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:21:49,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285942899] [2019-11-20 10:21:49,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:21:49,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:21:49,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:21:49,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:21:49,672 INFO L87 Difference]: Start difference. First operand 282 states and 476 transitions. Second operand 6 states. [2019-11-20 10:21:56,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:21:56,164 INFO L93 Difference]: Finished difference Result 763 states and 1260 transitions. [2019-11-20 10:21:56,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:21:56,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2019-11-20 10:21:56,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:21:56,168 INFO L225 Difference]: With dead ends: 763 [2019-11-20 10:21:56,168 INFO L226 Difference]: Without dead ends: 489 [2019-11-20 10:21:56,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:21:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-11-20 10:21:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 319. [2019-11-20 10:21:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-20 10:21:56,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 542 transitions. [2019-11-20 10:21:56,186 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 542 transitions. Word has length 77 [2019-11-20 10:21:56,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:21:56,187 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 542 transitions. [2019-11-20 10:21:56,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:21:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 542 transitions. [2019-11-20 10:21:56,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 10:21:56,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:21:56,193 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:21:56,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:21:56,406 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:21:56,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:21:56,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1972675417, now seen corresponding path program 1 times [2019-11-20 10:21:56,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:21:56,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [69358006] [2019-11-20 10:21:56,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:21:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:21:56,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:21:56,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:21:56,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:56,864 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:21:56,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:56,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:56,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:56,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:21:56,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:21:56,902 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:56,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:21:56,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:56,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:56,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:56,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:21:56,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 15 treesize of output 7 [2019-11-20 10:21:56,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:21:56,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:21:56,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:21:56,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:21:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:21:56,946 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:21:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:21:57,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [69358006] [2019-11-20 10:21:57,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:21:57,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:21:57,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144583536] [2019-11-20 10:21:57,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:21:57,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:21:57,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:21:57,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:21:57,009 INFO L87 Difference]: Start difference. First operand 319 states and 542 transitions. Second operand 6 states. [2019-11-20 10:22:05,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:22:05,051 INFO L93 Difference]: Finished difference Result 795 states and 1317 transitions. [2019-11-20 10:22:05,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:22:05,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-11-20 10:22:05,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:22:05,056 INFO L225 Difference]: With dead ends: 795 [2019-11-20 10:22:05,056 INFO L226 Difference]: Without dead ends: 484 [2019-11-20 10:22:05,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:22:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-11-20 10:22:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 319. [2019-11-20 10:22:05,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-11-20 10:22:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 540 transitions. [2019-11-20 10:22:05,081 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 540 transitions. Word has length 78 [2019-11-20 10:22:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:22:05,082 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 540 transitions. [2019-11-20 10:22:05,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:22:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 540 transitions. [2019-11-20 10:22:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-20 10:22:05,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:22:05,085 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:22:05,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:05,298 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:22:05,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:22:05,299 INFO L82 PathProgramCache]: Analyzing trace with hash 950146036, now seen corresponding path program 1 times [2019-11-20 10:22:05,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:22:05,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [527045898] [2019-11-20 10:22:05,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:22:05,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:22:05,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:22:05,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:22:05,937 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:22:05,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:05,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:05,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:05,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:22:05,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:22:05,963 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:05,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:22:05,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:05,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:05,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:05,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:22:05,982 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 15 treesize of output 7 [2019-11-20 10:22:05,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:05,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:05,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:05,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:22:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:22:06,002 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:22:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:22:06,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [527045898] [2019-11-20 10:22:06,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:22:06,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:22:06,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485210210] [2019-11-20 10:22:06,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:22:06,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:22:06,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:22:06,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:22:06,057 INFO L87 Difference]: Start difference. First operand 319 states and 540 transitions. Second operand 6 states. [2019-11-20 10:22:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:22:13,363 INFO L93 Difference]: Finished difference Result 835 states and 1382 transitions. [2019-11-20 10:22:13,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:22:13,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-20 10:22:13,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:22:13,369 INFO L225 Difference]: With dead ends: 835 [2019-11-20 10:22:13,369 INFO L226 Difference]: Without dead ends: 524 [2019-11-20 10:22:13,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:22:13,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-11-20 10:22:13,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 335. [2019-11-20 10:22:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-11-20 10:22:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 562 transitions. [2019-11-20 10:22:13,387 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 562 transitions. Word has length 85 [2019-11-20 10:22:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:22:13,389 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 562 transitions. [2019-11-20 10:22:13,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:22:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 562 transitions. [2019-11-20 10:22:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 10:22:13,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:22:13,392 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:22:13,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:13,598 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:22:13,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:22:13,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2051560873, now seen corresponding path program 1 times [2019-11-20 10:22:13,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:22:13,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [71458090] [2019-11-20 10:22:13,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:22:14,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:22:14,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:22:14,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:22:14,111 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:22:14,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:14,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:14,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:14,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:22:14,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:22:14,158 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:14,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:22:14,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:14,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:14,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:14,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:22:14,180 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 15 treesize of output 7 [2019-11-20 10:22:14,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:14,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:14,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:14,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:22:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:22:14,207 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:22:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:22:14,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [71458090] [2019-11-20 10:22:14,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:22:14,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:22:14,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585700707] [2019-11-20 10:22:14,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:22:14,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:22:14,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:22:14,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:22:14,283 INFO L87 Difference]: Start difference. First operand 335 states and 562 transitions. Second operand 6 states. [2019-11-20 10:22:20,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:22:20,501 INFO L93 Difference]: Finished difference Result 825 states and 1353 transitions. [2019-11-20 10:22:20,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:22:20,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-11-20 10:22:20,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:22:20,505 INFO L225 Difference]: With dead ends: 825 [2019-11-20 10:22:20,505 INFO L226 Difference]: Without dead ends: 498 [2019-11-20 10:22:20,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:22:20,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-20 10:22:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 335. [2019-11-20 10:22:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-11-20 10:22:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 557 transitions. [2019-11-20 10:22:20,519 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 557 transitions. Word has length 86 [2019-11-20 10:22:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:22:20,519 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 557 transitions. [2019-11-20 10:22:20,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:22:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 557 transitions. [2019-11-20 10:22:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 10:22:20,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:22:20,521 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:22:20,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:20,726 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:22:20,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:22:20,726 INFO L82 PathProgramCache]: Analyzing trace with hash 249927561, now seen corresponding path program 1 times [2019-11-20 10:22:20,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:22:20,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [138348774] [2019-11-20 10:22:20,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:22:20,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:22:20,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:22:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:22:20,910 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:22:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:22:20,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [138348774] [2019-11-20 10:22:20,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:22:20,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:22:20,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838152670] [2019-11-20 10:22:20,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:22:20,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:22:20,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:22:20,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:22:20,922 INFO L87 Difference]: Start difference. First operand 335 states and 557 transitions. Second operand 3 states. [2019-11-20 10:22:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:22:21,227 INFO L93 Difference]: Finished difference Result 982 states and 1640 transitions. [2019-11-20 10:22:21,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:22:21,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-20 10:22:21,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:22:21,232 INFO L225 Difference]: With dead ends: 982 [2019-11-20 10:22:21,232 INFO L226 Difference]: Without dead ends: 655 [2019-11-20 10:22:21,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:22:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-11-20 10:22:21,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-11-20 10:22:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-11-20 10:22:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1083 transitions. [2019-11-20 10:22:21,257 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1083 transitions. Word has length 86 [2019-11-20 10:22:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:22:21,258 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 1083 transitions. [2019-11-20 10:22:21,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:22:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1083 transitions. [2019-11-20 10:22:21,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 10:22:21,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:22:21,260 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:22:21,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:21,464 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:22:21,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:22:21,464 INFO L82 PathProgramCache]: Analyzing trace with hash -284914922, now seen corresponding path program 1 times [2019-11-20 10:22:21,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:22:21,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1110459617] [2019-11-20 10:22:21,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:22:21,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:22:21,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:22:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:22:21,671 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:22:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:22:21,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1110459617] [2019-11-20 10:22:21,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:22:21,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:22:21,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501429641] [2019-11-20 10:22:21,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:22:21,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:22:21,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:22:21,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:22:21,687 INFO L87 Difference]: Start difference. First operand 655 states and 1083 transitions. Second operand 3 states. [2019-11-20 10:22:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:22:22,637 INFO L93 Difference]: Finished difference Result 1623 states and 2694 transitions. [2019-11-20 10:22:22,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:22:22,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-11-20 10:22:22,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:22:22,645 INFO L225 Difference]: With dead ends: 1623 [2019-11-20 10:22:22,646 INFO L226 Difference]: Without dead ends: 976 [2019-11-20 10:22:22,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:22:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-11-20 10:22:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2019-11-20 10:22:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-11-20 10:22:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1610 transitions. [2019-11-20 10:22:22,680 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1610 transitions. Word has length 87 [2019-11-20 10:22:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:22:22,681 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1610 transitions. [2019-11-20 10:22:22,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:22:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1610 transitions. [2019-11-20 10:22:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 10:22:22,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:22:22,684 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:22:22,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:22,886 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:22:22,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:22:22,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1928645906, now seen corresponding path program 1 times [2019-11-20 10:22:22,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:22:22,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1835265281] [2019-11-20 10:22:22,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:22:23,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:22:23,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:22:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:22:23,118 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:22:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:22:23,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1835265281] [2019-11-20 10:22:23,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:22:23,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:22:23,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132228177] [2019-11-20 10:22:23,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:22:23,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:22:23,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:22:23,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:22:23,135 INFO L87 Difference]: Start difference. First operand 976 states and 1610 transitions. Second operand 3 states. [2019-11-20 10:22:24,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:22:24,021 INFO L93 Difference]: Finished difference Result 2266 states and 3750 transitions. [2019-11-20 10:22:24,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:22:24,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-20 10:22:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:22:24,029 INFO L225 Difference]: With dead ends: 2266 [2019-11-20 10:22:24,030 INFO L226 Difference]: Without dead ends: 1298 [2019-11-20 10:22:24,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:22:24,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2019-11-20 10:22:24,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2019-11-20 10:22:24,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1298 states. [2019-11-20 10:22:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 2138 transitions. [2019-11-20 10:22:24,069 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 2138 transitions. Word has length 88 [2019-11-20 10:22:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:22:24,070 INFO L462 AbstractCegarLoop]: Abstraction has 1298 states and 2138 transitions. [2019-11-20 10:22:24,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:22:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 2138 transitions. [2019-11-20 10:22:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 10:22:24,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:22:24,073 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:22:24,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:24,285 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:22:24,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:22:24,285 INFO L82 PathProgramCache]: Analyzing trace with hash 706785243, now seen corresponding path program 1 times [2019-11-20 10:22:24,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:22:24,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [424542830] [2019-11-20 10:22:24,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:22:24,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:22:24,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:22:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:22:24,537 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:22:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:22:24,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [424542830] [2019-11-20 10:22:24,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:22:24,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:22:24,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327690431] [2019-11-20 10:22:24,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:22:24,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:22:24,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:22:24,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:22:24,562 INFO L87 Difference]: Start difference. First operand 1298 states and 2138 transitions. Second operand 4 states. [2019-11-20 10:22:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:22:24,723 INFO L93 Difference]: Finished difference Result 3199 states and 5286 transitions. [2019-11-20 10:22:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:22:24,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-20 10:22:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:22:24,737 INFO L225 Difference]: With dead ends: 3199 [2019-11-20 10:22:24,737 INFO L226 Difference]: Without dead ends: 1909 [2019-11-20 10:22:24,739 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:22:24,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2019-11-20 10:22:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1901. [2019-11-20 10:22:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1901 states. [2019-11-20 10:22:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 3136 transitions. [2019-11-20 10:22:24,804 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 3136 transitions. Word has length 89 [2019-11-20 10:22:24,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:22:24,804 INFO L462 AbstractCegarLoop]: Abstraction has 1901 states and 3136 transitions. [2019-11-20 10:22:24,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:22:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 3136 transitions. [2019-11-20 10:22:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 10:22:24,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:22:24,808 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:22:25,011 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:25,011 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:22:25,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:22:25,012 INFO L82 PathProgramCache]: Analyzing trace with hash -190608035, now seen corresponding path program 1 times [2019-11-20 10:22:25,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:22:25,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1218048939] [2019-11-20 10:22:25,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:22:25,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:22:25,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:22:25,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:22:25,518 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:22:25,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:25,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:25,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:25,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:22:25,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:22:25,558 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:25,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:22:25,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:25,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:25,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:25,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:22:25,578 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 15 treesize of output 7 [2019-11-20 10:22:25,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:25,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:25,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:25,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:22:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:22:25,648 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:22:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:22:25,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1218048939] [2019-11-20 10:22:25,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:22:25,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:22:25,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675567586] [2019-11-20 10:22:25,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:22:25,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:22:25,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:22:25,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:22:25,708 INFO L87 Difference]: Start difference. First operand 1901 states and 3136 transitions. Second operand 6 states. [2019-11-20 10:22:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:22:31,687 INFO L93 Difference]: Finished difference Result 4563 states and 7388 transitions. [2019-11-20 10:22:31,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:22:31,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-11-20 10:22:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:22:31,705 INFO L225 Difference]: With dead ends: 4563 [2019-11-20 10:22:31,705 INFO L226 Difference]: Without dead ends: 2670 [2019-11-20 10:22:31,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:22:31,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2019-11-20 10:22:31,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2159. [2019-11-20 10:22:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2159 states. [2019-11-20 10:22:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 3574 transitions. [2019-11-20 10:22:31,782 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 3574 transitions. Word has length 89 [2019-11-20 10:22:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:22:31,782 INFO L462 AbstractCegarLoop]: Abstraction has 2159 states and 3574 transitions. [2019-11-20 10:22:31,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:22:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 3574 transitions. [2019-11-20 10:22:31,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 10:22:31,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:22:31,786 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:22:31,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:31,991 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:22:31,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:22:31,991 INFO L82 PathProgramCache]: Analyzing trace with hash -177439813, now seen corresponding path program 1 times [2019-11-20 10:22:31,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:22:31,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1610699843] [2019-11-20 10:22:31,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:22:32,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:22:32,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:22:32,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:22:32,470 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:22:32,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:32,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:32,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:32,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:22:32,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:22:32,494 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:32,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:22:32,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:32,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:32,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:32,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:22:32,509 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 15 treesize of output 7 [2019-11-20 10:22:32,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:32,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:32,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:32,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:22:32,535 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:22:32,535 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:22:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:22:32,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1610699843] [2019-11-20 10:22:32,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:22:32,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:22:32,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689129198] [2019-11-20 10:22:32,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:22:32,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:22:32,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:22:32,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:22:32,586 INFO L87 Difference]: Start difference. First operand 2159 states and 3574 transitions. Second operand 6 states. [2019-11-20 10:22:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:22:39,678 INFO L93 Difference]: Finished difference Result 4833 states and 7849 transitions. [2019-11-20 10:22:39,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:22:39,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-11-20 10:22:39,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:22:39,694 INFO L225 Difference]: With dead ends: 4833 [2019-11-20 10:22:39,694 INFO L226 Difference]: Without dead ends: 2668 [2019-11-20 10:22:39,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:22:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2019-11-20 10:22:39,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2171. [2019-11-20 10:22:39,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2171 states. [2019-11-20 10:22:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 3592 transitions. [2019-11-20 10:22:39,773 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 3592 transitions. Word has length 90 [2019-11-20 10:22:39,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:22:39,774 INFO L462 AbstractCegarLoop]: Abstraction has 2171 states and 3592 transitions. [2019-11-20 10:22:39,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:22:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3592 transitions. [2019-11-20 10:22:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 10:22:39,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:22:39,777 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:22:39,982 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:39,982 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:22:39,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:22:39,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1174626467, now seen corresponding path program 1 times [2019-11-20 10:22:39,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:22:39,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [895037632] [2019-11-20 10:22:39,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:22:40,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:22:40,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:22:40,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:22:40,628 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:22:40,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:40,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:40,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:40,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:22:40,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:22:40,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:40,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:22:40,653 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:40,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:40,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:40,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:22:40,664 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 15 treesize of output 7 [2019-11-20 10:22:40,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:40,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:40,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:40,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:22:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:22:40,686 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:22:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:22:40,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [895037632] [2019-11-20 10:22:40,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:22:40,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:22:40,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077826654] [2019-11-20 10:22:40,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:22:40,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:22:40,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:22:40,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:22:40,725 INFO L87 Difference]: Start difference. First operand 2171 states and 3592 transitions. Second operand 6 states. [2019-11-20 10:22:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:22:46,518 INFO L93 Difference]: Finished difference Result 4824 states and 7833 transitions. [2019-11-20 10:22:46,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:22:46,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-20 10:22:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:22:46,544 INFO L225 Difference]: With dead ends: 4824 [2019-11-20 10:22:46,544 INFO L226 Difference]: Without dead ends: 2661 [2019-11-20 10:22:46,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:22:46,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2019-11-20 10:22:46,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2171. [2019-11-20 10:22:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2171 states. [2019-11-20 10:22:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 3551 transitions. [2019-11-20 10:22:46,624 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 3551 transitions. Word has length 99 [2019-11-20 10:22:46,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:22:46,625 INFO L462 AbstractCegarLoop]: Abstraction has 2171 states and 3551 transitions. [2019-11-20 10:22:46,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:22:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3551 transitions. [2019-11-20 10:22:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 10:22:46,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:22:46,628 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:22:46,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:46,833 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:22:46,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:22:46,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1275331753, now seen corresponding path program 1 times [2019-11-20 10:22:46,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:22:46,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [168153005] [2019-11-20 10:22:46,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:22:47,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:22:47,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:22:47,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:22:47,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:22:47,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:47,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:47,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:47,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:22:47,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:22:47,355 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:47,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:22:47,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:47,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:47,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:47,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:22:47,380 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 15 treesize of output 7 [2019-11-20 10:22:47,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:47,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:47,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:47,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:22:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:22:47,416 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:22:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:22:47,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [168153005] [2019-11-20 10:22:47,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:22:47,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:22:47,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743669512] [2019-11-20 10:22:47,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:22:47,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:22:47,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:22:47,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:22:47,491 INFO L87 Difference]: Start difference. First operand 2171 states and 3551 transitions. Second operand 6 states. [2019-11-20 10:22:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:22:54,309 INFO L93 Difference]: Finished difference Result 5076 states and 8170 transitions. [2019-11-20 10:22:54,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:22:54,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-20 10:22:54,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:22:54,327 INFO L225 Difference]: With dead ends: 5076 [2019-11-20 10:22:54,327 INFO L226 Difference]: Without dead ends: 2913 [2019-11-20 10:22:54,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:22:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2019-11-20 10:22:54,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2351. [2019-11-20 10:22:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-11-20 10:22:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3828 transitions. [2019-11-20 10:22:54,409 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3828 transitions. Word has length 99 [2019-11-20 10:22:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:22:54,410 INFO L462 AbstractCegarLoop]: Abstraction has 2351 states and 3828 transitions. [2019-11-20 10:22:54,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:22:54,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3828 transitions. [2019-11-20 10:22:54,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 10:22:54,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:22:54,413 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:22:54,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:54,626 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:22:54,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:22:54,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1790280433, now seen corresponding path program 1 times [2019-11-20 10:22:54,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:22:54,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [905320060] [2019-11-20 10:22:54,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:22:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:22:55,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:22:55,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:22:55,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:22:55,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:22:55,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:55,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:55,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:55,188 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:22:55,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:22:55,202 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:55,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:22:55,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:55,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:55,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:55,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:22:55,215 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 15 treesize of output 7 [2019-11-20 10:22:55,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:22:55,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:22:55,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:22:55,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:22:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:22:55,233 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:22:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:22:55,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [905320060] [2019-11-20 10:22:55,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:22:55,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:22:55,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625340946] [2019-11-20 10:22:55,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:22:55,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:22:55,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:22:55,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:22:55,304 INFO L87 Difference]: Start difference. First operand 2351 states and 3828 transitions. Second operand 6 states. [2019-11-20 10:23:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:23:02,436 INFO L93 Difference]: Finished difference Result 5184 states and 8303 transitions. [2019-11-20 10:23:02,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:23:02,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-20 10:23:02,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:23:02,453 INFO L225 Difference]: With dead ends: 5184 [2019-11-20 10:23:02,453 INFO L226 Difference]: Without dead ends: 2841 [2019-11-20 10:23:02,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:23:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2019-11-20 10:23:02,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2351. [2019-11-20 10:23:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-11-20 10:23:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3781 transitions. [2019-11-20 10:23:02,534 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3781 transitions. Word has length 99 [2019-11-20 10:23:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:23:02,535 INFO L462 AbstractCegarLoop]: Abstraction has 2351 states and 3781 transitions. [2019-11-20 10:23:02,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:23:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3781 transitions. [2019-11-20 10:23:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 10:23:02,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:23:02,538 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:23:02,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:23:02,742 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:23:02,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:23:02,743 INFO L82 PathProgramCache]: Analyzing trace with hash -151554348, now seen corresponding path program 1 times [2019-11-20 10:23:02,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:23:02,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1622923084] [2019-11-20 10:23:02,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:23:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:23:03,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:23:03,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:23:03,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:23:03,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:23:03,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:03,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:03,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:03,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:23:03,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:23:03,406 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:03,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:23:03,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:03,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:03,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:03,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:23:03,420 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 15 treesize of output 7 [2019-11-20 10:23:03,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:03,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:03,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:03,423 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:23:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:23:03,446 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:23:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:23:03,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1622923084] [2019-11-20 10:23:03,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:23:03,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:23:03,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875105061] [2019-11-20 10:23:03,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:23:03,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:23:03,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:23:03,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:23:03,498 INFO L87 Difference]: Start difference. First operand 2351 states and 3781 transitions. Second operand 6 states. [2019-11-20 10:23:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:23:12,209 INFO L93 Difference]: Finished difference Result 5184 states and 8208 transitions. [2019-11-20 10:23:12,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:23:12,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-11-20 10:23:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:23:12,227 INFO L225 Difference]: With dead ends: 5184 [2019-11-20 10:23:12,227 INFO L226 Difference]: Without dead ends: 2841 [2019-11-20 10:23:12,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:23:12,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2019-11-20 10:23:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2351. [2019-11-20 10:23:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-11-20 10:23:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3734 transitions. [2019-11-20 10:23:12,300 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3734 transitions. Word has length 100 [2019-11-20 10:23:12,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:23:12,300 INFO L462 AbstractCegarLoop]: Abstraction has 2351 states and 3734 transitions. [2019-11-20 10:23:12,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:23:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3734 transitions. [2019-11-20 10:23:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 10:23:12,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:23:12,304 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:23:12,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:23:12,509 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:23:12,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:23:12,509 INFO L82 PathProgramCache]: Analyzing trace with hash -337470246, now seen corresponding path program 1 times [2019-11-20 10:23:12,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:23:12,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [923139185] [2019-11-20 10:23:12,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:23:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:23:12,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:23:12,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:23:12,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:23:12,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:23:12,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:12,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:12,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:12,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:23:13,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:23:13,011 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:13,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:23:13,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:13,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:13,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:13,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:23:13,023 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 15 treesize of output 7 [2019-11-20 10:23:13,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:13,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:13,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:13,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:23:13,044 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:23:13,044 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:23:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:23:13,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [923139185] [2019-11-20 10:23:13,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:23:13,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:23:13,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102019093] [2019-11-20 10:23:13,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:23:13,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:23:13,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:23:13,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:23:13,105 INFO L87 Difference]: Start difference. First operand 2351 states and 3734 transitions. Second operand 6 states. [2019-11-20 10:23:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:23:22,508 INFO L93 Difference]: Finished difference Result 5182 states and 8111 transitions. [2019-11-20 10:23:22,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:23:22,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-11-20 10:23:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:23:22,517 INFO L225 Difference]: With dead ends: 5182 [2019-11-20 10:23:22,517 INFO L226 Difference]: Without dead ends: 2839 [2019-11-20 10:23:22,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:23:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2019-11-20 10:23:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2351. [2019-11-20 10:23:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-11-20 10:23:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3699 transitions. [2019-11-20 10:23:22,584 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3699 transitions. Word has length 100 [2019-11-20 10:23:22,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:23:22,584 INFO L462 AbstractCegarLoop]: Abstraction has 2351 states and 3699 transitions. [2019-11-20 10:23:22,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:23:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3699 transitions. [2019-11-20 10:23:22,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 10:23:22,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:23:22,586 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:23:22,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:23:22,791 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:23:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:23:22,791 INFO L82 PathProgramCache]: Analyzing trace with hash -2145724330, now seen corresponding path program 1 times [2019-11-20 10:23:22,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:23:22,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [316691143] [2019-11-20 10:23:22,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:23:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:23:23,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:23:23,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:23:23,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:23:23,403 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:23:23,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:23,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:23,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:23,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:23:23,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:23:23,433 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:23,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:23:23,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:23,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:23,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:23,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:23:23,445 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 15 treesize of output 7 [2019-11-20 10:23:23,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:23,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:23,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:23,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:23:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:23:23,463 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:23:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:23:23,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [316691143] [2019-11-20 10:23:23,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:23:23,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:23:23,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169869988] [2019-11-20 10:23:23,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:23:23,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:23:23,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:23:23,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:23:23,515 INFO L87 Difference]: Start difference. First operand 2351 states and 3699 transitions. Second operand 6 states. [2019-11-20 10:23:30,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:23:30,406 INFO L93 Difference]: Finished difference Result 5182 states and 8040 transitions. [2019-11-20 10:23:30,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:23:30,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-11-20 10:23:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:23:30,415 INFO L225 Difference]: With dead ends: 5182 [2019-11-20 10:23:30,415 INFO L226 Difference]: Without dead ends: 2839 [2019-11-20 10:23:30,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:23:30,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2019-11-20 10:23:30,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2351. [2019-11-20 10:23:30,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-11-20 10:23:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3652 transitions. [2019-11-20 10:23:30,486 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3652 transitions. Word has length 101 [2019-11-20 10:23:30,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:23:30,486 INFO L462 AbstractCegarLoop]: Abstraction has 2351 states and 3652 transitions. [2019-11-20 10:23:30,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:23:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3652 transitions. [2019-11-20 10:23:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 10:23:30,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:23:30,489 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:23:30,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:23:30,694 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:23:30,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:23:30,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1467318247, now seen corresponding path program 1 times [2019-11-20 10:23:30,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:23:30,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1284639532] [2019-11-20 10:23:30,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:23:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:23:31,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:23:31,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:23:31,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:23:31,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:23:31,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:31,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:31,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:31,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:23:31,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:23:31,277 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:31,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:23:31,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:31,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:31,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:31,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:23:31,288 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 15 treesize of output 7 [2019-11-20 10:23:31,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:31,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:31,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:31,291 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:23:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:23:31,305 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:23:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 10:23:31,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1284639532] [2019-11-20 10:23:31,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:23:31,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:23:31,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695993377] [2019-11-20 10:23:31,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:23:31,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:23:31,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:23:31,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:23:31,366 INFO L87 Difference]: Start difference. First operand 2351 states and 3652 transitions. Second operand 6 states. [2019-11-20 10:23:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:23:38,713 INFO L93 Difference]: Finished difference Result 5112 states and 7854 transitions. [2019-11-20 10:23:38,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:23:38,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-11-20 10:23:38,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:23:38,720 INFO L225 Difference]: With dead ends: 5112 [2019-11-20 10:23:38,720 INFO L226 Difference]: Without dead ends: 2769 [2019-11-20 10:23:38,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:23:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2019-11-20 10:23:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 2351. [2019-11-20 10:23:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-11-20 10:23:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3605 transitions. [2019-11-20 10:23:38,801 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3605 transitions. Word has length 102 [2019-11-20 10:23:38,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:23:38,802 INFO L462 AbstractCegarLoop]: Abstraction has 2351 states and 3605 transitions. [2019-11-20 10:23:38,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:23:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3605 transitions. [2019-11-20 10:23:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 10:23:38,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:23:38,804 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:23:39,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:23:39,009 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:23:39,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:23:39,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1969129503, now seen corresponding path program 1 times [2019-11-20 10:23:39,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:23:39,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [707159353] [2019-11-20 10:23:39,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:23:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:23:39,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:23:39,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:23:39,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:23:39,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:23:39,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:39,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:39,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:39,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:23:39,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:23:39,694 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:39,694 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:23:39,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:39,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:39,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:39,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:23:39,714 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 15 treesize of output 7 [2019-11-20 10:23:39,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:39,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:39,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:39,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:23:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:23:39,742 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:23:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:23:39,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [707159353] [2019-11-20 10:23:39,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:23:39,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:23:39,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853735762] [2019-11-20 10:23:39,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:23:39,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:23:39,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:23:39,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:23:39,806 INFO L87 Difference]: Start difference. First operand 2351 states and 3605 transitions. Second operand 6 states. [2019-11-20 10:23:47,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:23:47,834 INFO L93 Difference]: Finished difference Result 5364 states and 8143 transitions. [2019-11-20 10:23:47,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:23:47,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-11-20 10:23:47,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:23:47,841 INFO L225 Difference]: With dead ends: 5364 [2019-11-20 10:23:47,841 INFO L226 Difference]: Without dead ends: 3021 [2019-11-20 10:23:47,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:23:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-11-20 10:23:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2519. [2019-11-20 10:23:47,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2519 states. [2019-11-20 10:23:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 3828 transitions. [2019-11-20 10:23:47,901 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 3828 transitions. Word has length 102 [2019-11-20 10:23:47,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:23:47,901 INFO L462 AbstractCegarLoop]: Abstraction has 2519 states and 3828 transitions. [2019-11-20 10:23:47,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:23:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 3828 transitions. [2019-11-20 10:23:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 10:23:47,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:23:47,903 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:23:48,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:23:48,104 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:23:48,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:23:48,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1137381406, now seen corresponding path program 1 times [2019-11-20 10:23:48,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:23:48,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1970818761] [2019-11-20 10:23:48,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:23:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:23:48,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:23:48,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:23:48,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:23:48,704 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:23:48,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:48,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:48,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:48,714 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:23:48,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:23:48,731 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:48,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:23:48,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:48,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:48,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:48,738 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:23:48,750 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 15 treesize of output 7 [2019-11-20 10:23:48,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:48,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:48,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:48,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:23:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:23:48,784 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:23:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 10:23:48,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1970818761] [2019-11-20 10:23:48,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:23:48,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:23:48,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337535492] [2019-11-20 10:23:48,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:23:48,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:23:48,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:23:48,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:23:48,852 INFO L87 Difference]: Start difference. First operand 2519 states and 3828 transitions. Second operand 6 states. [2019-11-20 10:23:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:23:57,448 INFO L93 Difference]: Finished difference Result 5440 states and 8191 transitions. [2019-11-20 10:23:57,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:23:57,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-11-20 10:23:57,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:23:57,454 INFO L225 Difference]: With dead ends: 5440 [2019-11-20 10:23:57,455 INFO L226 Difference]: Without dead ends: 2929 [2019-11-20 10:23:57,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:23:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2019-11-20 10:23:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2519. [2019-11-20 10:23:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2519 states. [2019-11-20 10:23:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 3787 transitions. [2019-11-20 10:23:57,542 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 3787 transitions. Word has length 103 [2019-11-20 10:23:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:23:57,542 INFO L462 AbstractCegarLoop]: Abstraction has 2519 states and 3787 transitions. [2019-11-20 10:23:57,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:23:57,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 3787 transitions. [2019-11-20 10:23:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-20 10:23:57,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:23:57,545 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:23:57,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:23:57,750 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:23:57,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:23:57,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1821597758, now seen corresponding path program 1 times [2019-11-20 10:23:57,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:23:57,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1608453872] [2019-11-20 10:23:57,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:23:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:23:58,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:23:58,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:23:58,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:23:58,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:23:58,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:58,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:58,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:58,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:23:58,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:23:58,273 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:58,273 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:23:58,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:58,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:58,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:58,281 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:23:58,291 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 15 treesize of output 7 [2019-11-20 10:23:58,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:23:58,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:23:58,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:23:58,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:23:58,322 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 10:23:58,322 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:23:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 10:23:58,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1608453872] [2019-11-20 10:23:58,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:23:58,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:23:58,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911420715] [2019-11-20 10:23:58,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:23:58,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:23:58,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:23:58,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:23:58,374 INFO L87 Difference]: Start difference. First operand 2519 states and 3787 transitions. Second operand 6 states. [2019-11-20 10:24:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:24:09,901 INFO L93 Difference]: Finished difference Result 5692 states and 8480 transitions. [2019-11-20 10:24:09,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:24:09,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-11-20 10:24:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:24:09,909 INFO L225 Difference]: With dead ends: 5692 [2019-11-20 10:24:09,910 INFO L226 Difference]: Without dead ends: 3181 [2019-11-20 10:24:09,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 211 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:24:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2019-11-20 10:24:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 2729. [2019-11-20 10:24:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2729 states. [2019-11-20 10:24:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 4081 transitions. [2019-11-20 10:24:10,008 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 4081 transitions. Word has length 109 [2019-11-20 10:24:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:24:10,008 INFO L462 AbstractCegarLoop]: Abstraction has 2729 states and 4081 transitions. [2019-11-20 10:24:10,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:24:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 4081 transitions. [2019-11-20 10:24:10,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 10:24:10,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:24:10,011 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:24:10,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:24:10,215 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:24:10,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:24:10,215 INFO L82 PathProgramCache]: Analyzing trace with hash -296364640, now seen corresponding path program 1 times [2019-11-20 10:24:10,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:24:10,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2078104197] [2019-11-20 10:24:10,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:24:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:24:10,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:24:10,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:24:10,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:24:10,727 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:24:10,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:24:10,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:10,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:24:10,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:24:10,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:24:10,773 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:10,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:24:10,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:24:10,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:10,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:24:10,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:24:10,794 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:24:10,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:24:10,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:10,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:24:10,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:24:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 10:24:10,820 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:24:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 10:24:10,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2078104197] [2019-11-20 10:24:10,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:24:10,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:24:10,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796126702] [2019-11-20 10:24:10,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:24:10,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:24:10,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:24:10,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:24:10,868 INFO L87 Difference]: Start difference. First operand 2729 states and 4081 transitions. Second operand 6 states. [2019-11-20 10:24:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:24:18,638 INFO L93 Difference]: Finished difference Result 5858 states and 8693 transitions. [2019-11-20 10:24:18,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:24:18,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2019-11-20 10:24:18,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:24:18,642 INFO L225 Difference]: With dead ends: 5858 [2019-11-20 10:24:18,642 INFO L226 Difference]: Without dead ends: 3137 [2019-11-20 10:24:18,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:24:18,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2019-11-20 10:24:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 2729. [2019-11-20 10:24:18,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2729 states. [2019-11-20 10:24:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 4057 transitions. [2019-11-20 10:24:18,802 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 4057 transitions. Word has length 110 [2019-11-20 10:24:18,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:24:18,803 INFO L462 AbstractCegarLoop]: Abstraction has 2729 states and 4057 transitions. [2019-11-20 10:24:18,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:24:18,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 4057 transitions. [2019-11-20 10:24:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 10:24:18,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:24:18,806 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:24:19,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:24:19,010 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:24:19,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:24:19,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1266941451, now seen corresponding path program 1 times [2019-11-20 10:24:19,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:24:19,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1517032550] [2019-11-20 10:24:19,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:24:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:24:19,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:24:19,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:24:19,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:24:19,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:24:19,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:24:19,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:19,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:24:19,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:24:19,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:24:19,884 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:19,885 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:24:19,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:24:19,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:19,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:24:19,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:24:19,902 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 15 treesize of output 7 [2019-11-20 10:24:19,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:24:19,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:19,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:24:19,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:24:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 10:24:19,925 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:24:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 10:24:19,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1517032550] [2019-11-20 10:24:19,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:24:19,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:24:19,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789671981] [2019-11-20 10:24:19,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:24:19,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:24:19,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:24:19,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:24:19,968 INFO L87 Difference]: Start difference. First operand 2729 states and 4057 transitions. Second operand 6 states. [2019-11-20 10:24:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:24:30,815 INFO L93 Difference]: Finished difference Result 6110 states and 9004 transitions. [2019-11-20 10:24:30,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:24:30,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-11-20 10:24:30,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:24:30,819 INFO L225 Difference]: With dead ends: 6110 [2019-11-20 10:24:30,819 INFO L226 Difference]: Without dead ends: 3389 [2019-11-20 10:24:30,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:24:30,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3389 states. [2019-11-20 10:24:30,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3389 to 2885. [2019-11-20 10:24:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2885 states. [2019-11-20 10:24:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4244 transitions. [2019-11-20 10:24:30,931 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4244 transitions. Word has length 130 [2019-11-20 10:24:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:24:30,931 INFO L462 AbstractCegarLoop]: Abstraction has 2885 states and 4244 transitions. [2019-11-20 10:24:30,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:24:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4244 transitions. [2019-11-20 10:24:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 10:24:30,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:24:30,935 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:24:31,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:24:31,140 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:24:31,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:24:31,141 INFO L82 PathProgramCache]: Analyzing trace with hash -315653806, now seen corresponding path program 1 times [2019-11-20 10:24:31,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:24:31,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [892425118] [2019-11-20 10:24:31,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:24:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:24:31,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:24:31,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:24:31,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:24:31,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:24:31,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:24:31,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:31,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:24:31,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:24:32,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:24:32,004 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:32,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:24:32,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:24:32,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:32,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:24:32,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:24:32,023 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 15 treesize of output 7 [2019-11-20 10:24:32,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:24:32,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:32,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:24:32,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:24:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 10:24:32,056 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:24:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 10:24:32,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [892425118] [2019-11-20 10:24:32,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:24:32,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:24:32,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990874369] [2019-11-20 10:24:32,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:24:32,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:24:32,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:24:32,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:24:32,118 INFO L87 Difference]: Start difference. First operand 2885 states and 4244 transitions. Second operand 6 states. [2019-11-20 10:24:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:24:39,925 INFO L93 Difference]: Finished difference Result 6168 states and 9014 transitions. [2019-11-20 10:24:39,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:24:39,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-11-20 10:24:39,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:24:39,928 INFO L225 Difference]: With dead ends: 6168 [2019-11-20 10:24:39,928 INFO L226 Difference]: Without dead ends: 3291 [2019-11-20 10:24:39,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:24:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3291 states. [2019-11-20 10:24:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3291 to 2885. [2019-11-20 10:24:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2885 states. [2019-11-20 10:24:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4191 transitions. [2019-11-20 10:24:39,997 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4191 transitions. Word has length 131 [2019-11-20 10:24:39,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:24:39,997 INFO L462 AbstractCegarLoop]: Abstraction has 2885 states and 4191 transitions. [2019-11-20 10:24:39,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:24:39,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4191 transitions. [2019-11-20 10:24:39,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-20 10:24:39,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:24:39,999 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:24:40,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:24:40,201 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:24:40,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:24:40,201 INFO L82 PathProgramCache]: Analyzing trace with hash 242060838, now seen corresponding path program 1 times [2019-11-20 10:24:40,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:24:40,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1024627065] [2019-11-20 10:24:40,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:24:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:24:40,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:24:40,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:24:40,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:24:40,775 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:24:40,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:24:40,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:40,785 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:24:40,785 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:24:40,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:24:40,806 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:40,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:24:40,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:24:40,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:40,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:24:40,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:24:40,818 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 15 treesize of output 7 [2019-11-20 10:24:40,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:24:40,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:40,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:24:40,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:24:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 10:24:40,847 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:24:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 10:24:40,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1024627065] [2019-11-20 10:24:40,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:24:40,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:24:40,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574649458] [2019-11-20 10:24:40,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:24:40,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:24:40,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:24:40,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:24:40,892 INFO L87 Difference]: Start difference. First operand 2885 states and 4191 transitions. Second operand 6 states. [2019-11-20 10:24:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:24:51,962 INFO L93 Difference]: Finished difference Result 6427 states and 9262 transitions. [2019-11-20 10:24:51,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:24:51,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-11-20 10:24:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:24:51,965 INFO L225 Difference]: With dead ends: 6427 [2019-11-20 10:24:51,966 INFO L226 Difference]: Without dead ends: 3550 [2019-11-20 10:24:51,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:24:51,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3550 states. [2019-11-20 10:24:52,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3550 to 3138. [2019-11-20 10:24:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2019-11-20 10:24:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 4528 transitions. [2019-11-20 10:24:52,102 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 4528 transitions. Word has length 133 [2019-11-20 10:24:52,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:24:52,102 INFO L462 AbstractCegarLoop]: Abstraction has 3138 states and 4528 transitions. [2019-11-20 10:24:52,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:24:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 4528 transitions. [2019-11-20 10:24:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 10:24:52,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:24:52,105 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:24:52,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:24:52,305 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:24:52,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:24:52,306 INFO L82 PathProgramCache]: Analyzing trace with hash -956871644, now seen corresponding path program 1 times [2019-11-20 10:24:52,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:24:52,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2127849295] [2019-11-20 10:24:52,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:24:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:24:52,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:24:52,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:24:52,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:24:52,877 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:24:52,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:24:52,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:52,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:24:52,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:24:52,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:24:52,935 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:52,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:24:52,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:24:52,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:52,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:24:52,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:24:52,954 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 15 treesize of output 7 [2019-11-20 10:24:52,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:24:52,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:24:52,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:24:52,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:24:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 10:24:52,991 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:24:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-20 10:24:53,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2127849295] [2019-11-20 10:24:53,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:24:53,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:24:53,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903023554] [2019-11-20 10:24:53,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:24:53,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:24:53,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:24:53,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:24:53,042 INFO L87 Difference]: Start difference. First operand 3138 states and 4528 transitions. Second operand 6 states. [2019-11-20 10:25:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:25:01,645 INFO L93 Difference]: Finished difference Result 6673 states and 9579 transitions. [2019-11-20 10:25:01,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:25:01,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-11-20 10:25:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:25:01,649 INFO L225 Difference]: With dead ends: 6673 [2019-11-20 10:25:01,649 INFO L226 Difference]: Without dead ends: 3487 [2019-11-20 10:25:01,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:25:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2019-11-20 10:25:01,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3085. [2019-11-20 10:25:01,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3085 states. [2019-11-20 10:25:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 3085 states and 4439 transitions. [2019-11-20 10:25:01,732 INFO L78 Accepts]: Start accepts. Automaton has 3085 states and 4439 transitions. Word has length 134 [2019-11-20 10:25:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:25:01,732 INFO L462 AbstractCegarLoop]: Abstraction has 3085 states and 4439 transitions. [2019-11-20 10:25:01,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:25:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 4439 transitions. [2019-11-20 10:25:01,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-20 10:25:01,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:25:01,734 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:25:01,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:01,935 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:25:01,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:25:01,935 INFO L82 PathProgramCache]: Analyzing trace with hash -280251575, now seen corresponding path program 1 times [2019-11-20 10:25:01,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:25:01,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [41351275] [2019-11-20 10:25:01,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:25:02,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:25:02,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:25:02,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:25:02,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:25:02,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:02,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:02,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:02,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:25:02,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:25:02,529 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:02,530 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:25:02,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:02,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:02,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:02,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:25:02,549 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 15 treesize of output 7 [2019-11-20 10:25:02,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:02,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:02,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:02,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:25:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:25:02,587 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:25:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:25:02,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [41351275] [2019-11-20 10:25:02,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:25:02,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:25:02,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508021662] [2019-11-20 10:25:02,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:25:02,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:25:02,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:25:02,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:25:02,711 INFO L87 Difference]: Start difference. First operand 3085 states and 4439 transitions. Second operand 6 states. [2019-11-20 10:25:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:25:07,015 INFO L93 Difference]: Finished difference Result 6763 states and 9686 transitions. [2019-11-20 10:25:07,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:25:07,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-11-20 10:25:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:25:07,019 INFO L225 Difference]: With dead ends: 6763 [2019-11-20 10:25:07,019 INFO L226 Difference]: Without dead ends: 3686 [2019-11-20 10:25:07,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 275 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:25:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2019-11-20 10:25:07,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3283. [2019-11-20 10:25:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3283 states. [2019-11-20 10:25:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3283 states to 3283 states and 4691 transitions. [2019-11-20 10:25:07,113 INFO L78 Accepts]: Start accepts. Automaton has 3283 states and 4691 transitions. Word has length 141 [2019-11-20 10:25:07,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:25:07,113 INFO L462 AbstractCegarLoop]: Abstraction has 3283 states and 4691 transitions. [2019-11-20 10:25:07,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:25:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3283 states and 4691 transitions. [2019-11-20 10:25:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-20 10:25:07,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:25:07,116 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:25:07,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:07,316 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:25:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:25:07,316 INFO L82 PathProgramCache]: Analyzing trace with hash -234940985, now seen corresponding path program 1 times [2019-11-20 10:25:07,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:25:07,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [576952107] [2019-11-20 10:25:07,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:25:07,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:25:07,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:25:07,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:25:07,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:25:07,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:07,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:07,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:07,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:25:07,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:25:07,895 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:07,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:25:07,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:07,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:07,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:07,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:25:07,906 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 15 treesize of output 7 [2019-11-20 10:25:07,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:07,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:07,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:07,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:25:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:25:07,943 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:25:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-20 10:25:08,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [576952107] [2019-11-20 10:25:08,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:25:08,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:25:08,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199768710] [2019-11-20 10:25:08,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:25:08,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:25:08,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:25:08,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:25:08,030 INFO L87 Difference]: Start difference. First operand 3283 states and 4691 transitions. Second operand 6 states. [2019-11-20 10:25:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:25:14,181 INFO L93 Difference]: Finished difference Result 6951 states and 9890 transitions. [2019-11-20 10:25:14,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:25:14,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-11-20 10:25:14,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:25:14,186 INFO L225 Difference]: With dead ends: 6951 [2019-11-20 10:25:14,186 INFO L226 Difference]: Without dead ends: 3613 [2019-11-20 10:25:14,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:25:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2019-11-20 10:25:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3220. [2019-11-20 10:25:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3220 states. [2019-11-20 10:25:14,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3220 states to 3220 states and 4562 transitions. [2019-11-20 10:25:14,281 INFO L78 Accepts]: Start accepts. Automaton has 3220 states and 4562 transitions. Word has length 142 [2019-11-20 10:25:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:25:14,281 INFO L462 AbstractCegarLoop]: Abstraction has 3220 states and 4562 transitions. [2019-11-20 10:25:14,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:25:14,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3220 states and 4562 transitions. [2019-11-20 10:25:14,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 10:25:14,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:25:14,283 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:25:14,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:14,484 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:25:14,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:25:14,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1489284318, now seen corresponding path program 1 times [2019-11-20 10:25:14,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:25:14,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [575967580] [2019-11-20 10:25:14,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:25:15,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:25:15,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:25:15,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:25:15,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:25:15,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:15,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:15,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:15,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:25:15,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:25:15,648 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:15,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:25:15,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:15,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:15,660 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:15,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:25:15,664 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 15 treesize of output 7 [2019-11-20 10:25:15,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:15,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:15,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:15,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:25:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 10:25:15,693 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:25:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 10:25:15,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [575967580] [2019-11-20 10:25:15,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:25:15,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:25:15,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845896532] [2019-11-20 10:25:15,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:25:15,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:25:15,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:25:15,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:25:15,742 INFO L87 Difference]: Start difference. First operand 3220 states and 4562 transitions. Second operand 6 states. [2019-11-20 10:25:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:25:23,532 INFO L93 Difference]: Finished difference Result 6966 states and 9844 transitions. [2019-11-20 10:25:23,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:25:23,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-11-20 10:25:23,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:25:23,538 INFO L225 Difference]: With dead ends: 6966 [2019-11-20 10:25:23,538 INFO L226 Difference]: Without dead ends: 3754 [2019-11-20 10:25:23,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:25:23,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2019-11-20 10:25:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3364. [2019-11-20 10:25:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3364 states. [2019-11-20 10:25:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 4707 transitions. [2019-11-20 10:25:23,691 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 4707 transitions. Word has length 152 [2019-11-20 10:25:23,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:25:23,691 INFO L462 AbstractCegarLoop]: Abstraction has 3364 states and 4707 transitions. [2019-11-20 10:25:23,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:25:23,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 4707 transitions. [2019-11-20 10:25:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-20 10:25:23,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:25:23,693 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:25:23,898 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:23,898 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:25:23,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:25:23,898 INFO L82 PathProgramCache]: Analyzing trace with hash 749481243, now seen corresponding path program 1 times [2019-11-20 10:25:23,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:25:23,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [109179546] [2019-11-20 10:25:23,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:25:25,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:25:25,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:25:25,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:25:25,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:25:25,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:25,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:25,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:25,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:25:25,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:25:25,088 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:25,088 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:25:25,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:25,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:25,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:25,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:25:25,099 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 15 treesize of output 7 [2019-11-20 10:25:25,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:25,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:25,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:25,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:25:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 10:25:25,131 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:25:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 10:25:25,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [109179546] [2019-11-20 10:25:25,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:25:25,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:25:25,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032910748] [2019-11-20 10:25:25,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:25:25,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:25:25,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:25:25,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:25:25,212 INFO L87 Difference]: Start difference. First operand 3364 states and 4707 transitions. Second operand 6 states. [2019-11-20 10:25:33,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:25:33,290 INFO L93 Difference]: Finished difference Result 7100 states and 9906 transitions. [2019-11-20 10:25:33,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:25:33,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-11-20 10:25:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:25:33,296 INFO L225 Difference]: With dead ends: 7100 [2019-11-20 10:25:33,296 INFO L226 Difference]: Without dead ends: 3730 [2019-11-20 10:25:33,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 299 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:25:33,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3730 states. [2019-11-20 10:25:33,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3730 to 3350. [2019-11-20 10:25:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3350 states. [2019-11-20 10:25:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 4616 transitions. [2019-11-20 10:25:33,480 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 4616 transitions. Word has length 153 [2019-11-20 10:25:33,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:25:33,480 INFO L462 AbstractCegarLoop]: Abstraction has 3350 states and 4616 transitions. [2019-11-20 10:25:33,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:25:33,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 4616 transitions. [2019-11-20 10:25:33,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-20 10:25:33,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:25:33,482 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:25:33,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:33,686 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:25:33,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:25:33,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1457204437, now seen corresponding path program 1 times [2019-11-20 10:25:33,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:25:33,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [949111457] [2019-11-20 10:25:33,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:25:34,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:25:34,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:25:34,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:25:34,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:25:34,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:34,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:34,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:34,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:25:34,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:25:34,414 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:34,415 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:25:34,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:34,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:34,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:34,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:25:34,429 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:25:34,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:34,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:34,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:34,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:25:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-20 10:25:34,459 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:25:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-20 10:25:34,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [949111457] [2019-11-20 10:25:34,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:25:34,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:25:34,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849598274] [2019-11-20 10:25:34,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:25:34,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:25:34,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:25:34,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:25:34,501 INFO L87 Difference]: Start difference. First operand 3350 states and 4616 transitions. Second operand 6 states. [2019-11-20 10:25:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:25:41,328 INFO L93 Difference]: Finished difference Result 7185 states and 9886 transitions. [2019-11-20 10:25:41,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:25:41,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-11-20 10:25:41,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:25:41,333 INFO L225 Difference]: With dead ends: 7185 [2019-11-20 10:25:41,334 INFO L226 Difference]: Without dead ends: 3843 [2019-11-20 10:25:41,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:25:41,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3843 states. [2019-11-20 10:25:41,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3843 to 3460. [2019-11-20 10:25:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3460 states. [2019-11-20 10:25:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 4699 transitions. [2019-11-20 10:25:41,443 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 4699 transitions. Word has length 155 [2019-11-20 10:25:41,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:25:41,443 INFO L462 AbstractCegarLoop]: Abstraction has 3460 states and 4699 transitions. [2019-11-20 10:25:41,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:25:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 4699 transitions. [2019-11-20 10:25:41,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 10:25:41,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:25:41,446 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:25:41,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:41,647 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:25:41,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:25:41,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1829002542, now seen corresponding path program 1 times [2019-11-20 10:25:41,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:25:41,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [754972534] [2019-11-20 10:25:41,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:25:42,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 10:25:42,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:25:42,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:25:42,396 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 10:25:42,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:42,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:42,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:42,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 10:25:42,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:25:42,425 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:42,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 10:25:42,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:42,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:42,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:42,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 10:25:42,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 10:25:42,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:25:42,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:25:42,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:25:42,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 10:25:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-20 10:25:42,464 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:25:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-20 10:25:42,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [754972534] [2019-11-20 10:25:42,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:25:42,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:25:42,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083801994] [2019-11-20 10:25:42,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:25:42,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:25:42,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:25:42,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:25:42,544 INFO L87 Difference]: Start difference. First operand 3460 states and 4699 transitions. Second operand 6 states. [2019-11-20 10:25:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:25:48,904 INFO L93 Difference]: Finished difference Result 6688 states and 9079 transitions. [2019-11-20 10:25:48,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:25:48,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-11-20 10:25:48,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:25:48,909 INFO L225 Difference]: With dead ends: 6688 [2019-11-20 10:25:48,909 INFO L226 Difference]: Without dead ends: 3222 [2019-11-20 10:25:48,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 305 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:25:48,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3222 states. [2019-11-20 10:25:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3222 to 2907. [2019-11-20 10:25:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2907 states. [2019-11-20 10:25:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 3889 transitions. [2019-11-20 10:25:49,001 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 3889 transitions. Word has length 156 [2019-11-20 10:25:49,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:25:49,001 INFO L462 AbstractCegarLoop]: Abstraction has 2907 states and 3889 transitions. [2019-11-20 10:25:49,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:25:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 3889 transitions. [2019-11-20 10:25:49,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-20 10:25:49,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:25:49,003 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:25:49,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:49,204 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:25:49,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:25:49,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1485969295, now seen corresponding path program 1 times [2019-11-20 10:25:49,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:25:49,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1540636691] [2019-11-20 10:25:49,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:25:49,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:25:49,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:25:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:25:49,457 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:25:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 10:25:49,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1540636691] [2019-11-20 10:25:49,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:25:49,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:25:49,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488327551] [2019-11-20 10:25:49,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:25:49,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:25:49,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:25:49,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:25:49,557 INFO L87 Difference]: Start difference. First operand 2907 states and 3889 transitions. Second operand 3 states. [2019-11-20 10:25:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:25:50,374 INFO L93 Difference]: Finished difference Result 6331 states and 8474 transitions. [2019-11-20 10:25:50,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:25:50,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-11-20 10:25:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:25:50,380 INFO L225 Difference]: With dead ends: 6331 [2019-11-20 10:25:50,381 INFO L226 Difference]: Without dead ends: 3456 [2019-11-20 10:25:50,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:25:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3456 states. [2019-11-20 10:25:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3456 to 3454. [2019-11-20 10:25:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3454 states. [2019-11-20 10:25:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4617 transitions. [2019-11-20 10:25:50,488 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4617 transitions. Word has length 169 [2019-11-20 10:25:50,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:25:50,488 INFO L462 AbstractCegarLoop]: Abstraction has 3454 states and 4617 transitions. [2019-11-20 10:25:50,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:25:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4617 transitions. [2019-11-20 10:25:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 10:25:50,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:25:50,490 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:25:50,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:50,691 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:25:50,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:25:50,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1946569725, now seen corresponding path program 1 times [2019-11-20 10:25:50,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:25:50,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1073409834] [2019-11-20 10:25:50,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:25:50,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:25:50,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:25:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-20 10:25:50,952 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:25:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-20 10:25:50,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1073409834] [2019-11-20 10:25:50,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:25:50,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:25:50,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747688253] [2019-11-20 10:25:50,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:25:50,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:25:50,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:25:50,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:25:50,975 INFO L87 Difference]: Start difference. First operand 3454 states and 4617 transitions. Second operand 3 states. [2019-11-20 10:25:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:25:51,410 INFO L93 Difference]: Finished difference Result 7416 states and 9922 transitions. [2019-11-20 10:25:51,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:25:51,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-20 10:25:51,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:25:51,414 INFO L225 Difference]: With dead ends: 7416 [2019-11-20 10:25:51,414 INFO L226 Difference]: Without dead ends: 3994 [2019-11-20 10:25:51,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:25:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2019-11-20 10:25:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3970. [2019-11-20 10:25:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3970 states. [2019-11-20 10:25:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3970 states to 3970 states and 5316 transitions. [2019-11-20 10:25:51,524 INFO L78 Accepts]: Start accepts. Automaton has 3970 states and 5316 transitions. Word has length 170 [2019-11-20 10:25:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:25:51,524 INFO L462 AbstractCegarLoop]: Abstraction has 3970 states and 5316 transitions. [2019-11-20 10:25:51,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:25:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3970 states and 5316 transitions. [2019-11-20 10:25:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 10:25:51,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:25:51,527 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:25:51,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:51,728 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:25:51,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:25:51,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1401697151, now seen corresponding path program 1 times [2019-11-20 10:25:51,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:25:51,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [174307289] [2019-11-20 10:25:51,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:25:51,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:25:51,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:25:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-20 10:25:51,978 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:25:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-20 10:25:51,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [174307289] [2019-11-20 10:25:51,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:25:51,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:25:51,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262541032] [2019-11-20 10:25:51,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:25:51,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:25:51,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:25:51,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:25:51,997 INFO L87 Difference]: Start difference. First operand 3970 states and 5316 transitions. Second operand 3 states. [2019-11-20 10:25:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:25:53,832 INFO L93 Difference]: Finished difference Result 7957 states and 10657 transitions. [2019-11-20 10:25:53,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:25:53,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-11-20 10:25:53,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:25:53,837 INFO L225 Difference]: With dead ends: 7957 [2019-11-20 10:25:53,837 INFO L226 Difference]: Without dead ends: 4019 [2019-11-20 10:25:53,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:25:53,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2019-11-20 10:25:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 4019. [2019-11-20 10:25:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4019 states. [2019-11-20 10:25:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4019 states to 4019 states and 5382 transitions. [2019-11-20 10:25:54,164 INFO L78 Accepts]: Start accepts. Automaton has 4019 states and 5382 transitions. Word has length 170 [2019-11-20 10:25:54,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:25:54,164 INFO L462 AbstractCegarLoop]: Abstraction has 4019 states and 5382 transitions. [2019-11-20 10:25:54,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:25:54,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4019 states and 5382 transitions. [2019-11-20 10:25:54,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-20 10:25:54,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:25:54,168 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:25:54,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:54,372 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:25:54,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:25:54,374 INFO L82 PathProgramCache]: Analyzing trace with hash 725002316, now seen corresponding path program 1 times [2019-11-20 10:25:54,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:25:54,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [186863210] [2019-11-20 10:25:54,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1a71a2b-c8ca-4826-bb1f-75b62675eb4f/bin/uautomizer/cvc4 Starting monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:25:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:25:58,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-20 10:25:58,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:25:59,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-20 10:25:59,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:01,827 WARN L191 SmtUtils]: Spent 2.69 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 10:26:01,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:01,830 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_375|, |v_#memory_$Pointer$.base_375|], 2=[|v_#memory_$Pointer$.offset_368|, |v_#memory_$Pointer$.offset_369|, |v_#memory_$Pointer$.base_369|, |v_#memory_$Pointer$.base_368|]} [2019-11-20 10:26:02,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:02,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:02,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:02,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:02,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:02,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:02,454 INFO L237 Elim1Store]: Index analysis took 476 ms [2019-11-20 10:26:02,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 10:26:02,967 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:04,461 WARN L191 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 10:26:04,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:04,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:04,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:04,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:04,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:04,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:04,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:04,721 INFO L237 Elim1Store]: Index analysis took 202 ms [2019-11-20 10:26:04,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 10:26:04,953 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:05,715 WARN L191 SmtUtils]: Spent 761.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-20 10:26:05,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:05,728 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:06,110 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 10:26:06,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-20 10:26:06,192 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,384 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 10:26:06,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:26:06,419 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 10:26:06,514 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,554 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,554 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:156, output treesize:23 [2019-11-20 10:26:06,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 10:26:06,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:26:06,600 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,609 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,609 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 10:26:06,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,619 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 10:26:06,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:26:06,644 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,653 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 10:26:06,664 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:06,767 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 10:26:06,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,772 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:06,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,848 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-20 10:26:06,848 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2019-11-20 10:26:06,892 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,909 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-20 10:26:06,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,920 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:26:06,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 10:26:06,943 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,960 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 10:26:06,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 10:26:06,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:06,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:26:06,990 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:06,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:26:06,999 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-20 10:26:07,019 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:07,154 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 10:26:07,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:07,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:07,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:07,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:07,174 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-20 10:26:07,174 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:07,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:07,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:07,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:26:07,243 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:07,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:07,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:07,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:26:07,270 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:07,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:07,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:26:07,283 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-20 10:26:07,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:07,297 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2019-11-20 10:26:07,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:07,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:07,318 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-11-20 10:26:07,318 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:07,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:07,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:26:07,327 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:23 [2019-11-20 10:26:07,339 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:07,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:07,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:07,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:07,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:07,446 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-11-20 10:26:07,446 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:07,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:07,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:07,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:26:07,508 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:07,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:07,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:07,542 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:26:07,543 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:07,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:07,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:26:07,569 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-20 10:26:07,578 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 80 [2019-11-20 10:26:07,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:07,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:07,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:07,607 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-11-20 10:26:07,608 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:07,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:07,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:26:07,624 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:23 [2019-11-20 10:26:07,629 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_448|], 2=[|v_#memory_$Pointer$.offset_373|, |v_#memory_$Pointer$.offset_385|, |v_#memory_$Pointer$.base_385|, |v_#memory_$Pointer$.base_373|], 6=[|v_#memory_$Pointer$.offset_374|, |v_#memory_$Pointer$.base_374|]} [2019-11-20 10:26:07,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:07,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:07,822 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-11-20 10:26:07,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:09,119 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 75 [2019-11-20 10:26:09,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:09,146 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:09,943 WARN L191 SmtUtils]: Spent 796.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-20 10:26:09,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:10,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:10,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:26:10,076 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:10,687 WARN L191 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 10:26:10,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:10,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:10,790 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-20 10:26:10,791 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:11,053 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 10:26:11,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:11,060 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:11,273 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-20 10:26:11,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:11,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:11,280 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 109 [2019-11-20 10:26:11,280 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:11,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:11,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:11,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:11,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:11,370 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 62 [2019-11-20 10:26:11,371 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:11,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:11,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:26:11,401 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:306, output treesize:62 [2019-11-20 10:26:11,430 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_386|, |v_#memory_$Pointer$.base_386|], 12=[|v_#memory_int_449|]} [2019-11-20 10:26:11,434 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 62 treesize of output 44 [2019-11-20 10:26:11,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:11,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:11,463 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 47 treesize of output 29 [2019-11-20 10:26:11,463 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:11,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:11,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 10:26:11,490 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 0 case distinctions, treesize of input 43 treesize of output 35 [2019-11-20 10:26:11,491 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:11,505 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:11,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:11,506 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:33 [2019-11-20 10:26:11,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 10:26:11,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:11,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:11,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 10:26:11,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:3 [2019-11-20 10:26:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:26:11,886 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:26:11,959 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_373|, |v_#memory_$Pointer$.base_388|, |v_#memory_$Pointer$.offset_388|, |v_#memory_$Pointer$.base_373|], 3=[|#memory_int|], 6=[|v_#memory_$Pointer$.offset_374|, |v_#memory_$Pointer$.base_374|]} [2019-11-20 10:26:11,996 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:12,857 WARN L191 SmtUtils]: Spent 859.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-20 10:26:12,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:12,886 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:13,393 WARN L191 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-20 10:26:13,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:13,409 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:13,570 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-20 10:26:13,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:13,575 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:13,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:13,675 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 1748 treesize of output 1412 [2019-11-20 10:26:13,677 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 10:26:14,574 WARN L191 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-11-20 10:26:14,574 INFO L567 ElimStorePlain]: treesize reduction 1115, result has 22.4 percent of original size [2019-11-20 10:26:14,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,597 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:14,875 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 10:26:14,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:14,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:14,885 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:15,069 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 10:26:15,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:15,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:15,074 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:309, output treesize:500 [2019-11-20 10:26:15,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:26:15,186 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:15,233 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:15,288 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:15,315 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:17,210 WARN L191 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 120 DAG size of output: 119 [2019-11-20 10:26:17,211 INFO L567 ElimStorePlain]: treesize reduction 245, result has 88.3 percent of original size [2019-11-20 10:26:17,235 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:17,279 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:17,310 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:17,345 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:19,188 WARN L191 SmtUtils]: Spent 1.84 s on a formula simplification that was a NOOP. DAG size: 136 [2019-11-20 10:26:19,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:19,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 28 dim-0 vars, and 4 xjuncts. [2019-11-20 10:26:19,190 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:1227, output treesize:2625 [2019-11-20 10:26:32,523 WARN L191 SmtUtils]: Spent 8.73 s on a formula simplification. DAG size of input: 154 DAG size of output: 45 [2019-11-20 10:26:32,547 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_372|, |v_#memory_$Pointer$.offset_372|], 6=[|v_#memory_$Pointer$.offset_390|], 14=[|v_#memory_$Pointer$.base_390|]} [2019-11-20 10:26:32,567 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:32,743 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-20 10:26:32,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:32,755 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:32,878 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 10:26:32,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:32,882 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:33,014 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 10:26:33,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:33,016 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:33,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:33,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:33,059 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:393, output treesize:792 [2019-11-20 10:26:38,219 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_391|], 14=[|v_#memory_$Pointer$.base_391|]} [2019-11-20 10:26:38,227 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:38,383 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 10:26:38,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:38,385 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:38,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:38,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:38,431 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:413, output treesize:1432 [2019-11-20 10:26:44,579 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_371|, |v_#memory_$Pointer$.offset_371|], 19=[|v_#memory_$Pointer$.offset_392|], 31=[|v_#memory_$Pointer$.base_392|]} [2019-11-20 10:26:44,638 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:45,470 WARN L191 SmtUtils]: Spent 832.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-20 10:26:45,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:45,493 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:46,068 WARN L191 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-20 10:26:46,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:46,072 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:46,425 WARN L191 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-20 10:26:46,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:46,431 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:46,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 10:26:46,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 1 xjuncts. [2019-11-20 10:26:46,490 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:1513, output treesize:3832 [2019-11-20 10:26:55,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:26:55,909 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 10:26:55,913 INFO L168 Benchmark]: Toolchain (without parser) took 340473.02 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.1 MB). Free memory was 949.7 MB in the beginning and 1.0 GB in the end (delta: -64.4 MB). Peak memory consumption was 283.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:26:55,913 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:26:55,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 880.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:26:55,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:26:55,915 INFO L168 Benchmark]: Boogie Preprocessor took 133.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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:26:55,917 INFO L168 Benchmark]: RCFGBuilder took 3230.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.7 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:26:55,920 INFO L168 Benchmark]: TraceAbstraction took 336136.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.3 MB). Peak memory consumption was 196.0 MB. Max. memory is 11.5 GB. [2019-11-20 10:26:55,924 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 880.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 133.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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3230.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.7 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 336136.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.3 MB). Peak memory consumption was 196.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...