./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_13.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_657d7563-1b03-4c3b-adeb-620adfaa5f6a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_657d7563-1b03-4c3b-adeb-620adfaa5f6a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_657d7563-1b03-4c3b-adeb-620adfaa5f6a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_657d7563-1b03-4c3b-adeb-620adfaa5f6a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_657d7563-1b03-4c3b-adeb-620adfaa5f6a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_657d7563-1b03-4c3b-adeb-620adfaa5f6a/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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 23:17:53,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:17:53,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:17:53,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:17:53,275 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:17:53,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:17:53,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:17:53,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:17:53,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:17:53,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:17:53,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:17:53,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:17:53,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:17:53,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:17:53,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:17:53,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:17:53,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:17:53,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:17:53,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:17:53,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:17:53,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:17:53,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:17:53,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:17:53,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:17:53,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:17:53,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:17:53,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:17:53,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:17:53,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:17:53,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:17:53,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:17:53,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:17:53,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:17:53,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:17:53,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:17:53,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:17:53,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:17:53,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:17:53,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:17:53,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:17:53,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:17:53,340 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_657d7563-1b03-4c3b-adeb-620adfaa5f6a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:17:53,366 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:17:53,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:17:53,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:17:53,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:17:53,378 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:17:53,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:17:53,379 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:17:53,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:17:53,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:17:53,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:17:53,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:17:53,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:17:53,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:17:53,381 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:17:53,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:17:53,381 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:17:53,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:17:53,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:17:53,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:17:53,382 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:17:53,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:17:53,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:17:53,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:17:53,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:17:53,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:17:53,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:17:53,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:17:53,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:17:53,386 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_657d7563-1b03-4c3b-adeb-620adfaa5f6a/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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2019-11-19 23:17:53,572 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:17:53,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:17:53,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:17:53,592 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:17:53,592 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:17:53,593 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_657d7563-1b03-4c3b-adeb-620adfaa5f6a/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_13.c [2019-11-19 23:17:53,655 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_657d7563-1b03-4c3b-adeb-620adfaa5f6a/bin/uautomizer/data/b30e05d14/7bf057f25d904fd2b56f52d5fe38df5e/FLAG678ee7b7e [2019-11-19 23:17:53,995 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:17:53,996 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_657d7563-1b03-4c3b-adeb-620adfaa5f6a/sv-benchmarks/c/locks/test_locks_13.c [2019-11-19 23:17:54,003 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_657d7563-1b03-4c3b-adeb-620adfaa5f6a/bin/uautomizer/data/b30e05d14/7bf057f25d904fd2b56f52d5fe38df5e/FLAG678ee7b7e [2019-11-19 23:17:54,375 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_657d7563-1b03-4c3b-adeb-620adfaa5f6a/bin/uautomizer/data/b30e05d14/7bf057f25d904fd2b56f52d5fe38df5e [2019-11-19 23:17:54,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:17:54,378 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:17:54,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:17:54,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:17:54,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:17:54,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:17:54" (1/1) ... [2019-11-19 23:17:54,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a068185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:17:54, skipping insertion in model container [2019-11-19 23:17:54,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:17:54" (1/1) ... [2019-11-19 23:17:54,396 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:17:54,435 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:17:54,674 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:17:54,678 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:17:54,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:17:54,819 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:17:54,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:17:54 WrapperNode [2019-11-19 23:17:54,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:17:54,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:17:54,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:17:54,821 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:17:54,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:17:54" (1/1) ... [2019-11-19 23:17:54,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:17:54" (1/1) ... [2019-11-19 23:17:54,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:17:54,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:17:54,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:17:54,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:17:54,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:17:54" (1/1) ... [2019-11-19 23:17:54,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:17:54" (1/1) ... [2019-11-19 23:17:54,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:17:54" (1/1) ... [2019-11-19 23:17:54,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:17:54" (1/1) ... [2019-11-19 23:17:54,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:17:54" (1/1) ... [2019-11-19 23:17:54,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:17:54" (1/1) ... [2019-11-19 23:17:54,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:17:54" (1/1) ... [2019-11-19 23:17:54,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:17:54,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:17:54,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:17:54,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:17:54,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:17:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_657d7563-1b03-4c3b-adeb-620adfaa5f6a/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-19 23:17:54,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:17:54,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:17:55,437 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:17:55,438 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-19 23:17:55,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:17:55 BoogieIcfgContainer [2019-11-19 23:17:55,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:17:55,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:17:55,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:17:55,443 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:17:55,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:17:54" (1/3) ... [2019-11-19 23:17:55,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1519e5b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:17:55, skipping insertion in model container [2019-11-19 23:17:55,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:17:54" (2/3) ... [2019-11-19 23:17:55,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1519e5b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:17:55, skipping insertion in model container [2019-11-19 23:17:55,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:17:55" (3/3) ... [2019-11-19 23:17:55,447 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-11-19 23:17:55,456 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:17:55,461 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:17:55,470 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:17:55,493 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:17:55,493 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:17:55,493 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:17:55,494 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:17:55,494 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:17:55,494 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:17:55,494 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:17:55,494 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:17:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-11-19 23:17:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 23:17:55,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:55,515 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:17:55,516 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:55,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:55,521 INFO L82 PathProgramCache]: Analyzing trace with hash -677951942, now seen corresponding path program 1 times [2019-11-19 23:17:55,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:55,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211956301] [2019-11-19 23:17:55,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:55,709 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-19 23:17:55,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211956301] [2019-11-19 23:17:55,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:55,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:55,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691340356] [2019-11-19 23:17:55,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:55,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:55,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:55,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:55,734 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2019-11-19 23:17:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:55,786 INFO L93 Difference]: Finished difference Result 100 states and 180 transitions. [2019-11-19 23:17:55,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:55,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-19 23:17:55,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:55,799 INFO L225 Difference]: With dead ends: 100 [2019-11-19 23:17:55,800 INFO L226 Difference]: Without dead ends: 86 [2019-11-19 23:17:55,803 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-19 23:17:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-19 23:17:55,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 58. [2019-11-19 23:17:55,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-19 23:17:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 109 transitions. [2019-11-19 23:17:55,842 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 109 transitions. Word has length 19 [2019-11-19 23:17:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:55,843 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 109 transitions. [2019-11-19 23:17:55,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 109 transitions. [2019-11-19 23:17:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 23:17:55,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:55,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:17:55,844 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:55,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:55,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1699020296, now seen corresponding path program 1 times [2019-11-19 23:17:55,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:55,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096337041] [2019-11-19 23:17:55,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:55,920 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-19 23:17:55,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096337041] [2019-11-19 23:17:55,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:55,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:55,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330035901] [2019-11-19 23:17:55,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:55,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:55,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:55,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:55,924 INFO L87 Difference]: Start difference. First operand 58 states and 109 transitions. Second operand 3 states. [2019-11-19 23:17:55,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:55,958 INFO L93 Difference]: Finished difference Result 143 states and 268 transitions. [2019-11-19 23:17:55,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:55,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-19 23:17:55,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:55,962 INFO L225 Difference]: With dead ends: 143 [2019-11-19 23:17:55,962 INFO L226 Difference]: Without dead ends: 86 [2019-11-19 23:17:55,963 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-19 23:17:55,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-19 23:17:55,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-11-19 23:17:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-19 23:17:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 157 transitions. [2019-11-19 23:17:55,978 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 157 transitions. Word has length 19 [2019-11-19 23:17:55,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:55,978 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 157 transitions. [2019-11-19 23:17:55,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 157 transitions. [2019-11-19 23:17:55,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 23:17:55,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:55,980 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] [2019-11-19 23:17:55,980 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:55,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:55,980 INFO L82 PathProgramCache]: Analyzing trace with hash 458538653, now seen corresponding path program 1 times [2019-11-19 23:17:55,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:55,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465636467] [2019-11-19 23:17:55,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:56,047 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-19 23:17:56,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465636467] [2019-11-19 23:17:56,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:56,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:56,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759714096] [2019-11-19 23:17:56,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:56,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:56,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:56,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:56,049 INFO L87 Difference]: Start difference. First operand 84 states and 157 transitions. Second operand 3 states. [2019-11-19 23:17:56,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:56,071 INFO L93 Difference]: Finished difference Result 131 states and 239 transitions. [2019-11-19 23:17:56,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:56,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-19 23:17:56,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:56,073 INFO L225 Difference]: With dead ends: 131 [2019-11-19 23:17:56,074 INFO L226 Difference]: Without dead ends: 89 [2019-11-19 23:17:56,074 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-19 23:17:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-19 23:17:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-11-19 23:17:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-19 23:17:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 159 transitions. [2019-11-19 23:17:56,083 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 159 transitions. Word has length 20 [2019-11-19 23:17:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:56,083 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 159 transitions. [2019-11-19 23:17:56,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 159 transitions. [2019-11-19 23:17:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 23:17:56,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:56,084 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] [2019-11-19 23:17:56,085 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:56,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:56,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1129809249, now seen corresponding path program 1 times [2019-11-19 23:17:56,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:56,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651968022] [2019-11-19 23:17:56,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:56,169 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-19 23:17:56,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651968022] [2019-11-19 23:17:56,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:56,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:56,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205748375] [2019-11-19 23:17:56,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:56,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:56,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:56,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:56,170 INFO L87 Difference]: Start difference. First operand 87 states and 159 transitions. Second operand 3 states. [2019-11-19 23:17:56,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:56,202 INFO L93 Difference]: Finished difference Result 168 states and 308 transitions. [2019-11-19 23:17:56,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:56,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-19 23:17:56,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:56,205 INFO L225 Difference]: With dead ends: 168 [2019-11-19 23:17:56,205 INFO L226 Difference]: Without dead ends: 166 [2019-11-19 23:17:56,205 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-19 23:17:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-19 23:17:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 116. [2019-11-19 23:17:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-19 23:17:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 212 transitions. [2019-11-19 23:17:56,217 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 212 transitions. Word has length 20 [2019-11-19 23:17:56,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:56,218 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 212 transitions. [2019-11-19 23:17:56,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 212 transitions. [2019-11-19 23:17:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 23:17:56,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:56,219 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] [2019-11-19 23:17:56,220 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:56,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2144089693, now seen corresponding path program 1 times [2019-11-19 23:17:56,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:56,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68870887] [2019-11-19 23:17:56,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:56,254 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-19 23:17:56,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68870887] [2019-11-19 23:17:56,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:56,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:56,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621746129] [2019-11-19 23:17:56,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:56,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:56,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:56,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:56,256 INFO L87 Difference]: Start difference. First operand 116 states and 212 transitions. Second operand 3 states. [2019-11-19 23:17:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:56,284 INFO L93 Difference]: Finished difference Result 280 states and 514 transitions. [2019-11-19 23:17:56,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:56,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-19 23:17:56,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:56,288 INFO L225 Difference]: With dead ends: 280 [2019-11-19 23:17:56,288 INFO L226 Difference]: Without dead ends: 168 [2019-11-19 23:17:56,289 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-19 23:17:56,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-19 23:17:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2019-11-19 23:17:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-19 23:17:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 302 transitions. [2019-11-19 23:17:56,303 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 302 transitions. Word has length 20 [2019-11-19 23:17:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:56,303 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 302 transitions. [2019-11-19 23:17:56,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 302 transitions. [2019-11-19 23:17:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 23:17:56,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:56,305 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] [2019-11-19 23:17:56,305 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:56,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:56,306 INFO L82 PathProgramCache]: Analyzing trace with hash -664135635, now seen corresponding path program 1 times [2019-11-19 23:17:56,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:56,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699679174] [2019-11-19 23:17:56,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:56,373 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-19 23:17:56,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699679174] [2019-11-19 23:17:56,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:56,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:56,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553055438] [2019-11-19 23:17:56,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:56,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:56,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:56,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:56,375 INFO L87 Difference]: Start difference. First operand 166 states and 302 transitions. Second operand 3 states. [2019-11-19 23:17:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:56,391 INFO L93 Difference]: Finished difference Result 251 states and 453 transitions. [2019-11-19 23:17:56,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:56,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-19 23:17:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:56,394 INFO L225 Difference]: With dead ends: 251 [2019-11-19 23:17:56,394 INFO L226 Difference]: Without dead ends: 170 [2019-11-19 23:17:56,395 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-19 23:17:56,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-19 23:17:56,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2019-11-19 23:17:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-19 23:17:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 302 transitions. [2019-11-19 23:17:56,406 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 302 transitions. Word has length 21 [2019-11-19 23:17:56,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:56,408 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 302 transitions. [2019-11-19 23:17:56,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 302 transitions. [2019-11-19 23:17:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 23:17:56,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:56,410 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] [2019-11-19 23:17:56,410 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:56,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:56,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2042483759, now seen corresponding path program 1 times [2019-11-19 23:17:56,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:56,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816930995] [2019-11-19 23:17:56,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:56,451 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-19 23:17:56,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816930995] [2019-11-19 23:17:56,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:56,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:56,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059201086] [2019-11-19 23:17:56,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:56,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:56,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:56,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:56,453 INFO L87 Difference]: Start difference. First operand 168 states and 302 transitions. Second operand 3 states. [2019-11-19 23:17:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:56,486 INFO L93 Difference]: Finished difference Result 488 states and 880 transitions. [2019-11-19 23:17:56,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:56,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-19 23:17:56,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:56,489 INFO L225 Difference]: With dead ends: 488 [2019-11-19 23:17:56,489 INFO L226 Difference]: Without dead ends: 326 [2019-11-19 23:17:56,490 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-19 23:17:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-19 23:17:56,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2019-11-19 23:17:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-19 23:17:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 578 transitions. [2019-11-19 23:17:56,507 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 578 transitions. Word has length 21 [2019-11-19 23:17:56,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:56,507 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 578 transitions. [2019-11-19 23:17:56,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 578 transitions. [2019-11-19 23:17:56,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 23:17:56,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:56,510 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] [2019-11-19 23:17:56,510 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:56,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:56,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1231415183, now seen corresponding path program 1 times [2019-11-19 23:17:56,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:56,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325308841] [2019-11-19 23:17:56,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:56,552 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-19 23:17:56,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325308841] [2019-11-19 23:17:56,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:56,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:56,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80668443] [2019-11-19 23:17:56,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:56,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:56,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:56,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:56,554 INFO L87 Difference]: Start difference. First operand 324 states and 578 transitions. Second operand 3 states. [2019-11-19 23:17:56,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:56,580 INFO L93 Difference]: Finished difference Result 416 states and 748 transitions. [2019-11-19 23:17:56,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:56,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-19 23:17:56,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:56,583 INFO L225 Difference]: With dead ends: 416 [2019-11-19 23:17:56,584 INFO L226 Difference]: Without dead ends: 414 [2019-11-19 23:17:56,584 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-19 23:17:56,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-11-19 23:17:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 324. [2019-11-19 23:17:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-19 23:17:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 574 transitions. [2019-11-19 23:17:56,602 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 574 transitions. Word has length 21 [2019-11-19 23:17:56,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:56,602 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 574 transitions. [2019-11-19 23:17:56,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 574 transitions. [2019-11-19 23:17:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 23:17:56,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:56,612 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] [2019-11-19 23:17:56,613 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:56,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:56,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1107299854, now seen corresponding path program 1 times [2019-11-19 23:17:56,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:56,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388372438] [2019-11-19 23:17:56,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:56,667 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-19 23:17:56,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388372438] [2019-11-19 23:17:56,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:56,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:56,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146693437] [2019-11-19 23:17:56,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:56,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:56,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:56,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:56,669 INFO L87 Difference]: Start difference. First operand 324 states and 574 transitions. Second operand 3 states. [2019-11-19 23:17:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:56,698 INFO L93 Difference]: Finished difference Result 612 states and 1096 transitions. [2019-11-19 23:17:56,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:56,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-19 23:17:56,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:56,706 INFO L225 Difference]: With dead ends: 612 [2019-11-19 23:17:56,707 INFO L226 Difference]: Without dead ends: 610 [2019-11-19 23:17:56,708 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-19 23:17:56,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-11-19 23:17:56,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 448. [2019-11-19 23:17:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-19 23:17:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 782 transitions. [2019-11-19 23:17:56,733 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 782 transitions. Word has length 22 [2019-11-19 23:17:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:56,733 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 782 transitions. [2019-11-19 23:17:56,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 782 transitions. [2019-11-19 23:17:56,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 23:17:56,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:56,736 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] [2019-11-19 23:17:56,737 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:56,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:56,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2128368208, now seen corresponding path program 1 times [2019-11-19 23:17:56,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:56,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998894488] [2019-11-19 23:17:56,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:56,786 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-19 23:17:56,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998894488] [2019-11-19 23:17:56,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:56,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:56,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454248222] [2019-11-19 23:17:56,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:56,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:56,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:56,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:56,788 INFO L87 Difference]: Start difference. First operand 448 states and 782 transitions. Second operand 3 states. [2019-11-19 23:17:56,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:56,828 INFO L93 Difference]: Finished difference Result 1076 states and 1888 transitions. [2019-11-19 23:17:56,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:56,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-19 23:17:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:56,837 INFO L225 Difference]: With dead ends: 1076 [2019-11-19 23:17:56,837 INFO L226 Difference]: Without dead ends: 634 [2019-11-19 23:17:56,838 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-19 23:17:56,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-11-19 23:17:56,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2019-11-19 23:17:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-11-19 23:17:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1098 transitions. [2019-11-19 23:17:56,866 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1098 transitions. Word has length 22 [2019-11-19 23:17:56,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:56,870 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 1098 transitions. [2019-11-19 23:17:56,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1098 transitions. [2019-11-19 23:17:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 23:17:56,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:56,874 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] [2019-11-19 23:17:56,875 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:56,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:56,875 INFO L82 PathProgramCache]: Analyzing trace with hash 33656292, now seen corresponding path program 1 times [2019-11-19 23:17:56,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:56,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736383495] [2019-11-19 23:17:56,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:56,904 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-19 23:17:56,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736383495] [2019-11-19 23:17:56,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:56,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:56,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019551884] [2019-11-19 23:17:56,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:56,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:56,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:56,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:56,906 INFO L87 Difference]: Start difference. First operand 632 states and 1098 transitions. Second operand 3 states. [2019-11-19 23:17:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:56,927 INFO L93 Difference]: Finished difference Result 956 states and 1656 transitions. [2019-11-19 23:17:56,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:56,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-19 23:17:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:56,932 INFO L225 Difference]: With dead ends: 956 [2019-11-19 23:17:56,932 INFO L226 Difference]: Without dead ends: 646 [2019-11-19 23:17:56,933 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-19 23:17:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-11-19 23:17:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 644. [2019-11-19 23:17:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-11-19 23:17:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1106 transitions. [2019-11-19 23:17:56,953 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1106 transitions. Word has length 23 [2019-11-19 23:17:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:56,953 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 1106 transitions. [2019-11-19 23:17:56,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1106 transitions. [2019-11-19 23:17:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 23:17:56,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:56,955 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] [2019-11-19 23:17:56,955 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:56,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:56,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1554691610, now seen corresponding path program 1 times [2019-11-19 23:17:56,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:56,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552645788] [2019-11-19 23:17:56,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:56,978 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-19 23:17:56,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552645788] [2019-11-19 23:17:56,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:56,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:56,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498350209] [2019-11-19 23:17:56,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:56,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:56,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:56,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:56,980 INFO L87 Difference]: Start difference. First operand 644 states and 1106 transitions. Second operand 3 states. [2019-11-19 23:17:57,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:57,008 INFO L93 Difference]: Finished difference Result 1192 states and 2076 transitions. [2019-11-19 23:17:57,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:57,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-19 23:17:57,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:57,016 INFO L225 Difference]: With dead ends: 1192 [2019-11-19 23:17:57,016 INFO L226 Difference]: Without dead ends: 1190 [2019-11-19 23:17:57,017 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-19 23:17:57,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2019-11-19 23:17:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 900. [2019-11-19 23:17:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-11-19 23:17:57,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1514 transitions. [2019-11-19 23:17:57,054 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1514 transitions. Word has length 23 [2019-11-19 23:17:57,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:57,054 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1514 transitions. [2019-11-19 23:17:57,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:57,054 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1514 transitions. [2019-11-19 23:17:57,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 23:17:57,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:57,056 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] [2019-11-19 23:17:57,057 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:57,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:57,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1719207332, now seen corresponding path program 1 times [2019-11-19 23:17:57,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:57,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837638973] [2019-11-19 23:17:57,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:57,079 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-19 23:17:57,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837638973] [2019-11-19 23:17:57,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:57,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:57,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206430748] [2019-11-19 23:17:57,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:57,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:57,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:57,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:57,081 INFO L87 Difference]: Start difference. First operand 900 states and 1514 transitions. Second operand 3 states. [2019-11-19 23:17:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:57,117 INFO L93 Difference]: Finished difference Result 2136 states and 3612 transitions. [2019-11-19 23:17:57,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:57,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-19 23:17:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:57,126 INFO L225 Difference]: With dead ends: 2136 [2019-11-19 23:17:57,126 INFO L226 Difference]: Without dead ends: 1254 [2019-11-19 23:17:57,128 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-19 23:17:57,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2019-11-19 23:17:57,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1252. [2019-11-19 23:17:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2019-11-19 23:17:57,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 2098 transitions. [2019-11-19 23:17:57,174 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 2098 transitions. Word has length 23 [2019-11-19 23:17:57,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:57,175 INFO L462 AbstractCegarLoop]: Abstraction has 1252 states and 2098 transitions. [2019-11-19 23:17:57,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:57,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 2098 transitions. [2019-11-19 23:17:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 23:17:57,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:57,177 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] [2019-11-19 23:17:57,178 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:57,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:57,178 INFO L82 PathProgramCache]: Analyzing trace with hash -950585915, now seen corresponding path program 1 times [2019-11-19 23:17:57,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:57,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813977825] [2019-11-19 23:17:57,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:57,218 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-19 23:17:57,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813977825] [2019-11-19 23:17:57,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:57,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:57,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959047830] [2019-11-19 23:17:57,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:57,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:57,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:57,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:57,220 INFO L87 Difference]: Start difference. First operand 1252 states and 2098 transitions. Second operand 3 states. [2019-11-19 23:17:57,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:57,253 INFO L93 Difference]: Finished difference Result 1880 states and 3140 transitions. [2019-11-19 23:17:57,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:57,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-19 23:17:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:57,262 INFO L225 Difference]: With dead ends: 1880 [2019-11-19 23:17:57,262 INFO L226 Difference]: Without dead ends: 1270 [2019-11-19 23:17:57,264 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-19 23:17:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-11-19 23:17:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1268. [2019-11-19 23:17:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2019-11-19 23:17:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 2098 transitions. [2019-11-19 23:17:57,310 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 2098 transitions. Word has length 24 [2019-11-19 23:17:57,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:57,311 INFO L462 AbstractCegarLoop]: Abstraction has 1268 states and 2098 transitions. [2019-11-19 23:17:57,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 2098 transitions. [2019-11-19 23:17:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 23:17:57,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:57,314 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] [2019-11-19 23:17:57,314 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:57,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:57,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1756033479, now seen corresponding path program 1 times [2019-11-19 23:17:57,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:57,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943974933] [2019-11-19 23:17:57,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:57,341 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-19 23:17:57,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943974933] [2019-11-19 23:17:57,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:57,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:57,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396878198] [2019-11-19 23:17:57,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:57,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:57,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:57,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:57,343 INFO L87 Difference]: Start difference. First operand 1268 states and 2098 transitions. Second operand 3 states. [2019-11-19 23:17:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:57,384 INFO L93 Difference]: Finished difference Result 2312 states and 3892 transitions. [2019-11-19 23:17:57,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:57,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-19 23:17:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:57,399 INFO L225 Difference]: With dead ends: 2312 [2019-11-19 23:17:57,399 INFO L226 Difference]: Without dead ends: 2310 [2019-11-19 23:17:57,402 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-19 23:17:57,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-11-19 23:17:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1796. [2019-11-19 23:17:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2019-11-19 23:17:57,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2898 transitions. [2019-11-19 23:17:57,482 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2898 transitions. Word has length 24 [2019-11-19 23:17:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:57,483 INFO L462 AbstractCegarLoop]: Abstraction has 1796 states and 2898 transitions. [2019-11-19 23:17:57,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:57,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2898 transitions. [2019-11-19 23:17:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 23:17:57,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:57,487 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] [2019-11-19 23:17:57,487 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:57,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:57,487 INFO L82 PathProgramCache]: Analyzing trace with hash 734965125, now seen corresponding path program 1 times [2019-11-19 23:17:57,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:57,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741720498] [2019-11-19 23:17:57,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:57,513 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-19 23:17:57,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741720498] [2019-11-19 23:17:57,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:57,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:57,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005045020] [2019-11-19 23:17:57,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:57,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:57,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:57,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:57,515 INFO L87 Difference]: Start difference. First operand 1796 states and 2898 transitions. Second operand 3 states. [2019-11-19 23:17:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:57,569 INFO L93 Difference]: Finished difference Result 4232 states and 6868 transitions. [2019-11-19 23:17:57,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:57,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-19 23:17:57,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:57,585 INFO L225 Difference]: With dead ends: 4232 [2019-11-19 23:17:57,585 INFO L226 Difference]: Without dead ends: 2470 [2019-11-19 23:17:57,588 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-19 23:17:57,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2019-11-19 23:17:57,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2468. [2019-11-19 23:17:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2468 states. [2019-11-19 23:17:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3970 transitions. [2019-11-19 23:17:57,664 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3970 transitions. Word has length 24 [2019-11-19 23:17:57,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:57,665 INFO L462 AbstractCegarLoop]: Abstraction has 2468 states and 3970 transitions. [2019-11-19 23:17:57,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:57,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3970 transitions. [2019-11-19 23:17:57,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 23:17:57,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:57,668 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] [2019-11-19 23:17:57,668 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:57,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:57,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1397322919, now seen corresponding path program 1 times [2019-11-19 23:17:57,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:57,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096783309] [2019-11-19 23:17:57,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:57,700 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-19 23:17:57,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096783309] [2019-11-19 23:17:57,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:57,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:57,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787646956] [2019-11-19 23:17:57,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:57,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:57,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:57,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:57,702 INFO L87 Difference]: Start difference. First operand 2468 states and 3970 transitions. Second operand 3 states. [2019-11-19 23:17:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:57,747 INFO L93 Difference]: Finished difference Result 3704 states and 5940 transitions. [2019-11-19 23:17:57,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:57,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-19 23:17:57,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:57,762 INFO L225 Difference]: With dead ends: 3704 [2019-11-19 23:17:57,763 INFO L226 Difference]: Without dead ends: 2502 [2019-11-19 23:17:57,765 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-19 23:17:57,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-11-19 23:17:57,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 2500. [2019-11-19 23:17:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2019-11-19 23:17:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3970 transitions. [2019-11-19 23:17:57,838 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3970 transitions. Word has length 25 [2019-11-19 23:17:57,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:57,838 INFO L462 AbstractCegarLoop]: Abstraction has 2500 states and 3970 transitions. [2019-11-19 23:17:57,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3970 transitions. [2019-11-19 23:17:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 23:17:57,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:57,841 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] [2019-11-19 23:17:57,842 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:57,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:57,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1309296475, now seen corresponding path program 1 times [2019-11-19 23:17:57,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:57,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069801728] [2019-11-19 23:17:57,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:57,876 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-19 23:17:57,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069801728] [2019-11-19 23:17:57,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:57,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:57,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871024470] [2019-11-19 23:17:57,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:57,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:57,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:57,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:57,878 INFO L87 Difference]: Start difference. First operand 2500 states and 3970 transitions. Second operand 3 states. [2019-11-19 23:17:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:57,953 INFO L93 Difference]: Finished difference Result 4488 states and 7268 transitions. [2019-11-19 23:17:57,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:57,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-19 23:17:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:57,980 INFO L225 Difference]: With dead ends: 4488 [2019-11-19 23:17:57,980 INFO L226 Difference]: Without dead ends: 4486 [2019-11-19 23:17:57,982 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-19 23:17:57,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-11-19 23:17:58,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 3588. [2019-11-19 23:17:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-11-19 23:17:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5538 transitions. [2019-11-19 23:17:58,107 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5538 transitions. Word has length 25 [2019-11-19 23:17:58,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:58,107 INFO L462 AbstractCegarLoop]: Abstraction has 3588 states and 5538 transitions. [2019-11-19 23:17:58,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:58,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5538 transitions. [2019-11-19 23:17:58,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 23:17:58,113 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:58,113 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] [2019-11-19 23:17:58,113 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:58,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:58,114 INFO L82 PathProgramCache]: Analyzing trace with hash 288228121, now seen corresponding path program 1 times [2019-11-19 23:17:58,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:58,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533360158] [2019-11-19 23:17:58,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:58,135 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-19 23:17:58,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533360158] [2019-11-19 23:17:58,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:58,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:58,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853262351] [2019-11-19 23:17:58,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:58,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:58,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:58,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:58,137 INFO L87 Difference]: Start difference. First operand 3588 states and 5538 transitions. Second operand 3 states. [2019-11-19 23:17:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:58,236 INFO L93 Difference]: Finished difference Result 8392 states and 13028 transitions. [2019-11-19 23:17:58,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:58,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-19 23:17:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:58,266 INFO L225 Difference]: With dead ends: 8392 [2019-11-19 23:17:58,266 INFO L226 Difference]: Without dead ends: 4870 [2019-11-19 23:17:58,271 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-19 23:17:58,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2019-11-19 23:17:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 4868. [2019-11-19 23:17:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4868 states. [2019-11-19 23:17:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 7490 transitions. [2019-11-19 23:17:58,425 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 7490 transitions. Word has length 25 [2019-11-19 23:17:58,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:58,426 INFO L462 AbstractCegarLoop]: Abstraction has 4868 states and 7490 transitions. [2019-11-19 23:17:58,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 7490 transitions. [2019-11-19 23:17:58,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 23:17:58,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:58,432 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] [2019-11-19 23:17:58,432 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:58,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:58,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1933699482, now seen corresponding path program 1 times [2019-11-19 23:17:58,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:58,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297702592] [2019-11-19 23:17:58,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:58,451 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-19 23:17:58,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297702592] [2019-11-19 23:17:58,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:58,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:58,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134290968] [2019-11-19 23:17:58,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:58,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:58,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:58,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:58,452 INFO L87 Difference]: Start difference. First operand 4868 states and 7490 transitions. Second operand 3 states. [2019-11-19 23:17:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:58,548 INFO L93 Difference]: Finished difference Result 7304 states and 11204 transitions. [2019-11-19 23:17:58,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:58,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-19 23:17:58,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:58,571 INFO L225 Difference]: With dead ends: 7304 [2019-11-19 23:17:58,572 INFO L226 Difference]: Without dead ends: 4934 [2019-11-19 23:17:58,575 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-19 23:17:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2019-11-19 23:17:58,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4932. [2019-11-19 23:17:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4932 states. [2019-11-19 23:17:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 7490 transitions. [2019-11-19 23:17:58,744 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 7490 transitions. Word has length 26 [2019-11-19 23:17:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:58,744 INFO L462 AbstractCegarLoop]: Abstraction has 4932 states and 7490 transitions. [2019-11-19 23:17:58,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 7490 transitions. [2019-11-19 23:17:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 23:17:58,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:58,750 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] [2019-11-19 23:17:58,750 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:58,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:58,751 INFO L82 PathProgramCache]: Analyzing trace with hash 345351580, now seen corresponding path program 1 times [2019-11-19 23:17:58,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:58,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115544920] [2019-11-19 23:17:58,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:58,773 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-19 23:17:58,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115544920] [2019-11-19 23:17:58,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:58,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:58,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049398890] [2019-11-19 23:17:58,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:58,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:58,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:58,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:58,774 INFO L87 Difference]: Start difference. First operand 4932 states and 7490 transitions. Second operand 3 states. [2019-11-19 23:17:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:58,888 INFO L93 Difference]: Finished difference Result 8712 states and 13508 transitions. [2019-11-19 23:17:58,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:58,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-19 23:17:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:58,906 INFO L225 Difference]: With dead ends: 8712 [2019-11-19 23:17:58,906 INFO L226 Difference]: Without dead ends: 8710 [2019-11-19 23:17:58,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:58,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2019-11-19 23:17:59,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 7172. [2019-11-19 23:17:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7172 states. [2019-11-19 23:17:59,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 10562 transitions. [2019-11-19 23:17:59,127 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 10562 transitions. Word has length 26 [2019-11-19 23:17:59,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:59,128 INFO L462 AbstractCegarLoop]: Abstraction has 7172 states and 10562 transitions. [2019-11-19 23:17:59,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:59,128 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 10562 transitions. [2019-11-19 23:17:59,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 23:17:59,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:59,139 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] [2019-11-19 23:17:59,140 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:59,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:59,140 INFO L82 PathProgramCache]: Analyzing trace with hash -675716774, now seen corresponding path program 1 times [2019-11-19 23:17:59,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:59,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694984242] [2019-11-19 23:17:59,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:59,165 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-19 23:17:59,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694984242] [2019-11-19 23:17:59,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:59,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:59,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918718988] [2019-11-19 23:17:59,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:59,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:59,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:59,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:59,166 INFO L87 Difference]: Start difference. First operand 7172 states and 10562 transitions. Second operand 3 states. [2019-11-19 23:17:59,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:59,323 INFO L93 Difference]: Finished difference Result 16648 states and 24644 transitions. [2019-11-19 23:17:59,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:59,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-19 23:17:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:59,343 INFO L225 Difference]: With dead ends: 16648 [2019-11-19 23:17:59,343 INFO L226 Difference]: Without dead ends: 9606 [2019-11-19 23:17:59,353 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-19 23:17:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9606 states. [2019-11-19 23:17:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9606 to 9604. [2019-11-19 23:17:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9604 states. [2019-11-19 23:17:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9604 states to 9604 states and 14082 transitions. [2019-11-19 23:17:59,626 INFO L78 Accepts]: Start accepts. Automaton has 9604 states and 14082 transitions. Word has length 26 [2019-11-19 23:17:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:17:59,627 INFO L462 AbstractCegarLoop]: Abstraction has 9604 states and 14082 transitions. [2019-11-19 23:17:59,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:17:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 9604 states and 14082 transitions. [2019-11-19 23:17:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 23:17:59,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:17:59,640 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] [2019-11-19 23:17:59,643 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:17:59,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:17:59,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2116179150, now seen corresponding path program 1 times [2019-11-19 23:17:59,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:17:59,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970482038] [2019-11-19 23:17:59,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:17:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:17:59,666 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-19 23:17:59,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970482038] [2019-11-19 23:17:59,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:17:59,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:17:59,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142466272] [2019-11-19 23:17:59,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:17:59,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:17:59,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:17:59,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:17:59,668 INFO L87 Difference]: Start difference. First operand 9604 states and 14082 transitions. Second operand 3 states. [2019-11-19 23:17:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:17:59,860 INFO L93 Difference]: Finished difference Result 14408 states and 21060 transitions. [2019-11-19 23:17:59,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:17:59,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-19 23:17:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:17:59,880 INFO L225 Difference]: With dead ends: 14408 [2019-11-19 23:17:59,880 INFO L226 Difference]: Without dead ends: 9734 [2019-11-19 23:17:59,887 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-19 23:17:59,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9734 states. [2019-11-19 23:18:00,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9734 to 9732. [2019-11-19 23:18:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9732 states. [2019-11-19 23:18:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9732 states to 9732 states and 14082 transitions. [2019-11-19 23:18:00,153 INFO L78 Accepts]: Start accepts. Automaton has 9732 states and 14082 transitions. Word has length 27 [2019-11-19 23:18:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:18:00,153 INFO L462 AbstractCegarLoop]: Abstraction has 9732 states and 14082 transitions. [2019-11-19 23:18:00,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:18:00,154 INFO L276 IsEmpty]: Start isEmpty. Operand 9732 states and 14082 transitions. [2019-11-19 23:18:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 23:18:00,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:18:00,166 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] [2019-11-19 23:18:00,166 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:18:00,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:00,167 INFO L82 PathProgramCache]: Analyzing trace with hash 527831248, now seen corresponding path program 1 times [2019-11-19 23:18:00,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:00,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689319020] [2019-11-19 23:18:00,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:00,186 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-19 23:18:00,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689319020] [2019-11-19 23:18:00,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:00,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:00,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491473144] [2019-11-19 23:18:00,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:18:00,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:00,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:00,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:00,188 INFO L87 Difference]: Start difference. First operand 9732 states and 14082 transitions. Second operand 3 states. [2019-11-19 23:18:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:00,373 INFO L93 Difference]: Finished difference Result 16904 states and 24964 transitions. [2019-11-19 23:18:00,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:00,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-19 23:18:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:18:00,404 INFO L225 Difference]: With dead ends: 16904 [2019-11-19 23:18:00,404 INFO L226 Difference]: Without dead ends: 16902 [2019-11-19 23:18:00,410 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-19 23:18:00,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16902 states. [2019-11-19 23:18:00,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16902 to 14340. [2019-11-19 23:18:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14340 states. [2019-11-19 23:18:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 20098 transitions. [2019-11-19 23:18:00,803 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 20098 transitions. Word has length 27 [2019-11-19 23:18:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:18:00,803 INFO L462 AbstractCegarLoop]: Abstraction has 14340 states and 20098 transitions. [2019-11-19 23:18:00,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:18:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 20098 transitions. [2019-11-19 23:18:00,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 23:18:00,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:18:00,825 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] [2019-11-19 23:18:00,826 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:18:00,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:00,826 INFO L82 PathProgramCache]: Analyzing trace with hash -493237106, now seen corresponding path program 1 times [2019-11-19 23:18:00,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:00,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058507637] [2019-11-19 23:18:00,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:00,846 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-19 23:18:00,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058507637] [2019-11-19 23:18:00,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:00,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:00,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303117646] [2019-11-19 23:18:00,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:18:00,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:00,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:00,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:00,847 INFO L87 Difference]: Start difference. First operand 14340 states and 20098 transitions. Second operand 3 states. [2019-11-19 23:18:01,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:01,090 INFO L93 Difference]: Finished difference Result 33032 states and 46468 transitions. [2019-11-19 23:18:01,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:01,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-19 23:18:01,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:18:01,125 INFO L225 Difference]: With dead ends: 33032 [2019-11-19 23:18:01,125 INFO L226 Difference]: Without dead ends: 18950 [2019-11-19 23:18:01,144 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-19 23:18:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18950 states. [2019-11-19 23:18:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18950 to 18948. [2019-11-19 23:18:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18948 states. [2019-11-19 23:18:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18948 states to 18948 states and 26370 transitions. [2019-11-19 23:18:01,531 INFO L78 Accepts]: Start accepts. Automaton has 18948 states and 26370 transitions. Word has length 27 [2019-11-19 23:18:01,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:18:01,532 INFO L462 AbstractCegarLoop]: Abstraction has 18948 states and 26370 transitions. [2019-11-19 23:18:01,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:18:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 18948 states and 26370 transitions. [2019-11-19 23:18:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 23:18:01,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:18:01,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] [2019-11-19 23:18:01,554 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:18:01,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:01,555 INFO L82 PathProgramCache]: Analyzing trace with hash -816885393, now seen corresponding path program 1 times [2019-11-19 23:18:01,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:01,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668147756] [2019-11-19 23:18:01,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:01,574 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-19 23:18:01,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668147756] [2019-11-19 23:18:01,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:01,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:01,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671995840] [2019-11-19 23:18:01,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:18:01,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:01,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:01,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:01,576 INFO L87 Difference]: Start difference. First operand 18948 states and 26370 transitions. Second operand 3 states. [2019-11-19 23:18:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:01,832 INFO L93 Difference]: Finished difference Result 28424 states and 39428 transitions. [2019-11-19 23:18:01,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:01,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-19 23:18:01,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:18:01,871 INFO L225 Difference]: With dead ends: 28424 [2019-11-19 23:18:01,872 INFO L226 Difference]: Without dead ends: 19206 [2019-11-19 23:18:01,888 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-19 23:18:01,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19206 states. [2019-11-19 23:18:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19206 to 19204. [2019-11-19 23:18:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19204 states. [2019-11-19 23:18:02,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19204 states to 19204 states and 26370 transitions. [2019-11-19 23:18:02,419 INFO L78 Accepts]: Start accepts. Automaton has 19204 states and 26370 transitions. Word has length 28 [2019-11-19 23:18:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:18:02,419 INFO L462 AbstractCegarLoop]: Abstraction has 19204 states and 26370 transitions. [2019-11-19 23:18:02,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:18:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 19204 states and 26370 transitions. [2019-11-19 23:18:02,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 23:18:02,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:18:02,442 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] [2019-11-19 23:18:02,443 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:18:02,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:02,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1889734001, now seen corresponding path program 1 times [2019-11-19 23:18:02,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:02,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885759954] [2019-11-19 23:18:02,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:02,471 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-19 23:18:02,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885759954] [2019-11-19 23:18:02,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:02,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:02,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138996336] [2019-11-19 23:18:02,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:18:02,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:02,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:02,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:02,473 INFO L87 Difference]: Start difference. First operand 19204 states and 26370 transitions. Second operand 3 states. [2019-11-19 23:18:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:02,791 INFO L93 Difference]: Finished difference Result 32776 states and 45828 transitions. [2019-11-19 23:18:02,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:02,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-19 23:18:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:18:02,851 INFO L225 Difference]: With dead ends: 32776 [2019-11-19 23:18:02,851 INFO L226 Difference]: Without dead ends: 32774 [2019-11-19 23:18:02,860 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-19 23:18:02,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32774 states. [2019-11-19 23:18:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32774 to 28676. [2019-11-19 23:18:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28676 states. [2019-11-19 23:18:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28676 states to 28676 states and 38146 transitions. [2019-11-19 23:18:03,551 INFO L78 Accepts]: Start accepts. Automaton has 28676 states and 38146 transitions. Word has length 28 [2019-11-19 23:18:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:18:03,551 INFO L462 AbstractCegarLoop]: Abstraction has 28676 states and 38146 transitions. [2019-11-19 23:18:03,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:18:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 28676 states and 38146 transitions. [2019-11-19 23:18:03,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 23:18:03,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:18:03,590 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] [2019-11-19 23:18:03,590 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:18:03,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:03,591 INFO L82 PathProgramCache]: Analyzing trace with hash 868665647, now seen corresponding path program 1 times [2019-11-19 23:18:03,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:03,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576957647] [2019-11-19 23:18:03,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:03,611 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-19 23:18:03,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576957647] [2019-11-19 23:18:03,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:03,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:03,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995884135] [2019-11-19 23:18:03,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:18:03,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:03,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:03,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:03,613 INFO L87 Difference]: Start difference. First operand 28676 states and 38146 transitions. Second operand 3 states. [2019-11-19 23:18:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:03,997 INFO L93 Difference]: Finished difference Result 65544 states and 87300 transitions. [2019-11-19 23:18:03,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:03,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-19 23:18:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:18:04,067 INFO L225 Difference]: With dead ends: 65544 [2019-11-19 23:18:04,067 INFO L226 Difference]: Without dead ends: 37382 [2019-11-19 23:18:04,101 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-19 23:18:04,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37382 states. [2019-11-19 23:18:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37382 to 37380. [2019-11-19 23:18:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37380 states. [2019-11-19 23:18:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37380 states to 37380 states and 49154 transitions. [2019-11-19 23:18:05,324 INFO L78 Accepts]: Start accepts. Automaton has 37380 states and 49154 transitions. Word has length 28 [2019-11-19 23:18:05,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:18:05,324 INFO L462 AbstractCegarLoop]: Abstraction has 37380 states and 49154 transitions. [2019-11-19 23:18:05,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:18:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 37380 states and 49154 transitions. [2019-11-19 23:18:05,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 23:18:05,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:18:05,354 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] [2019-11-19 23:18:05,354 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:18:05,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:05,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1547572669, now seen corresponding path program 1 times [2019-11-19 23:18:05,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:05,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608678869] [2019-11-19 23:18:05,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:05,383 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-19 23:18:05,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608678869] [2019-11-19 23:18:05,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:05,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:05,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140272635] [2019-11-19 23:18:05,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:18:05,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:05,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:05,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:05,384 INFO L87 Difference]: Start difference. First operand 37380 states and 49154 transitions. Second operand 3 states. [2019-11-19 23:18:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:05,730 INFO L93 Difference]: Finished difference Result 56072 states and 73476 transitions. [2019-11-19 23:18:05,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:05,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-19 23:18:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:18:05,792 INFO L225 Difference]: With dead ends: 56072 [2019-11-19 23:18:05,793 INFO L226 Difference]: Without dead ends: 37894 [2019-11-19 23:18:05,811 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-19 23:18:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37894 states. [2019-11-19 23:18:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37894 to 37892. [2019-11-19 23:18:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37892 states. [2019-11-19 23:18:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37892 states to 37892 states and 49154 transitions. [2019-11-19 23:18:06,464 INFO L78 Accepts]: Start accepts. Automaton has 37892 states and 49154 transitions. Word has length 29 [2019-11-19 23:18:06,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:18:06,465 INFO L462 AbstractCegarLoop]: Abstraction has 37892 states and 49154 transitions. [2019-11-19 23:18:06,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:18:06,465 INFO L276 IsEmpty]: Start isEmpty. Operand 37892 states and 49154 transitions. [2019-11-19 23:18:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 23:18:06,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:18:06,497 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] [2019-11-19 23:18:06,498 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:18:06,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:06,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1159046725, now seen corresponding path program 1 times [2019-11-19 23:18:06,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:06,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629400649] [2019-11-19 23:18:06,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:06,516 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-19 23:18:06,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629400649] [2019-11-19 23:18:06,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:06,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:06,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896251375] [2019-11-19 23:18:06,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:18:06,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:06,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:06,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:06,521 INFO L87 Difference]: Start difference. First operand 37892 states and 49154 transitions. Second operand 3 states. [2019-11-19 23:18:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:07,446 INFO L93 Difference]: Finished difference Result 110600 states and 141316 transitions. [2019-11-19 23:18:07,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:07,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-19 23:18:07,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:18:07,546 INFO L225 Difference]: With dead ends: 110600 [2019-11-19 23:18:07,547 INFO L226 Difference]: Without dead ends: 73734 [2019-11-19 23:18:07,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73734 states. [2019-11-19 23:18:09,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73734 to 73732. [2019-11-19 23:18:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73732 states. [2019-11-19 23:18:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 92162 transitions. [2019-11-19 23:18:09,641 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 92162 transitions. Word has length 29 [2019-11-19 23:18:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:18:09,641 INFO L462 AbstractCegarLoop]: Abstraction has 73732 states and 92162 transitions. [2019-11-19 23:18:09,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:18:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 92162 transitions. [2019-11-19 23:18:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 23:18:09,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:18:09,689 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] [2019-11-19 23:18:09,689 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:18:09,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:09,690 INFO L82 PathProgramCache]: Analyzing trace with hash -2114852217, now seen corresponding path program 1 times [2019-11-19 23:18:09,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:09,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843401307] [2019-11-19 23:18:09,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:09,710 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-19 23:18:09,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843401307] [2019-11-19 23:18:09,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:09,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:09,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634773608] [2019-11-19 23:18:09,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:18:09,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:09,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:09,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:09,712 INFO L87 Difference]: Start difference. First operand 73732 states and 92162 transitions. Second operand 3 states. [2019-11-19 23:18:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:10,446 INFO L93 Difference]: Finished difference Result 79880 states and 102404 transitions. [2019-11-19 23:18:10,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:10,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-19 23:18:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:18:10,543 INFO L225 Difference]: With dead ends: 79880 [2019-11-19 23:18:10,543 INFO L226 Difference]: Without dead ends: 79878 [2019-11-19 23:18:10,563 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-19 23:18:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79878 states. [2019-11-19 23:18:12,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79878 to 73732. [2019-11-19 23:18:12,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73732 states. [2019-11-19 23:18:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 91138 transitions. [2019-11-19 23:18:12,403 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 91138 transitions. Word has length 29 [2019-11-19 23:18:12,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:18:12,403 INFO L462 AbstractCegarLoop]: Abstraction has 73732 states and 91138 transitions. [2019-11-19 23:18:12,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:18:12,403 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 91138 transitions. [2019-11-19 23:18:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 23:18:12,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:18:12,450 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] [2019-11-19 23:18:12,451 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:18:12,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:12,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1570925892, now seen corresponding path program 1 times [2019-11-19 23:18:12,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:12,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839234159] [2019-11-19 23:18:12,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:12,471 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-19 23:18:12,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839234159] [2019-11-19 23:18:12,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:12,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:12,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662413540] [2019-11-19 23:18:12,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:18:12,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:12,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:12,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:12,472 INFO L87 Difference]: Start difference. First operand 73732 states and 91138 transitions. Second operand 3 states. [2019-11-19 23:18:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:13,439 INFO L93 Difference]: Finished difference Result 121864 states and 151556 transitions. [2019-11-19 23:18:13,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:13,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-19 23:18:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:18:13,593 INFO L225 Difference]: With dead ends: 121864 [2019-11-19 23:18:13,594 INFO L226 Difference]: Without dead ends: 121862 [2019-11-19 23:18:13,624 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-19 23:18:13,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121862 states. [2019-11-19 23:18:15,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121862 to 113668. [2019-11-19 23:18:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113668 states. [2019-11-19 23:18:15,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113668 states to 113668 states and 137218 transitions. [2019-11-19 23:18:15,789 INFO L78 Accepts]: Start accepts. Automaton has 113668 states and 137218 transitions. Word has length 30 [2019-11-19 23:18:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:18:15,790 INFO L462 AbstractCegarLoop]: Abstraction has 113668 states and 137218 transitions. [2019-11-19 23:18:15,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:18:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 113668 states and 137218 transitions. [2019-11-19 23:18:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 23:18:15,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:18:15,875 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] [2019-11-19 23:18:15,876 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:18:15,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:15,876 INFO L82 PathProgramCache]: Analyzing trace with hash 549857538, now seen corresponding path program 1 times [2019-11-19 23:18:15,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:15,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528613299] [2019-11-19 23:18:15,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:15,895 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-19 23:18:15,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528613299] [2019-11-19 23:18:15,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:15,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:15,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618395854] [2019-11-19 23:18:15,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:18:15,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:15,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:15,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:15,896 INFO L87 Difference]: Start difference. First operand 113668 states and 137218 transitions. Second operand 3 states. [2019-11-19 23:18:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:16,915 INFO L93 Difference]: Finished difference Result 257032 states and 309252 transitions. [2019-11-19 23:18:16,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:16,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-19 23:18:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:18:17,047 INFO L225 Difference]: With dead ends: 257032 [2019-11-19 23:18:17,047 INFO L226 Difference]: Without dead ends: 144390 [2019-11-19 23:18:17,104 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-19 23:18:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144390 states. [2019-11-19 23:18:19,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144390 to 144388. [2019-11-19 23:18:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144388 states. [2019-11-19 23:18:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144388 states to 144388 states and 169986 transitions. [2019-11-19 23:18:19,457 INFO L78 Accepts]: Start accepts. Automaton has 144388 states and 169986 transitions. Word has length 30 [2019-11-19 23:18:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:18:19,457 INFO L462 AbstractCegarLoop]: Abstraction has 144388 states and 169986 transitions. [2019-11-19 23:18:19,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:18:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 144388 states and 169986 transitions. [2019-11-19 23:18:19,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 23:18:19,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:18:19,521 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] [2019-11-19 23:18:19,521 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:18:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:19,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1454278522, now seen corresponding path program 1 times [2019-11-19 23:18:19,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:19,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994965551] [2019-11-19 23:18:19,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:19,547 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-19 23:18:19,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994965551] [2019-11-19 23:18:19,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:19,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:19,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839007581] [2019-11-19 23:18:19,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:18:19,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:19,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:19,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:19,548 INFO L87 Difference]: Start difference. First operand 144388 states and 169986 transitions. Second operand 3 states. [2019-11-19 23:18:23,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:23,293 INFO L93 Difference]: Finished difference Result 218120 states and 257028 transitions. [2019-11-19 23:18:23,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:23,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-19 23:18:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:18:23,418 INFO L225 Difference]: With dead ends: 218120 [2019-11-19 23:18:23,418 INFO L226 Difference]: Without dead ends: 147462 [2019-11-19 23:18:23,448 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-19 23:18:23,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147462 states. [2019-11-19 23:18:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147462 to 147460. [2019-11-19 23:18:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147460 states. [2019-11-19 23:18:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147460 states to 147460 states and 172034 transitions. [2019-11-19 23:18:25,142 INFO L78 Accepts]: Start accepts. Automaton has 147460 states and 172034 transitions. Word has length 31 [2019-11-19 23:18:25,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:18:25,142 INFO L462 AbstractCegarLoop]: Abstraction has 147460 states and 172034 transitions. [2019-11-19 23:18:25,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:18:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 147460 states and 172034 transitions. [2019-11-19 23:18:25,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 23:18:25,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:18:25,205 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] [2019-11-19 23:18:25,205 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:18:25,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:25,205 INFO L82 PathProgramCache]: Analyzing trace with hash -134069380, now seen corresponding path program 1 times [2019-11-19 23:18:25,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:25,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316465636] [2019-11-19 23:18:25,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:25,228 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-19 23:18:25,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316465636] [2019-11-19 23:18:25,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:25,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:25,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627884508] [2019-11-19 23:18:25,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:18:25,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:25,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:25,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:25,230 INFO L87 Difference]: Start difference. First operand 147460 states and 172034 transitions. Second operand 3 states. [2019-11-19 23:18:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:27,319 INFO L93 Difference]: Finished difference Result 237574 states and 274435 transitions. [2019-11-19 23:18:27,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:27,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-19 23:18:27,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:18:27,546 INFO L225 Difference]: With dead ends: 237574 [2019-11-19 23:18:27,546 INFO L226 Difference]: Without dead ends: 237572 [2019-11-19 23:18:27,571 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-19 23:18:27,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237572 states. [2019-11-19 23:18:29,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237572 to 229380. [2019-11-19 23:18:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229380 states. [2019-11-19 23:18:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229380 states to 229380 states and 262146 transitions. [2019-11-19 23:18:31,383 INFO L78 Accepts]: Start accepts. Automaton has 229380 states and 262146 transitions. Word has length 31 [2019-11-19 23:18:31,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:18:31,384 INFO L462 AbstractCegarLoop]: Abstraction has 229380 states and 262146 transitions. [2019-11-19 23:18:31,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:18:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 229380 states and 262146 transitions. [2019-11-19 23:18:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 23:18:31,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:18:31,538 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] [2019-11-19 23:18:31,538 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:18:31,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:18:31,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1155137734, now seen corresponding path program 1 times [2019-11-19 23:18:31,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:18:31,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933399593] [2019-11-19 23:18:31,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:18:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:18:31,560 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-19 23:18:31,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933399593] [2019-11-19 23:18:31,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:18:31,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:18:31,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685341840] [2019-11-19 23:18:31,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:18:31,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:18:31,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:18:31,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:18:31,561 INFO L87 Difference]: Start difference. First operand 229380 states and 262146 transitions. Second operand 3 states. [2019-11-19 23:18:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:18:33,693 INFO L93 Difference]: Finished difference Result 512004 states and 577538 transitions. [2019-11-19 23:18:33,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:18:33,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-19 23:18:33,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:18:33,693 INFO L225 Difference]: With dead ends: 512004 [2019-11-19 23:18:33,694 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 23:18:33,809 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-19 23:18:33,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 23:18:33,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 23:18:33,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 23:18:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 23:18:33,810 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-11-19 23:18:33,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:18:33,811 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 23:18:33,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:18:33,811 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 23:18:33,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 23:18:33,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 23:18:33,854 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-19 23:18:33,854 INFO L444 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,855 INFO L447 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2019-11-19 23:18:33,855 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,855 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 23:18:33,855 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,855 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-19 23:18:33,855 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-19 23:18:33,855 INFO L444 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,855 INFO L444 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,856 INFO L447 ceAbstractionStarter]: At program point L204(lines 4 205) the Hoare annotation is: true [2019-11-19 23:18:33,856 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-19 23:18:33,856 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,856 INFO L444 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,856 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,856 INFO L444 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-19 23:18:33,856 INFO L444 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,857 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 23:18:33,857 INFO L444 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,857 INFO L444 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-19 23:18:33,857 INFO L444 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-11-19 23:18:33,857 INFO L444 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,857 INFO L444 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,857 INFO L444 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,857 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,858 INFO L444 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-11-19 23:18:33,858 INFO L444 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,858 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 23:18:33,858 INFO L444 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-11-19 23:18:33,858 INFO L444 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,858 INFO L447 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2019-11-19 23:18:33,858 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,858 INFO L444 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-11-19 23:18:33,858 INFO L444 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,858 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-19 23:18:33,859 INFO L440 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2019-11-19 23:18:33,859 INFO L444 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,859 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,859 INFO L444 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2019-11-19 23:18:33,859 INFO L444 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,859 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2019-11-19 23:18:33,859 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-19 23:18:33,859 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,860 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2019-11-19 23:18:33,860 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-19 23:18:33,860 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,860 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,860 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2019-11-19 23:18:33,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:18:33 BoogieIcfgContainer [2019-11-19 23:18:33,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:18:33,870 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:18:33,870 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:18:33,870 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:18:33,871 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:17:55" (3/4) ... [2019-11-19 23:18:33,874 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 23:18:33,887 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 23:18:33,888 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 23:18:33,946 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_657d7563-1b03-4c3b-adeb-620adfaa5f6a/bin/uautomizer/witness.graphml [2019-11-19 23:18:33,946 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:18:33,948 INFO L168 Benchmark]: Toolchain (without parser) took 39569.05 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 950.1 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-11-19 23:18:33,948 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:18:33,949 INFO L168 Benchmark]: CACSL2BoogieTranslator took 440.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-19 23:18:33,949 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.14 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-19 23:18:33,949 INFO L168 Benchmark]: Boogie Preprocessor took 29.85 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:18:33,950 INFO L168 Benchmark]: RCFGBuilder took 545.02 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:18:33,950 INFO L168 Benchmark]: TraceAbstraction took 38429.44 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-11-19 23:18:33,950 INFO L168 Benchmark]: Witness Printer took 76.18 ms. Allocated memory is still 5.0 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-11-19 23:18:33,952 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 440.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -188.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.14 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 29.85 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 545.02 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38429.44 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 76.18 ms. Allocated memory is still 5.0 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 1 error locations. Result: SAFE, OverallTime: 38.3s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3765 SDtfs, 1926 SDslu, 2532 SDs, 0 SdLazy, 191 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229380occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 32806 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8201 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 868 ConstructedInterpolants, 0 QuantifiedInterpolants, 47768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...