./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_25dbb123-e533-4031-b4c4-f84f450e5815/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_25dbb123-e533-4031-b4c4-f84f450e5815/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_25dbb123-e533-4031-b4c4-f84f450e5815/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_25dbb123-e533-4031-b4c4-f84f450e5815/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12.c -s /tmp/vcloud-vcloud-master/worker/run_dir_25dbb123-e533-4031-b4c4-f84f450e5815/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_25dbb123-e533-4031-b4c4-f84f450e5815/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 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:51:57,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:51:57,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:51:57,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:51:57,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:51:57,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:51:57,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:51:57,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:51:57,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:51:57,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:51:57,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:51:57,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:51:57,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:51:57,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:51:57,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:51:57,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:51:57,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:51:57,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:51:57,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:51:57,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:51:57,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:51:57,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:51:57,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:51:57,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:51:57,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:51:57,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:51:57,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:51:57,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:51:57,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:51:57,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:51:57,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:51:57,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:51:57,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:51:57,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:51:57,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:51:57,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:51:57,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:51:57,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:51:57,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:51:57,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:51:57,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:51:57,106 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_25dbb123-e533-4031-b4c4-f84f450e5815/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:51:57,129 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:51:57,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:51:57,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:51:57,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:51:57,132 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:51:57,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:51:57,132 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:51:57,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:51:57,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:51:57,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:51:57,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:51:57,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:51:57,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:51:57,134 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:51:57,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:51:57,135 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:51:57,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:51:57,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:51:57,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:51:57,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:51:57,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:51:57,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:51:57,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:51:57,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:51:57,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:51:57,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:51:57,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:51:57,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:51:57,138 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_25dbb123-e533-4031-b4c4-f84f450e5815/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 -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2019-11-25 08:51:57,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:51:57,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:51:57,282 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:51:57,284 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:51:57,284 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:51:57,285 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_25dbb123-e533-4031-b4c4-f84f450e5815/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_12.c [2019-11-25 08:51:57,346 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_25dbb123-e533-4031-b4c4-f84f450e5815/bin/uautomizer/data/8646a37e2/ce1f72ec18764355a7d750b16fc3d3e3/FLAG0ee76853e [2019-11-25 08:51:57,710 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:51:57,711 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_25dbb123-e533-4031-b4c4-f84f450e5815/sv-benchmarks/c/locks/test_locks_12.c [2019-11-25 08:51:57,722 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_25dbb123-e533-4031-b4c4-f84f450e5815/bin/uautomizer/data/8646a37e2/ce1f72ec18764355a7d750b16fc3d3e3/FLAG0ee76853e [2019-11-25 08:51:58,070 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_25dbb123-e533-4031-b4c4-f84f450e5815/bin/uautomizer/data/8646a37e2/ce1f72ec18764355a7d750b16fc3d3e3 [2019-11-25 08:51:58,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:51:58,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:51:58,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:51:58,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:51:58,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:51:58,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:51:58" (1/1) ... [2019-11-25 08:51:58,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6119851a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:58, skipping insertion in model container [2019-11-25 08:51:58,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:51:58" (1/1) ... [2019-11-25 08:51:58,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:51:58,108 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:51:58,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:51:58,253 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:51:58,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:51:58,350 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:51:58,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:58 WrapperNode [2019-11-25 08:51:58,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:51:58,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:51:58,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:51:58,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:51:58,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:58" (1/1) ... [2019-11-25 08:51:58,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:58" (1/1) ... [2019-11-25 08:51:58,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:51:58,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:51:58,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:51:58,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:51:58,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:58" (1/1) ... [2019-11-25 08:51:58,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:58" (1/1) ... [2019-11-25 08:51:58,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:58" (1/1) ... [2019-11-25 08:51:58,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:58" (1/1) ... [2019-11-25 08:51:58,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:58" (1/1) ... [2019-11-25 08:51:58,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:58" (1/1) ... [2019-11-25 08:51:58,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:58" (1/1) ... [2019-11-25 08:51:58,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:51:58,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:51:58,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:51:58,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:51:58,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_25dbb123-e533-4031-b4c4-f84f450e5815/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-25 08:51:58,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:51:58,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:51:58,881 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:51:58,882 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-25 08:51:58,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:51:58 BoogieIcfgContainer [2019-11-25 08:51:58,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:51:58,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:51:58,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:51:58,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:51:58,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:51:58" (1/3) ... [2019-11-25 08:51:58,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8f546d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:51:58, skipping insertion in model container [2019-11-25 08:51:58,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:51:58" (2/3) ... [2019-11-25 08:51:58,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8f546d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:51:58, skipping insertion in model container [2019-11-25 08:51:58,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:51:58" (3/3) ... [2019-11-25 08:51:58,890 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-11-25 08:51:58,899 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:51:58,906 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:51:58,915 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:51:58,933 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:51:58,933 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:51:58,933 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:51:58,934 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:51:58,934 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:51:58,934 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:51:58,934 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:51:58,934 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:51:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-11-25 08:51:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:51:58,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:58,954 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:58,955 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:58,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1363603929, now seen corresponding path program 1 times [2019-11-25 08:51:58,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:58,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955218240] [2019-11-25 08:51:58,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:59,127 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-25 08:51:59,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955218240] [2019-11-25 08:51:59,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:59,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:59,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264684924] [2019-11-25 08:51:59,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:59,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:59,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:59,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:59,148 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-11-25 08:51:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:59,207 INFO L93 Difference]: Finished difference Result 94 states and 168 transitions. [2019-11-25 08:51:59,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:59,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-25 08:51:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:59,217 INFO L225 Difference]: With dead ends: 94 [2019-11-25 08:51:59,218 INFO L226 Difference]: Without dead ends: 80 [2019-11-25 08:51:59,220 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-25 08:51:59,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-25 08:51:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-11-25 08:51:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-25 08:51:59,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 101 transitions. [2019-11-25 08:51:59,254 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 101 transitions. Word has length 18 [2019-11-25 08:51:59,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:59,254 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 101 transitions. [2019-11-25 08:51:59,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:59,254 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 101 transitions. [2019-11-25 08:51:59,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:51:59,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:59,255 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:51:59,256 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:59,256 INFO L82 PathProgramCache]: Analyzing trace with hash 83740251, now seen corresponding path program 1 times [2019-11-25 08:51:59,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:59,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785087231] [2019-11-25 08:51:59,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:59,309 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-25 08:51:59,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785087231] [2019-11-25 08:51:59,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:59,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:59,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594035197] [2019-11-25 08:51:59,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:59,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:59,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:59,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:59,312 INFO L87 Difference]: Start difference. First operand 54 states and 101 transitions. Second operand 3 states. [2019-11-25 08:51:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:59,351 INFO L93 Difference]: Finished difference Result 133 states and 248 transitions. [2019-11-25 08:51:59,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:59,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-25 08:51:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:59,354 INFO L225 Difference]: With dead ends: 133 [2019-11-25 08:51:59,354 INFO L226 Difference]: Without dead ends: 80 [2019-11-25 08:51:59,355 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-25 08:51:59,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-25 08:51:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-11-25 08:51:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-25 08:51:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 145 transitions. [2019-11-25 08:51:59,369 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 145 transitions. Word has length 18 [2019-11-25 08:51:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:59,370 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 145 transitions. [2019-11-25 08:51:59,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 145 transitions. [2019-11-25 08:51:59,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:51:59,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:59,371 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-25 08:51:59,371 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:59,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:59,372 INFO L82 PathProgramCache]: Analyzing trace with hash -677738462, now seen corresponding path program 1 times [2019-11-25 08:51:59,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:59,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747721386] [2019-11-25 08:51:59,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:59,432 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-25 08:51:59,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747721386] [2019-11-25 08:51:59,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:59,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:59,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214790310] [2019-11-25 08:51:59,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:59,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:59,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:59,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:59,435 INFO L87 Difference]: Start difference. First operand 78 states and 145 transitions. Second operand 3 states. [2019-11-25 08:51:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:59,453 INFO L93 Difference]: Finished difference Result 122 states and 221 transitions. [2019-11-25 08:51:59,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:59,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-25 08:51:59,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:59,455 INFO L225 Difference]: With dead ends: 122 [2019-11-25 08:51:59,456 INFO L226 Difference]: Without dead ends: 83 [2019-11-25 08:51:59,456 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-25 08:51:59,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-25 08:51:59,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-25 08:51:59,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-25 08:51:59,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 147 transitions. [2019-11-25 08:51:59,465 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 147 transitions. Word has length 19 [2019-11-25 08:51:59,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:59,465 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 147 transitions. [2019-11-25 08:51:59,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 147 transitions. [2019-11-25 08:51:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:51:59,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:59,467 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-25 08:51:59,467 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:59,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1698806816, now seen corresponding path program 1 times [2019-11-25 08:51:59,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:59,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041672643] [2019-11-25 08:51:59,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:59,503 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-25 08:51:59,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041672643] [2019-11-25 08:51:59,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:59,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:59,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790289374] [2019-11-25 08:51:59,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:59,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:59,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:59,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:59,505 INFO L87 Difference]: Start difference. First operand 81 states and 147 transitions. Second operand 3 states. [2019-11-25 08:51:59,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:59,525 INFO L93 Difference]: Finished difference Result 156 states and 284 transitions. [2019-11-25 08:51:59,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:59,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-25 08:51:59,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:59,527 INFO L225 Difference]: With dead ends: 156 [2019-11-25 08:51:59,527 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 08:51:59,528 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-25 08:51:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 08:51:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 108. [2019-11-25 08:51:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-25 08:51:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 196 transitions. [2019-11-25 08:51:59,547 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 196 transitions. Word has length 19 [2019-11-25 08:51:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:59,547 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 196 transitions. [2019-11-25 08:51:59,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:59,547 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 196 transitions. [2019-11-25 08:51:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:51:59,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:59,549 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-25 08:51:59,549 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:59,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1316296802, now seen corresponding path program 1 times [2019-11-25 08:51:59,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:59,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968641224] [2019-11-25 08:51:59,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:59,606 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-25 08:51:59,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968641224] [2019-11-25 08:51:59,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:59,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:59,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995135579] [2019-11-25 08:51:59,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:59,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:59,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:59,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:59,608 INFO L87 Difference]: Start difference. First operand 108 states and 196 transitions. Second operand 3 states. [2019-11-25 08:51:59,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:59,635 INFO L93 Difference]: Finished difference Result 260 states and 474 transitions. [2019-11-25 08:51:59,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:59,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-25 08:51:59,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:59,637 INFO L225 Difference]: With dead ends: 260 [2019-11-25 08:51:59,637 INFO L226 Difference]: Without dead ends: 156 [2019-11-25 08:51:59,638 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-25 08:51:59,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-25 08:51:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-11-25 08:51:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-25 08:51:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 278 transitions. [2019-11-25 08:51:59,651 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 278 transitions. Word has length 19 [2019-11-25 08:51:59,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:59,652 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 278 transitions. [2019-11-25 08:51:59,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 278 transitions. [2019-11-25 08:51:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-25 08:51:59,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:59,653 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-25 08:51:59,654 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:59,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:59,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1123190704, now seen corresponding path program 1 times [2019-11-25 08:51:59,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:59,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060522879] [2019-11-25 08:51:59,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:59,698 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-25 08:51:59,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060522879] [2019-11-25 08:51:59,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:59,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:59,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157620435] [2019-11-25 08:51:59,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:59,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:59,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:59,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:59,700 INFO L87 Difference]: Start difference. First operand 154 states and 278 transitions. Second operand 3 states. [2019-11-25 08:51:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:59,731 INFO L93 Difference]: Finished difference Result 233 states and 417 transitions. [2019-11-25 08:51:59,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:59,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-25 08:51:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:59,734 INFO L225 Difference]: With dead ends: 233 [2019-11-25 08:51:59,734 INFO L226 Difference]: Without dead ends: 158 [2019-11-25 08:51:59,735 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-25 08:51:59,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-25 08:51:59,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-11-25 08:51:59,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-25 08:51:59,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 278 transitions. [2019-11-25 08:51:59,749 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 278 transitions. Word has length 20 [2019-11-25 08:51:59,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:59,752 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 278 transitions. [2019-11-25 08:51:59,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 278 transitions. [2019-11-25 08:51:59,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-25 08:51:59,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:59,754 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-25 08:51:59,755 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:59,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:59,755 INFO L82 PathProgramCache]: Analyzing trace with hash -2144259058, now seen corresponding path program 1 times [2019-11-25 08:51:59,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:59,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462269236] [2019-11-25 08:51:59,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:59,794 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-25 08:51:59,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462269236] [2019-11-25 08:51:59,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:59,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:59,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026212953] [2019-11-25 08:51:59,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:59,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:59,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:59,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:59,796 INFO L87 Difference]: Start difference. First operand 156 states and 278 transitions. Second operand 3 states. [2019-11-25 08:51:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:59,851 INFO L93 Difference]: Finished difference Result 452 states and 808 transitions. [2019-11-25 08:51:59,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:59,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-25 08:51:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:59,853 INFO L225 Difference]: With dead ends: 452 [2019-11-25 08:51:59,853 INFO L226 Difference]: Without dead ends: 302 [2019-11-25 08:51:59,855 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-25 08:51:59,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-25 08:51:59,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-11-25 08:51:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-25 08:51:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 530 transitions. [2019-11-25 08:51:59,886 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 530 transitions. Word has length 20 [2019-11-25 08:51:59,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:59,887 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 530 transitions. [2019-11-25 08:51:59,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 530 transitions. [2019-11-25 08:51:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-25 08:51:59,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:59,888 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-25 08:51:59,888 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash -864395380, now seen corresponding path program 1 times [2019-11-25 08:51:59,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:59,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196662636] [2019-11-25 08:51:59,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:51:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:51:59,945 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-25 08:51:59,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196662636] [2019-11-25 08:51:59,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:51:59,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:51:59,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711158423] [2019-11-25 08:51:59,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:51:59,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:51:59,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:51:59,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:51:59,949 INFO L87 Difference]: Start difference. First operand 300 states and 530 transitions. Second operand 3 states. [2019-11-25 08:51:59,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:51:59,970 INFO L93 Difference]: Finished difference Result 384 states and 684 transitions. [2019-11-25 08:51:59,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:51:59,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-25 08:51:59,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:51:59,973 INFO L225 Difference]: With dead ends: 384 [2019-11-25 08:51:59,973 INFO L226 Difference]: Without dead ends: 382 [2019-11-25 08:51:59,974 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-25 08:51:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-25 08:51:59,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 300. [2019-11-25 08:51:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-25 08:51:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 526 transitions. [2019-11-25 08:51:59,989 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 526 transitions. Word has length 20 [2019-11-25 08:51:59,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:51:59,989 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 526 transitions. [2019-11-25 08:51:59,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:51:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 526 transitions. [2019-11-25 08:51:59,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 08:51:59,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:51:59,991 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-25 08:51:59,992 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:51:59,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:51:59,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2047307977, now seen corresponding path program 1 times [2019-11-25 08:51:59,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:51:59,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981817447] [2019-11-25 08:51:59,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:00,016 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-25 08:52:00,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981817447] [2019-11-25 08:52:00,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:00,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:00,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236438822] [2019-11-25 08:52:00,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:00,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:00,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:00,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:00,018 INFO L87 Difference]: Start difference. First operand 300 states and 526 transitions. Second operand 3 states. [2019-11-25 08:52:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:00,059 INFO L93 Difference]: Finished difference Result 564 states and 1000 transitions. [2019-11-25 08:52:00,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:00,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-25 08:52:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:00,064 INFO L225 Difference]: With dead ends: 564 [2019-11-25 08:52:00,064 INFO L226 Difference]: Without dead ends: 562 [2019-11-25 08:52:00,065 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-25 08:52:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-11-25 08:52:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 416. [2019-11-25 08:52:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-25 08:52:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 718 transitions. [2019-11-25 08:52:00,081 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 718 transitions. Word has length 21 [2019-11-25 08:52:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:00,082 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 718 transitions. [2019-11-25 08:52:00,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 718 transitions. [2019-11-25 08:52:00,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 08:52:00,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:00,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, 1] [2019-11-25 08:52:00,085 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:00,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:00,085 INFO L82 PathProgramCache]: Analyzing trace with hash 967795641, now seen corresponding path program 1 times [2019-11-25 08:52:00,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:00,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230312054] [2019-11-25 08:52:00,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:00,108 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-25 08:52:00,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230312054] [2019-11-25 08:52:00,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:00,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:00,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115207183] [2019-11-25 08:52:00,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:00,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:00,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:00,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:00,109 INFO L87 Difference]: Start difference. First operand 416 states and 718 transitions. Second operand 3 states. [2019-11-25 08:52:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:00,149 INFO L93 Difference]: Finished difference Result 996 states and 1728 transitions. [2019-11-25 08:52:00,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:00,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-25 08:52:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:00,153 INFO L225 Difference]: With dead ends: 996 [2019-11-25 08:52:00,153 INFO L226 Difference]: Without dead ends: 586 [2019-11-25 08:52:00,156 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-25 08:52:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-25 08:52:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-11-25 08:52:00,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-25 08:52:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1002 transitions. [2019-11-25 08:52:00,175 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1002 transitions. Word has length 21 [2019-11-25 08:52:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:00,176 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 1002 transitions. [2019-11-25 08:52:00,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1002 transitions. [2019-11-25 08:52:00,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:52:00,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:00,178 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-25 08:52:00,178 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:00,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:00,178 INFO L82 PathProgramCache]: Analyzing trace with hash 958175875, now seen corresponding path program 1 times [2019-11-25 08:52:00,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:00,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595329767] [2019-11-25 08:52:00,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:00,199 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-25 08:52:00,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595329767] [2019-11-25 08:52:00,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:00,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:00,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573736411] [2019-11-25 08:52:00,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:00,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:00,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:00,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:00,201 INFO L87 Difference]: Start difference. First operand 584 states and 1002 transitions. Second operand 3 states. [2019-11-25 08:52:00,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:00,224 INFO L93 Difference]: Finished difference Result 884 states and 1512 transitions. [2019-11-25 08:52:00,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:00,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-25 08:52:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:00,228 INFO L225 Difference]: With dead ends: 884 [2019-11-25 08:52:00,228 INFO L226 Difference]: Without dead ends: 598 [2019-11-25 08:52:00,229 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-25 08:52:00,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-25 08:52:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-11-25 08:52:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-11-25 08:52:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1010 transitions. [2019-11-25 08:52:00,247 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1010 transitions. Word has length 22 [2019-11-25 08:52:00,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:00,248 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1010 transitions. [2019-11-25 08:52:00,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1010 transitions. [2019-11-25 08:52:00,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:52:00,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:00,249 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-25 08:52:00,249 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:00,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:00,250 INFO L82 PathProgramCache]: Analyzing trace with hash -62892479, now seen corresponding path program 1 times [2019-11-25 08:52:00,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:00,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589102442] [2019-11-25 08:52:00,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:00,271 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-25 08:52:00,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589102442] [2019-11-25 08:52:00,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:00,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:00,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096419689] [2019-11-25 08:52:00,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:00,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:00,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:00,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:00,273 INFO L87 Difference]: Start difference. First operand 596 states and 1010 transitions. Second operand 3 states. [2019-11-25 08:52:00,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:00,304 INFO L93 Difference]: Finished difference Result 1096 states and 1884 transitions. [2019-11-25 08:52:00,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:00,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-25 08:52:00,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:00,311 INFO L225 Difference]: With dead ends: 1096 [2019-11-25 08:52:00,311 INFO L226 Difference]: Without dead ends: 1094 [2019-11-25 08:52:00,312 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-25 08:52:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-11-25 08:52:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 836. [2019-11-25 08:52:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-11-25 08:52:00,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1386 transitions. [2019-11-25 08:52:00,348 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1386 transitions. Word has length 22 [2019-11-25 08:52:00,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:00,349 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1386 transitions. [2019-11-25 08:52:00,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:00,349 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1386 transitions. [2019-11-25 08:52:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:52:00,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:00,352 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-25 08:52:00,353 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:00,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:00,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1342756157, now seen corresponding path program 1 times [2019-11-25 08:52:00,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:00,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129800718] [2019-11-25 08:52:00,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:00,392 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-25 08:52:00,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129800718] [2019-11-25 08:52:00,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:00,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:00,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823642521] [2019-11-25 08:52:00,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:00,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:00,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:00,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:00,394 INFO L87 Difference]: Start difference. First operand 836 states and 1386 transitions. Second operand 3 states. [2019-11-25 08:52:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:00,428 INFO L93 Difference]: Finished difference Result 1976 states and 3292 transitions. [2019-11-25 08:52:00,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:00,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-25 08:52:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:00,436 INFO L225 Difference]: With dead ends: 1976 [2019-11-25 08:52:00,436 INFO L226 Difference]: Without dead ends: 1158 [2019-11-25 08:52:00,437 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-25 08:52:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-11-25 08:52:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2019-11-25 08:52:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-11-25 08:52:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1906 transitions. [2019-11-25 08:52:00,475 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1906 transitions. Word has length 22 [2019-11-25 08:52:00,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:00,476 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1906 transitions. [2019-11-25 08:52:00,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1906 transitions. [2019-11-25 08:52:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:52:00,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:00,483 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-25 08:52:00,483 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:00,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:00,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1949452786, now seen corresponding path program 1 times [2019-11-25 08:52:00,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:00,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864034664] [2019-11-25 08:52:00,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:00,525 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-25 08:52:00,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864034664] [2019-11-25 08:52:00,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:00,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:00,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681628377] [2019-11-25 08:52:00,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:00,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:00,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:00,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:00,526 INFO L87 Difference]: Start difference. First operand 1156 states and 1906 transitions. Second operand 3 states. [2019-11-25 08:52:00,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:00,559 INFO L93 Difference]: Finished difference Result 1736 states and 2852 transitions. [2019-11-25 08:52:00,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:00,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-25 08:52:00,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:00,567 INFO L225 Difference]: With dead ends: 1736 [2019-11-25 08:52:00,568 INFO L226 Difference]: Without dead ends: 1174 [2019-11-25 08:52:00,570 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-25 08:52:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-11-25 08:52:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1172. [2019-11-25 08:52:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-11-25 08:52:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1906 transitions. [2019-11-25 08:52:00,607 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1906 transitions. Word has length 23 [2019-11-25 08:52:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:00,610 INFO L462 AbstractCegarLoop]: Abstraction has 1172 states and 1906 transitions. [2019-11-25 08:52:00,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1906 transitions. [2019-11-25 08:52:00,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:52:00,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:00,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, 1] [2019-11-25 08:52:00,612 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:00,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:00,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1324446156, now seen corresponding path program 1 times [2019-11-25 08:52:00,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:00,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873884255] [2019-11-25 08:52:00,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:00,642 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-25 08:52:00,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873884255] [2019-11-25 08:52:00,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:00,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:00,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109518182] [2019-11-25 08:52:00,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:00,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:00,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:00,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:00,643 INFO L87 Difference]: Start difference. First operand 1172 states and 1906 transitions. Second operand 3 states. [2019-11-25 08:52:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:00,681 INFO L93 Difference]: Finished difference Result 2120 states and 3508 transitions. [2019-11-25 08:52:00,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:00,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-25 08:52:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:00,693 INFO L225 Difference]: With dead ends: 2120 [2019-11-25 08:52:00,694 INFO L226 Difference]: Without dead ends: 2118 [2019-11-25 08:52:00,696 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-25 08:52:00,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-11-25 08:52:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1668. [2019-11-25 08:52:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2019-11-25 08:52:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2642 transitions. [2019-11-25 08:52:00,754 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2642 transitions. Word has length 23 [2019-11-25 08:52:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:00,754 INFO L462 AbstractCegarLoop]: Abstraction has 1668 states and 2642 transitions. [2019-11-25 08:52:00,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2642 transitions. [2019-11-25 08:52:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:52:00,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:00,758 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-25 08:52:00,758 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:00,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:00,759 INFO L82 PathProgramCache]: Analyzing trace with hash 44582478, now seen corresponding path program 1 times [2019-11-25 08:52:00,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:00,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555681300] [2019-11-25 08:52:00,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:00,784 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-25 08:52:00,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555681300] [2019-11-25 08:52:00,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:00,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:00,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85227373] [2019-11-25 08:52:00,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:00,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:00,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:00,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:00,786 INFO L87 Difference]: Start difference. First operand 1668 states and 2642 transitions. Second operand 3 states. [2019-11-25 08:52:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:00,847 INFO L93 Difference]: Finished difference Result 3912 states and 6228 transitions. [2019-11-25 08:52:00,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:00,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-25 08:52:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:00,860 INFO L225 Difference]: With dead ends: 3912 [2019-11-25 08:52:00,860 INFO L226 Difference]: Without dead ends: 2278 [2019-11-25 08:52:00,862 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-25 08:52:00,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-11-25 08:52:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2276. [2019-11-25 08:52:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2276 states. [2019-11-25 08:52:00,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3586 transitions. [2019-11-25 08:52:00,925 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3586 transitions. Word has length 23 [2019-11-25 08:52:00,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:00,926 INFO L462 AbstractCegarLoop]: Abstraction has 2276 states and 3586 transitions. [2019-11-25 08:52:00,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:00,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3586 transitions. [2019-11-25 08:52:00,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:52:00,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:00,929 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-25 08:52:00,929 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:00,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:00,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1891627720, now seen corresponding path program 1 times [2019-11-25 08:52:00,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:00,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942385297] [2019-11-25 08:52:00,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:00,960 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-25 08:52:00,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942385297] [2019-11-25 08:52:00,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:00,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:00,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81306510] [2019-11-25 08:52:00,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:00,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:00,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:00,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:00,962 INFO L87 Difference]: Start difference. First operand 2276 states and 3586 transitions. Second operand 3 states. [2019-11-25 08:52:01,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:01,005 INFO L93 Difference]: Finished difference Result 3416 states and 5364 transitions. [2019-11-25 08:52:01,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:01,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-25 08:52:01,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:01,018 INFO L225 Difference]: With dead ends: 3416 [2019-11-25 08:52:01,018 INFO L226 Difference]: Without dead ends: 2310 [2019-11-25 08:52:01,020 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-25 08:52:01,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-11-25 08:52:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2308. [2019-11-25 08:52:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-11-25 08:52:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 3586 transitions. [2019-11-25 08:52:01,087 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 3586 transitions. Word has length 24 [2019-11-25 08:52:01,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:01,088 INFO L462 AbstractCegarLoop]: Abstraction has 2308 states and 3586 transitions. [2019-11-25 08:52:01,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3586 transitions. [2019-11-25 08:52:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:52:01,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:01,092 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-25 08:52:01,092 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:01,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:01,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1382271222, now seen corresponding path program 1 times [2019-11-25 08:52:01,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:01,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366804906] [2019-11-25 08:52:01,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:01,115 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-25 08:52:01,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366804906] [2019-11-25 08:52:01,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:01,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:01,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001948645] [2019-11-25 08:52:01,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:01,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:01,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:01,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:01,117 INFO L87 Difference]: Start difference. First operand 2308 states and 3586 transitions. Second operand 3 states. [2019-11-25 08:52:01,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:01,174 INFO L93 Difference]: Finished difference Result 4104 states and 6500 transitions. [2019-11-25 08:52:01,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:01,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-25 08:52:01,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:01,196 INFO L225 Difference]: With dead ends: 4104 [2019-11-25 08:52:01,196 INFO L226 Difference]: Without dead ends: 4102 [2019-11-25 08:52:01,198 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-25 08:52:01,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-11-25 08:52:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3332. [2019-11-25 08:52:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2019-11-25 08:52:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 5026 transitions. [2019-11-25 08:52:01,293 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 5026 transitions. Word has length 24 [2019-11-25 08:52:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:01,293 INFO L462 AbstractCegarLoop]: Abstraction has 3332 states and 5026 transitions. [2019-11-25 08:52:01,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 5026 transitions. [2019-11-25 08:52:01,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:52:01,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:01,299 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-25 08:52:01,299 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:01,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:01,299 INFO L82 PathProgramCache]: Analyzing trace with hash 102407544, now seen corresponding path program 1 times [2019-11-25 08:52:01,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:01,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882305722] [2019-11-25 08:52:01,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:01,324 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-25 08:52:01,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882305722] [2019-11-25 08:52:01,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:01,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:01,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910827738] [2019-11-25 08:52:01,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:01,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:01,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:01,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:01,325 INFO L87 Difference]: Start difference. First operand 3332 states and 5026 transitions. Second operand 3 states. [2019-11-25 08:52:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:01,408 INFO L93 Difference]: Finished difference Result 7752 states and 11748 transitions. [2019-11-25 08:52:01,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:01,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-25 08:52:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:01,431 INFO L225 Difference]: With dead ends: 7752 [2019-11-25 08:52:01,431 INFO L226 Difference]: Without dead ends: 4486 [2019-11-25 08:52:01,435 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-25 08:52:01,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-11-25 08:52:01,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 4484. [2019-11-25 08:52:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4484 states. [2019-11-25 08:52:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6722 transitions. [2019-11-25 08:52:01,563 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6722 transitions. Word has length 24 [2019-11-25 08:52:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:01,563 INFO L462 AbstractCegarLoop]: Abstraction has 4484 states and 6722 transitions. [2019-11-25 08:52:01,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6722 transitions. [2019-11-25 08:52:01,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:52:01,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:01,569 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-25 08:52:01,569 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:01,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:01,569 INFO L82 PathProgramCache]: Analyzing trace with hash -99050333, now seen corresponding path program 1 times [2019-11-25 08:52:01,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:01,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447701804] [2019-11-25 08:52:01,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:01,595 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-25 08:52:01,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447701804] [2019-11-25 08:52:01,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:01,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:01,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615084264] [2019-11-25 08:52:01,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:01,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:01,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:01,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:01,597 INFO L87 Difference]: Start difference. First operand 4484 states and 6722 transitions. Second operand 3 states. [2019-11-25 08:52:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:01,664 INFO L93 Difference]: Finished difference Result 6728 states and 10052 transitions. [2019-11-25 08:52:01,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:01,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-25 08:52:01,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:01,691 INFO L225 Difference]: With dead ends: 6728 [2019-11-25 08:52:01,698 INFO L226 Difference]: Without dead ends: 4550 [2019-11-25 08:52:01,701 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-25 08:52:01,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2019-11-25 08:52:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4548. [2019-11-25 08:52:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4548 states. [2019-11-25 08:52:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 6722 transitions. [2019-11-25 08:52:01,879 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 6722 transitions. Word has length 25 [2019-11-25 08:52:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:01,879 INFO L462 AbstractCegarLoop]: Abstraction has 4548 states and 6722 transitions. [2019-11-25 08:52:01,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 6722 transitions. [2019-11-25 08:52:01,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:52:01,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:01,885 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-25 08:52:01,885 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:01,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:01,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1120118687, now seen corresponding path program 1 times [2019-11-25 08:52:01,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:01,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680163251] [2019-11-25 08:52:01,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:01,910 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-25 08:52:01,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680163251] [2019-11-25 08:52:01,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:01,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:01,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316253576] [2019-11-25 08:52:01,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:01,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:01,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:01,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:01,912 INFO L87 Difference]: Start difference. First operand 4548 states and 6722 transitions. Second operand 3 states. [2019-11-25 08:52:01,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:01,999 INFO L93 Difference]: Finished difference Result 7944 states and 11972 transitions. [2019-11-25 08:52:02,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:02,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-25 08:52:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:02,014 INFO L225 Difference]: With dead ends: 7944 [2019-11-25 08:52:02,014 INFO L226 Difference]: Without dead ends: 7942 [2019-11-25 08:52:02,016 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-25 08:52:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7942 states. [2019-11-25 08:52:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7942 to 6660. [2019-11-25 08:52:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-11-25 08:52:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 9538 transitions. [2019-11-25 08:52:02,171 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 9538 transitions. Word has length 25 [2019-11-25 08:52:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:02,172 INFO L462 AbstractCegarLoop]: Abstraction has 6660 states and 9538 transitions. [2019-11-25 08:52:02,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 9538 transitions. [2019-11-25 08:52:02,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:52:02,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:02,182 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-25 08:52:02,182 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:02,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:02,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1894984931, now seen corresponding path program 1 times [2019-11-25 08:52:02,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:02,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267416162] [2019-11-25 08:52:02,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:02,202 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-25 08:52:02,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267416162] [2019-11-25 08:52:02,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:02,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:02,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16912220] [2019-11-25 08:52:02,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:02,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:02,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:02,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:02,203 INFO L87 Difference]: Start difference. First operand 6660 states and 9538 transitions. Second operand 3 states. [2019-11-25 08:52:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:02,319 INFO L93 Difference]: Finished difference Result 15368 states and 22084 transitions. [2019-11-25 08:52:02,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:02,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-25 08:52:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:02,337 INFO L225 Difference]: With dead ends: 15368 [2019-11-25 08:52:02,337 INFO L226 Difference]: Without dead ends: 8838 [2019-11-25 08:52:02,346 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-25 08:52:02,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8838 states. [2019-11-25 08:52:02,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8838 to 8836. [2019-11-25 08:52:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-11-25 08:52:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 12546 transitions. [2019-11-25 08:52:02,586 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 12546 transitions. Word has length 25 [2019-11-25 08:52:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:02,586 INFO L462 AbstractCegarLoop]: Abstraction has 8836 states and 12546 transitions. [2019-11-25 08:52:02,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:02,586 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 12546 transitions. [2019-11-25 08:52:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:52:02,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:02,596 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-25 08:52:02,598 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:02,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:02,598 INFO L82 PathProgramCache]: Analyzing trace with hash -363725843, now seen corresponding path program 1 times [2019-11-25 08:52:02,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:02,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999097136] [2019-11-25 08:52:02,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:02,621 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-25 08:52:02,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999097136] [2019-11-25 08:52:02,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:02,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:02,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294239288] [2019-11-25 08:52:02,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:02,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:02,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:02,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:02,622 INFO L87 Difference]: Start difference. First operand 8836 states and 12546 transitions. Second operand 3 states. [2019-11-25 08:52:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:02,742 INFO L93 Difference]: Finished difference Result 13256 states and 18756 transitions. [2019-11-25 08:52:02,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:02,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-25 08:52:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:02,762 INFO L225 Difference]: With dead ends: 13256 [2019-11-25 08:52:02,763 INFO L226 Difference]: Without dead ends: 8966 [2019-11-25 08:52:02,770 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-25 08:52:02,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8966 states. [2019-11-25 08:52:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8966 to 8964. [2019-11-25 08:52:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2019-11-25 08:52:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 12546 transitions. [2019-11-25 08:52:03,061 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 12546 transitions. Word has length 26 [2019-11-25 08:52:03,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:03,061 INFO L462 AbstractCegarLoop]: Abstraction has 8964 states and 12546 transitions. [2019-11-25 08:52:03,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 12546 transitions. [2019-11-25 08:52:03,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:52:03,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:03,072 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-25 08:52:03,072 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:03,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:03,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1384794197, now seen corresponding path program 1 times [2019-11-25 08:52:03,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:03,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223563757] [2019-11-25 08:52:03,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:03,106 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-25 08:52:03,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223563757] [2019-11-25 08:52:03,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:03,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:03,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049785612] [2019-11-25 08:52:03,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:03,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:03,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:03,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:03,108 INFO L87 Difference]: Start difference. First operand 8964 states and 12546 transitions. Second operand 3 states. [2019-11-25 08:52:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:03,328 INFO L93 Difference]: Finished difference Result 15368 states and 21892 transitions. [2019-11-25 08:52:03,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:03,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-25 08:52:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:03,362 INFO L225 Difference]: With dead ends: 15368 [2019-11-25 08:52:03,363 INFO L226 Difference]: Without dead ends: 15366 [2019-11-25 08:52:03,368 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-25 08:52:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15366 states. [2019-11-25 08:52:03,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15366 to 13316. [2019-11-25 08:52:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13316 states. [2019-11-25 08:52:03,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13316 states to 13316 states and 18050 transitions. [2019-11-25 08:52:03,768 INFO L78 Accepts]: Start accepts. Automaton has 13316 states and 18050 transitions. Word has length 26 [2019-11-25 08:52:03,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:03,768 INFO L462 AbstractCegarLoop]: Abstraction has 13316 states and 18050 transitions. [2019-11-25 08:52:03,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:03,769 INFO L276 IsEmpty]: Start isEmpty. Operand 13316 states and 18050 transitions. [2019-11-25 08:52:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:52:03,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:03,791 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-25 08:52:03,792 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:03,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:03,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1630309421, now seen corresponding path program 1 times [2019-11-25 08:52:03,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:03,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289269505] [2019-11-25 08:52:03,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:03,813 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-25 08:52:03,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289269505] [2019-11-25 08:52:03,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:03,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:03,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551930627] [2019-11-25 08:52:03,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:03,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:03,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:03,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:03,815 INFO L87 Difference]: Start difference. First operand 13316 states and 18050 transitions. Second operand 3 states. [2019-11-25 08:52:04,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:04,214 INFO L93 Difference]: Finished difference Result 30472 states and 41348 transitions. [2019-11-25 08:52:04,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:04,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-25 08:52:04,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:04,243 INFO L225 Difference]: With dead ends: 30472 [2019-11-25 08:52:04,243 INFO L226 Difference]: Without dead ends: 17414 [2019-11-25 08:52:04,258 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-25 08:52:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17414 states. [2019-11-25 08:52:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17414 to 17412. [2019-11-25 08:52:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2019-11-25 08:52:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 23298 transitions. [2019-11-25 08:52:04,769 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 23298 transitions. Word has length 26 [2019-11-25 08:52:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:04,770 INFO L462 AbstractCegarLoop]: Abstraction has 17412 states and 23298 transitions. [2019-11-25 08:52:04,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 23298 transitions. [2019-11-25 08:52:04,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:52:04,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:04,790 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-25 08:52:04,791 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:04,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:04,791 INFO L82 PathProgramCache]: Analyzing trace with hash 21268280, now seen corresponding path program 1 times [2019-11-25 08:52:04,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:04,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137828853] [2019-11-25 08:52:04,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:04,809 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-25 08:52:04,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137828853] [2019-11-25 08:52:04,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:04,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:04,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348553566] [2019-11-25 08:52:04,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:04,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:04,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:04,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:04,810 INFO L87 Difference]: Start difference. First operand 17412 states and 23298 transitions. Second operand 3 states. [2019-11-25 08:52:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:05,033 INFO L93 Difference]: Finished difference Result 26120 states and 34820 transitions. [2019-11-25 08:52:05,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:05,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-25 08:52:05,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:05,074 INFO L225 Difference]: With dead ends: 26120 [2019-11-25 08:52:05,074 INFO L226 Difference]: Without dead ends: 17670 [2019-11-25 08:52:05,089 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-25 08:52:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17670 states. [2019-11-25 08:52:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17670 to 17668. [2019-11-25 08:52:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17668 states. [2019-11-25 08:52:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17668 states to 17668 states and 23298 transitions. [2019-11-25 08:52:05,825 INFO L78 Accepts]: Start accepts. Automaton has 17668 states and 23298 transitions. Word has length 27 [2019-11-25 08:52:05,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:05,826 INFO L462 AbstractCegarLoop]: Abstraction has 17668 states and 23298 transitions. [2019-11-25 08:52:05,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 17668 states and 23298 transitions. [2019-11-25 08:52:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:52:05,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:05,850 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-25 08:52:05,850 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:05,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:05,851 INFO L82 PathProgramCache]: Analyzing trace with hash -999800074, now seen corresponding path program 1 times [2019-11-25 08:52:05,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:05,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968942863] [2019-11-25 08:52:05,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:05,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-25 08:52:05,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968942863] [2019-11-25 08:52:05,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:05,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:05,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380995153] [2019-11-25 08:52:05,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:05,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:05,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:05,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:05,877 INFO L87 Difference]: Start difference. First operand 17668 states and 23298 transitions. Second operand 3 states. [2019-11-25 08:52:06,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:06,273 INFO L93 Difference]: Finished difference Result 29704 states and 39684 transitions. [2019-11-25 08:52:06,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:06,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-25 08:52:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:06,332 INFO L225 Difference]: With dead ends: 29704 [2019-11-25 08:52:06,332 INFO L226 Difference]: Without dead ends: 29702 [2019-11-25 08:52:06,340 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-25 08:52:06,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29702 states. [2019-11-25 08:52:06,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29702 to 26628. [2019-11-25 08:52:06,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26628 states. [2019-11-25 08:52:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26628 states to 26628 states and 34050 transitions. [2019-11-25 08:52:07,180 INFO L78 Accepts]: Start accepts. Automaton has 26628 states and 34050 transitions. Word has length 27 [2019-11-25 08:52:07,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:07,180 INFO L462 AbstractCegarLoop]: Abstraction has 26628 states and 34050 transitions. [2019-11-25 08:52:07,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 26628 states and 34050 transitions. [2019-11-25 08:52:07,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:52:07,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:07,213 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-25 08:52:07,213 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:07,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:07,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2015303544, now seen corresponding path program 1 times [2019-11-25 08:52:07,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:07,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838347744] [2019-11-25 08:52:07,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:07,233 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-25 08:52:07,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838347744] [2019-11-25 08:52:07,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:07,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:07,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907483955] [2019-11-25 08:52:07,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:07,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:07,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:07,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:07,234 INFO L87 Difference]: Start difference. First operand 26628 states and 34050 transitions. Second operand 3 states. [2019-11-25 08:52:07,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:07,689 INFO L93 Difference]: Finished difference Result 60424 states and 77060 transitions. [2019-11-25 08:52:07,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:07,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-25 08:52:07,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:07,752 INFO L225 Difference]: With dead ends: 60424 [2019-11-25 08:52:07,753 INFO L226 Difference]: Without dead ends: 34310 [2019-11-25 08:52:07,784 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-25 08:52:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34310 states. [2019-11-25 08:52:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34310 to 34308. [2019-11-25 08:52:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34308 states. [2019-11-25 08:52:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34308 states to 34308 states and 43010 transitions. [2019-11-25 08:52:08,525 INFO L78 Accepts]: Start accepts. Automaton has 34308 states and 43010 transitions. Word has length 27 [2019-11-25 08:52:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:08,526 INFO L462 AbstractCegarLoop]: Abstraction has 34308 states and 43010 transitions. [2019-11-25 08:52:08,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 34308 states and 43010 transitions. [2019-11-25 08:52:08,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:52:08,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:08,565 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-25 08:52:08,565 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:08,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:08,566 INFO L82 PathProgramCache]: Analyzing trace with hash -928815454, now seen corresponding path program 1 times [2019-11-25 08:52:08,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:08,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943411603] [2019-11-25 08:52:08,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:08,594 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-25 08:52:08,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943411603] [2019-11-25 08:52:08,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:08,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:08,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867377462] [2019-11-25 08:52:08,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:08,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:08,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:08,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:08,596 INFO L87 Difference]: Start difference. First operand 34308 states and 43010 transitions. Second operand 3 states. [2019-11-25 08:52:09,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:09,335 INFO L93 Difference]: Finished difference Result 51464 states and 64260 transitions. [2019-11-25 08:52:09,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:09,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-25 08:52:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:09,389 INFO L225 Difference]: With dead ends: 51464 [2019-11-25 08:52:09,389 INFO L226 Difference]: Without dead ends: 34822 [2019-11-25 08:52:09,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-25 08:52:09,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34822 states. [2019-11-25 08:52:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34822 to 34820. [2019-11-25 08:52:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34820 states. [2019-11-25 08:52:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34820 states to 34820 states and 43010 transitions. [2019-11-25 08:52:10,030 INFO L78 Accepts]: Start accepts. Automaton has 34820 states and 43010 transitions. Word has length 28 [2019-11-25 08:52:10,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:10,030 INFO L462 AbstractCegarLoop]: Abstraction has 34820 states and 43010 transitions. [2019-11-25 08:52:10,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 34820 states and 43010 transitions. [2019-11-25 08:52:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:52:10,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:10,059 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-25 08:52:10,059 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:10,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:10,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1949883808, now seen corresponding path program 1 times [2019-11-25 08:52:10,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:10,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101490981] [2019-11-25 08:52:10,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:10,076 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-25 08:52:10,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101490981] [2019-11-25 08:52:10,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:10,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:10,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229991147] [2019-11-25 08:52:10,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:10,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:10,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:10,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:10,078 INFO L87 Difference]: Start difference. First operand 34820 states and 43010 transitions. Second operand 3 states. [2019-11-25 08:52:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:10,666 INFO L93 Difference]: Finished difference Result 101384 states and 122884 transitions. [2019-11-25 08:52:10,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:10,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-25 08:52:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:11,082 INFO L225 Difference]: With dead ends: 101384 [2019-11-25 08:52:11,083 INFO L226 Difference]: Without dead ends: 67590 [2019-11-25 08:52:11,107 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-25 08:52:11,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67590 states. [2019-11-25 08:52:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67590 to 67588. [2019-11-25 08:52:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-11-25 08:52:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 79874 transitions. [2019-11-25 08:52:12,134 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 79874 transitions. Word has length 28 [2019-11-25 08:52:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:12,135 INFO L462 AbstractCegarLoop]: Abstraction has 67588 states and 79874 transitions. [2019-11-25 08:52:12,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 79874 transitions. [2019-11-25 08:52:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:52:12,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:12,172 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-25 08:52:12,172 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:12,173 INFO L82 PathProgramCache]: Analyzing trace with hash -670020130, now seen corresponding path program 1 times [2019-11-25 08:52:12,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:12,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721884463] [2019-11-25 08:52:12,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:12,197 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-25 08:52:12,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721884463] [2019-11-25 08:52:12,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:12,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:12,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785381885] [2019-11-25 08:52:12,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:12,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:12,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:12,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:12,199 INFO L87 Difference]: Start difference. First operand 67588 states and 79874 transitions. Second operand 3 states. [2019-11-25 08:52:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:13,199 INFO L93 Difference]: Finished difference Result 71688 states and 86020 transitions. [2019-11-25 08:52:13,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:13,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-25 08:52:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:13,272 INFO L225 Difference]: With dead ends: 71688 [2019-11-25 08:52:13,273 INFO L226 Difference]: Without dead ends: 71686 [2019-11-25 08:52:13,284 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-25 08:52:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71686 states. [2019-11-25 08:52:14,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71686 to 67588. [2019-11-25 08:52:14,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-11-25 08:52:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 78850 transitions. [2019-11-25 08:52:14,527 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 78850 transitions. Word has length 28 [2019-11-25 08:52:14,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:14,527 INFO L462 AbstractCegarLoop]: Abstraction has 67588 states and 78850 transitions. [2019-11-25 08:52:14,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 78850 transitions. [2019-11-25 08:52:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:52:14,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:14,571 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-25 08:52:14,572 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:14,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:14,573 INFO L82 PathProgramCache]: Analyzing trace with hash -316639795, now seen corresponding path program 1 times [2019-11-25 08:52:14,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:14,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293909138] [2019-11-25 08:52:14,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:14,597 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-25 08:52:14,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293909138] [2019-11-25 08:52:14,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:14,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:14,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932246655] [2019-11-25 08:52:14,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:14,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:14,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:14,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:14,599 INFO L87 Difference]: Start difference. First operand 67588 states and 78850 transitions. Second operand 3 states. [2019-11-25 08:52:16,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:16,239 INFO L93 Difference]: Finished difference Result 109574 states and 126979 transitions. [2019-11-25 08:52:16,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:16,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-25 08:52:16,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:16,356 INFO L225 Difference]: With dead ends: 109574 [2019-11-25 08:52:16,356 INFO L226 Difference]: Without dead ends: 109572 [2019-11-25 08:52:16,374 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-25 08:52:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109572 states. [2019-11-25 08:52:17,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109572 to 105476. [2019-11-25 08:52:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105476 states. [2019-11-25 08:52:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105476 states to 105476 states and 120834 transitions. [2019-11-25 08:52:18,119 INFO L78 Accepts]: Start accepts. Automaton has 105476 states and 120834 transitions. Word has length 29 [2019-11-25 08:52:18,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:18,120 INFO L462 AbstractCegarLoop]: Abstraction has 105476 states and 120834 transitions. [2019-11-25 08:52:18,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:18,120 INFO L276 IsEmpty]: Start isEmpty. Operand 105476 states and 120834 transitions. [2019-11-25 08:52:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:52:18,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:52:18,775 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-25 08:52:18,775 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:52:18,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:52:18,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1596503473, now seen corresponding path program 1 times [2019-11-25 08:52:18,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:52:18,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57640479] [2019-11-25 08:52:18,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:52:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:52:18,805 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-25 08:52:18,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57640479] [2019-11-25 08:52:18,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:52:18,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:52:18,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784959333] [2019-11-25 08:52:18,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:52:18,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:52:18,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:52:18,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:52:18,807 INFO L87 Difference]: Start difference. First operand 105476 states and 120834 transitions. Second operand 3 states. [2019-11-25 08:52:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:52:20,043 INFO L93 Difference]: Finished difference Result 236548 states and 268290 transitions. [2019-11-25 08:52:20,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:52:20,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-25 08:52:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:52:20,044 INFO L225 Difference]: With dead ends: 236548 [2019-11-25 08:52:20,044 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:52:20,096 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-25 08:52:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:52:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:52:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:52:20,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:52:20,098 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-11-25 08:52:20,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:52:20,098 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:52:20,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:52:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:52:20,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:52:20,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:52:20,144 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,144 INFO L444 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,144 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,144 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-25 08:52:20,144 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:52:20,144 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:52:20,144 INFO L444 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-25 08:52:20,144 INFO L444 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-25 08:52:20,144 INFO L444 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,145 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,145 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,145 INFO L444 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,145 INFO L444 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-25 08:52:20,145 INFO L444 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,145 INFO L444 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-25 08:52:20,145 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,145 INFO L447 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-11-25 08:52:20,145 INFO L444 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,145 INFO L444 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,146 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-11-25 08:52:20,146 INFO L444 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,146 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,146 INFO L444 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-25 08:52:20,146 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-25 08:52:20,146 INFO L444 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,146 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,146 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-11-25 08:52:20,146 INFO L447 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-11-25 08:52:20,146 INFO L444 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-25 08:52:20,146 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:52:20,146 INFO L447 ceAbstractionStarter]: At program point L190(lines 4 191) the Hoare annotation is: true [2019-11-25 08:52:20,147 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-25 08:52:20,147 INFO L444 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-11-25 08:52:20,147 INFO L440 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-11-25 08:52:20,147 INFO L444 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,147 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,147 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,147 INFO L444 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,147 INFO L444 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,147 INFO L444 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,147 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,147 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-25 08:52:20,147 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-11-25 08:52:20,148 INFO L444 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2019-11-25 08:52:20,148 INFO L444 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-11-25 08:52:20,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:52:20 BoogieIcfgContainer [2019-11-25 08:52:20,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:52:20,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:52:20,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:52:20,157 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:52:20,158 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:51:58" (3/4) ... [2019-11-25 08:52:20,161 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:52:20,175 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 08:52:20,175 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:52:20,234 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_25dbb123-e533-4031-b4c4-f84f450e5815/bin/uautomizer/witness.graphml [2019-11-25 08:52:20,234 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:52:20,236 INFO L168 Benchmark]: Toolchain (without parser) took 22162.35 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -118.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-25 08:52:20,236 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:20,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -210.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:20,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:52:20,237 INFO L168 Benchmark]: Boogie Preprocessor took 21.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 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-25 08:52:20,238 INFO L168 Benchmark]: RCFGBuilder took 474.34 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:20,238 INFO L168 Benchmark]: TraceAbstraction took 21272.56 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-25 08:52:20,238 INFO L168 Benchmark]: Witness Printer took 77.23 ms. Allocated memory is still 2.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:52:20,240 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -210.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 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 474.34 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21272.56 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 77.23 ms. Allocated memory is still 2.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. Result: SAFE, OverallTime: 21.2s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3198 SDtfs, 1629 SDslu, 2141 SDs, 0 SdLazy, 175 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105476occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4105 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.6s InterpolantComputationTime, 778 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 38061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...