./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c3b47a2a-1d00-43d5-b855-dd46a4fc2a9b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c3b47a2a-1d00-43d5-b855-dd46a4fc2a9b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c3b47a2a-1d00-43d5-b855-dd46a4fc2a9b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c3b47a2a-1d00-43d5-b855-dd46a4fc2a9b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c3b47a2a-1d00-43d5-b855-dd46a4fc2a9b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c3b47a2a-1d00-43d5-b855-dd46a4fc2a9b/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-678e011 [2019-11-20 00:03:54,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:03:54,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:03:54,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:03:54,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:03:54,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:03:54,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:03:54,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:03:54,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:03:54,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:03:54,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:03:54,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:03:54,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:03:54,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:03:54,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:03:54,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:03:54,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:03:54,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:03:54,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:03:54,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:03:54,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:03:54,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:03:54,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:03:54,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:03:54,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:03:54,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:03:54,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:03:54,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:03:54,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:03:54,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:03:54,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:03:54,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:03:54,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:03:54,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:03:54,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:03:54,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:03:54,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:03:54,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:03:54,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:03:54,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:03:54,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:03:54,586 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c3b47a2a-1d00-43d5-b855-dd46a4fc2a9b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:03:54,602 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:03:54,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:03:54,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:03:54,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:03:54,604 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:03:54,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:03:54,604 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:03:54,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:03:54,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:03:54,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:03:54,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:03:54,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:03:54,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:03:54,606 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:03:54,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:03:54,606 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:03:54,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:03:54,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:03:54,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:03:54,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:03:54,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:03:54,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:03:54,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:03:54,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:03:54,608 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:03:54,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:03:54,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:03:54,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:03:54,609 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_c3b47a2a-1d00-43d5-b855-dd46a4fc2a9b/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-20 00:03:54,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:03:54,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:03:54,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:03:54,776 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:03:54,776 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:03:54,777 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c3b47a2a-1d00-43d5-b855-dd46a4fc2a9b/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_12.c [2019-11-20 00:03:54,822 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3b47a2a-1d00-43d5-b855-dd46a4fc2a9b/bin/uautomizer/data/cca7940e4/a3fc7a2df9fd47309bceab49c881f802/FLAG36b1ae0f2 [2019-11-20 00:03:55,235 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:03:55,236 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c3b47a2a-1d00-43d5-b855-dd46a4fc2a9b/sv-benchmarks/c/locks/test_locks_12.c [2019-11-20 00:03:55,248 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3b47a2a-1d00-43d5-b855-dd46a4fc2a9b/bin/uautomizer/data/cca7940e4/a3fc7a2df9fd47309bceab49c881f802/FLAG36b1ae0f2 [2019-11-20 00:03:55,262 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c3b47a2a-1d00-43d5-b855-dd46a4fc2a9b/bin/uautomizer/data/cca7940e4/a3fc7a2df9fd47309bceab49c881f802 [2019-11-20 00:03:55,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:03:55,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:03:55,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:03:55,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:03:55,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:03:55,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:03:55" (1/1) ... [2019-11-20 00:03:55,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e22ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:55, skipping insertion in model container [2019-11-20 00:03:55,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:03:55" (1/1) ... [2019-11-20 00:03:55,280 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:03:55,309 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:03:55,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:03:55,516 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:03:55,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:03:55,553 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:03:55,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:55 WrapperNode [2019-11-20 00:03:55,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:03:55,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:03:55,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:03:55,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:03:55,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:55" (1/1) ... [2019-11-20 00:03:55,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:55" (1/1) ... [2019-11-20 00:03:55,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:03:55,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:03:55,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:03:55,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:03:55,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:55" (1/1) ... [2019-11-20 00:03:55,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:55" (1/1) ... [2019-11-20 00:03:55,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:55" (1/1) ... [2019-11-20 00:03:55,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:55" (1/1) ... [2019-11-20 00:03:55,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:55" (1/1) ... [2019-11-20 00:03:55,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:55" (1/1) ... [2019-11-20 00:03:55,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:55" (1/1) ... [2019-11-20 00:03:55,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:03:55,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:03:55,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:03:55,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:03:55,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3b47a2a-1d00-43d5-b855-dd46a4fc2a9b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:03:55,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:03:55,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:03:56,096 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:03:56,097 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-20 00:03:56,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:03:56 BoogieIcfgContainer [2019-11-20 00:03:56,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:03:56,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:03:56,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:03:56,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:03:56,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:03:55" (1/3) ... [2019-11-20 00:03:56,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63381a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:03:56, skipping insertion in model container [2019-11-20 00:03:56,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:03:55" (2/3) ... [2019-11-20 00:03:56,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63381a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:03:56, skipping insertion in model container [2019-11-20 00:03:56,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:03:56" (3/3) ... [2019-11-20 00:03:56,105 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-11-20 00:03:56,114 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:03:56,120 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:03:56,128 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:03:56,145 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:03:56,145 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:03:56,145 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:03:56,145 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:03:56,146 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:03:56,146 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:03:56,146 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:03:56,146 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:03:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-11-20 00:03:56,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 00:03:56,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:56,164 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-20 00:03:56,164 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:56,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:56,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1363603929, now seen corresponding path program 1 times [2019-11-20 00:03:56,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:56,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864266697] [2019-11-20 00:03:56,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:56,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864266697] [2019-11-20 00:03:56,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:56,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:56,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146096528] [2019-11-20 00:03:56,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:56,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:56,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:56,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:56,347 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2019-11-20 00:03:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:56,402 INFO L93 Difference]: Finished difference Result 94 states and 168 transitions. [2019-11-20 00:03:56,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:56,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-20 00:03:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:56,415 INFO L225 Difference]: With dead ends: 94 [2019-11-20 00:03:56,415 INFO L226 Difference]: Without dead ends: 80 [2019-11-20 00:03:56,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-20 00:03:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2019-11-20 00:03:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-20 00:03:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 101 transitions. [2019-11-20 00:03:56,455 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 101 transitions. Word has length 18 [2019-11-20 00:03:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:56,456 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 101 transitions. [2019-11-20 00:03:56,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 101 transitions. [2019-11-20 00:03:56,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 00:03:56,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:56,457 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-20 00:03:56,457 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:56,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:56,458 INFO L82 PathProgramCache]: Analyzing trace with hash 83740251, now seen corresponding path program 1 times [2019-11-20 00:03:56,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:56,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484203792] [2019-11-20 00:03:56,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:56,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484203792] [2019-11-20 00:03:56,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:56,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:56,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648740952] [2019-11-20 00:03:56,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:56,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:56,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:56,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:56,538 INFO L87 Difference]: Start difference. First operand 54 states and 101 transitions. Second operand 3 states. [2019-11-20 00:03:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:56,561 INFO L93 Difference]: Finished difference Result 133 states and 248 transitions. [2019-11-20 00:03:56,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:56,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-20 00:03:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:56,563 INFO L225 Difference]: With dead ends: 133 [2019-11-20 00:03:56,564 INFO L226 Difference]: Without dead ends: 80 [2019-11-20 00:03:56,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:56,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-20 00:03:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-11-20 00:03:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-20 00:03:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 145 transitions. [2019-11-20 00:03:56,576 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 145 transitions. Word has length 18 [2019-11-20 00:03:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:56,577 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 145 transitions. [2019-11-20 00:03:56,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 145 transitions. [2019-11-20 00:03:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 00:03:56,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:56,578 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-20 00:03:56,578 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:56,579 INFO L82 PathProgramCache]: Analyzing trace with hash -677738462, now seen corresponding path program 1 times [2019-11-20 00:03:56,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:56,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741843822] [2019-11-20 00:03:56,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:56,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741843822] [2019-11-20 00:03:56,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:56,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:56,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981240926] [2019-11-20 00:03:56,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:56,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:56,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:56,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:56,647 INFO L87 Difference]: Start difference. First operand 78 states and 145 transitions. Second operand 3 states. [2019-11-20 00:03:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:56,685 INFO L93 Difference]: Finished difference Result 122 states and 221 transitions. [2019-11-20 00:03:56,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:56,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 00:03:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:56,687 INFO L225 Difference]: With dead ends: 122 [2019-11-20 00:03:56,688 INFO L226 Difference]: Without dead ends: 83 [2019-11-20 00:03:56,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-20 00:03:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-20 00:03:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-20 00:03:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 147 transitions. [2019-11-20 00:03:56,701 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 147 transitions. Word has length 19 [2019-11-20 00:03:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:56,701 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 147 transitions. [2019-11-20 00:03:56,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 147 transitions. [2019-11-20 00:03:56,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 00:03:56,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:56,703 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-20 00:03:56,705 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:56,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1698806816, now seen corresponding path program 1 times [2019-11-20 00:03:56,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:56,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244926864] [2019-11-20 00:03:56,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:56,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244926864] [2019-11-20 00:03:56,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:56,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:56,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297333183] [2019-11-20 00:03:56,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:56,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:56,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:56,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:56,759 INFO L87 Difference]: Start difference. First operand 81 states and 147 transitions. Second operand 3 states. [2019-11-20 00:03:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:56,796 INFO L93 Difference]: Finished difference Result 156 states and 284 transitions. [2019-11-20 00:03:56,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:56,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 00:03:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:56,798 INFO L225 Difference]: With dead ends: 156 [2019-11-20 00:03:56,799 INFO L226 Difference]: Without dead ends: 154 [2019-11-20 00:03:56,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-20 00:03:56,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 108. [2019-11-20 00:03:56,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-20 00:03:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 196 transitions. [2019-11-20 00:03:56,810 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 196 transitions. Word has length 19 [2019-11-20 00:03:56,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:56,811 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 196 transitions. [2019-11-20 00:03:56,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 196 transitions. [2019-11-20 00:03:56,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 00:03:56,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:56,812 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-20 00:03:56,812 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:56,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:56,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1316296802, now seen corresponding path program 1 times [2019-11-20 00:03:56,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:56,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290514761] [2019-11-20 00:03:56,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:56,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:56,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290514761] [2019-11-20 00:03:56,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:56,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:56,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988039639] [2019-11-20 00:03:56,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:56,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:56,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:56,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:56,861 INFO L87 Difference]: Start difference. First operand 108 states and 196 transitions. Second operand 3 states. [2019-11-20 00:03:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:56,878 INFO L93 Difference]: Finished difference Result 260 states and 474 transitions. [2019-11-20 00:03:56,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:56,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-20 00:03:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:56,880 INFO L225 Difference]: With dead ends: 260 [2019-11-20 00:03:56,880 INFO L226 Difference]: Without dead ends: 156 [2019-11-20 00:03:56,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:56,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-20 00:03:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-11-20 00:03:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-20 00:03:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 278 transitions. [2019-11-20 00:03:56,893 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 278 transitions. Word has length 19 [2019-11-20 00:03:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:56,893 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 278 transitions. [2019-11-20 00:03:56,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 278 transitions. [2019-11-20 00:03:56,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 00:03:56,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:56,895 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-20 00:03:56,895 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:56,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:56,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1123190704, now seen corresponding path program 1 times [2019-11-20 00:03:56,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:56,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283111530] [2019-11-20 00:03:56,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:56,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283111530] [2019-11-20 00:03:56,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:56,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:56,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337100774] [2019-11-20 00:03:56,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:56,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:56,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:56,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:56,927 INFO L87 Difference]: Start difference. First operand 154 states and 278 transitions. Second operand 3 states. [2019-11-20 00:03:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:56,944 INFO L93 Difference]: Finished difference Result 233 states and 417 transitions. [2019-11-20 00:03:56,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:56,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-20 00:03:56,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:56,946 INFO L225 Difference]: With dead ends: 233 [2019-11-20 00:03:56,946 INFO L226 Difference]: Without dead ends: 158 [2019-11-20 00:03:56,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-20 00:03:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2019-11-20 00:03:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-20 00:03:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 278 transitions. [2019-11-20 00:03:56,958 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 278 transitions. Word has length 20 [2019-11-20 00:03:56,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:56,959 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 278 transitions. [2019-11-20 00:03:56,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 278 transitions. [2019-11-20 00:03:56,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 00:03:56,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:56,960 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-20 00:03:56,960 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:56,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:56,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2144259058, now seen corresponding path program 1 times [2019-11-20 00:03:56,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:56,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821425944] [2019-11-20 00:03:56,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:57,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821425944] [2019-11-20 00:03:57,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:57,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:57,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19074545] [2019-11-20 00:03:57,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:57,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:57,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:57,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,005 INFO L87 Difference]: Start difference. First operand 156 states and 278 transitions. Second operand 3 states. [2019-11-20 00:03:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:57,033 INFO L93 Difference]: Finished difference Result 452 states and 808 transitions. [2019-11-20 00:03:57,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:57,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-20 00:03:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:57,036 INFO L225 Difference]: With dead ends: 452 [2019-11-20 00:03:57,037 INFO L226 Difference]: Without dead ends: 302 [2019-11-20 00:03:57,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-20 00:03:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-11-20 00:03:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-20 00:03:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 530 transitions. [2019-11-20 00:03:57,063 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 530 transitions. Word has length 20 [2019-11-20 00:03:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:57,063 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 530 transitions. [2019-11-20 00:03:57,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 530 transitions. [2019-11-20 00:03:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 00:03:57,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:57,069 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-20 00:03:57,070 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:57,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:57,070 INFO L82 PathProgramCache]: Analyzing trace with hash -864395380, now seen corresponding path program 1 times [2019-11-20 00:03:57,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:57,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739888314] [2019-11-20 00:03:57,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:57,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739888314] [2019-11-20 00:03:57,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:57,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:57,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832381412] [2019-11-20 00:03:57,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:57,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:57,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:57,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,098 INFO L87 Difference]: Start difference. First operand 300 states and 530 transitions. Second operand 3 states. [2019-11-20 00:03:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:57,114 INFO L93 Difference]: Finished difference Result 384 states and 684 transitions. [2019-11-20 00:03:57,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:57,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-20 00:03:57,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:57,117 INFO L225 Difference]: With dead ends: 384 [2019-11-20 00:03:57,117 INFO L226 Difference]: Without dead ends: 382 [2019-11-20 00:03:57,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-20 00:03:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 300. [2019-11-20 00:03:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-20 00:03:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 526 transitions. [2019-11-20 00:03:57,129 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 526 transitions. Word has length 20 [2019-11-20 00:03:57,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:57,129 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 526 transitions. [2019-11-20 00:03:57,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 526 transitions. [2019-11-20 00:03:57,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 00:03:57,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:57,131 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-20 00:03:57,131 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:57,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:57,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2047307977, now seen corresponding path program 1 times [2019-11-20 00:03:57,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:57,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392441300] [2019-11-20 00:03:57,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:57,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392441300] [2019-11-20 00:03:57,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:57,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:57,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641329553] [2019-11-20 00:03:57,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:57,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:57,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:57,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,184 INFO L87 Difference]: Start difference. First operand 300 states and 526 transitions. Second operand 3 states. [2019-11-20 00:03:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:57,214 INFO L93 Difference]: Finished difference Result 564 states and 1000 transitions. [2019-11-20 00:03:57,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:57,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-20 00:03:57,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:57,221 INFO L225 Difference]: With dead ends: 564 [2019-11-20 00:03:57,221 INFO L226 Difference]: Without dead ends: 562 [2019-11-20 00:03:57,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-11-20 00:03:57,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 416. [2019-11-20 00:03:57,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-20 00:03:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 718 transitions. [2019-11-20 00:03:57,245 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 718 transitions. Word has length 21 [2019-11-20 00:03:57,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:57,245 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 718 transitions. [2019-11-20 00:03:57,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 718 transitions. [2019-11-20 00:03:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 00:03:57,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:57,247 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-20 00:03:57,247 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:57,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:57,247 INFO L82 PathProgramCache]: Analyzing trace with hash 967795641, now seen corresponding path program 1 times [2019-11-20 00:03:57,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:57,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138209801] [2019-11-20 00:03:57,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:57,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138209801] [2019-11-20 00:03:57,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:57,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:57,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669860911] [2019-11-20 00:03:57,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:57,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:57,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:57,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,292 INFO L87 Difference]: Start difference. First operand 416 states and 718 transitions. Second operand 3 states. [2019-11-20 00:03:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:57,341 INFO L93 Difference]: Finished difference Result 996 states and 1728 transitions. [2019-11-20 00:03:57,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:57,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-20 00:03:57,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:57,349 INFO L225 Difference]: With dead ends: 996 [2019-11-20 00:03:57,349 INFO L226 Difference]: Without dead ends: 586 [2019-11-20 00:03:57,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-20 00:03:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-11-20 00:03:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-20 00:03:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1002 transitions. [2019-11-20 00:03:57,378 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1002 transitions. Word has length 21 [2019-11-20 00:03:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:57,389 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 1002 transitions. [2019-11-20 00:03:57,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:57,389 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1002 transitions. [2019-11-20 00:03:57,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 00:03:57,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:57,394 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-20 00:03:57,394 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:57,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:57,394 INFO L82 PathProgramCache]: Analyzing trace with hash 958175875, now seen corresponding path program 1 times [2019-11-20 00:03:57,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:57,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34396865] [2019-11-20 00:03:57,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:57,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34396865] [2019-11-20 00:03:57,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:57,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:57,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920771008] [2019-11-20 00:03:57,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:57,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:57,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:57,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,427 INFO L87 Difference]: Start difference. First operand 584 states and 1002 transitions. Second operand 3 states. [2019-11-20 00:03:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:57,456 INFO L93 Difference]: Finished difference Result 884 states and 1512 transitions. [2019-11-20 00:03:57,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:57,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-20 00:03:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:57,460 INFO L225 Difference]: With dead ends: 884 [2019-11-20 00:03:57,460 INFO L226 Difference]: Without dead ends: 598 [2019-11-20 00:03:57,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-20 00:03:57,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-11-20 00:03:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-11-20 00:03:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1010 transitions. [2019-11-20 00:03:57,481 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1010 transitions. Word has length 22 [2019-11-20 00:03:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:57,482 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1010 transitions. [2019-11-20 00:03:57,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1010 transitions. [2019-11-20 00:03:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 00:03:57,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:57,484 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-20 00:03:57,485 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:57,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:57,485 INFO L82 PathProgramCache]: Analyzing trace with hash -62892479, now seen corresponding path program 1 times [2019-11-20 00:03:57,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:57,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326174774] [2019-11-20 00:03:57,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:57,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-20 00:03:57,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326174774] [2019-11-20 00:03:57,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:57,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:57,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506770546] [2019-11-20 00:03:57,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:57,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:57,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:57,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,527 INFO L87 Difference]: Start difference. First operand 596 states and 1010 transitions. Second operand 3 states. [2019-11-20 00:03:57,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:57,556 INFO L93 Difference]: Finished difference Result 1096 states and 1884 transitions. [2019-11-20 00:03:57,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:57,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-20 00:03:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:57,565 INFO L225 Difference]: With dead ends: 1096 [2019-11-20 00:03:57,565 INFO L226 Difference]: Without dead ends: 1094 [2019-11-20 00:03:57,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-11-20 00:03:57,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 836. [2019-11-20 00:03:57,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-11-20 00:03:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1386 transitions. [2019-11-20 00:03:57,595 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1386 transitions. Word has length 22 [2019-11-20 00:03:57,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:57,595 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1386 transitions. [2019-11-20 00:03:57,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1386 transitions. [2019-11-20 00:03:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 00:03:57,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:57,598 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-20 00:03:57,598 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:57,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1342756157, now seen corresponding path program 1 times [2019-11-20 00:03:57,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:57,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722396712] [2019-11-20 00:03:57,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:57,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722396712] [2019-11-20 00:03:57,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:57,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:57,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711779499] [2019-11-20 00:03:57,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:57,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:57,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:57,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,635 INFO L87 Difference]: Start difference. First operand 836 states and 1386 transitions. Second operand 3 states. [2019-11-20 00:03:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:57,664 INFO L93 Difference]: Finished difference Result 1976 states and 3292 transitions. [2019-11-20 00:03:57,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:57,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-20 00:03:57,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:57,672 INFO L225 Difference]: With dead ends: 1976 [2019-11-20 00:03:57,672 INFO L226 Difference]: Without dead ends: 1158 [2019-11-20 00:03:57,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-11-20 00:03:57,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2019-11-20 00:03:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-11-20 00:03:57,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1906 transitions. [2019-11-20 00:03:57,710 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1906 transitions. Word has length 22 [2019-11-20 00:03:57,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:57,711 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1906 transitions. [2019-11-20 00:03:57,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1906 transitions. [2019-11-20 00:03:57,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 00:03:57,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:57,713 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-20 00:03:57,713 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:57,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:57,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1949452786, now seen corresponding path program 1 times [2019-11-20 00:03:57,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:57,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443781340] [2019-11-20 00:03:57,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:57,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443781340] [2019-11-20 00:03:57,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:57,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:57,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767920530] [2019-11-20 00:03:57,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:57,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:57,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:57,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,734 INFO L87 Difference]: Start difference. First operand 1156 states and 1906 transitions. Second operand 3 states. [2019-11-20 00:03:57,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:57,760 INFO L93 Difference]: Finished difference Result 1736 states and 2852 transitions. [2019-11-20 00:03:57,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:57,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 00:03:57,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:57,767 INFO L225 Difference]: With dead ends: 1736 [2019-11-20 00:03:57,767 INFO L226 Difference]: Without dead ends: 1174 [2019-11-20 00:03:57,768 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-11-20 00:03:57,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1172. [2019-11-20 00:03:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1172 states. [2019-11-20 00:03:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1906 transitions. [2019-11-20 00:03:57,804 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1906 transitions. Word has length 23 [2019-11-20 00:03:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:57,805 INFO L462 AbstractCegarLoop]: Abstraction has 1172 states and 1906 transitions. [2019-11-20 00:03:57,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1906 transitions. [2019-11-20 00:03:57,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 00:03:57,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:57,807 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-20 00:03:57,807 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:57,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:57,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1324446156, now seen corresponding path program 1 times [2019-11-20 00:03:57,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:57,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620188205] [2019-11-20 00:03:57,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:57,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620188205] [2019-11-20 00:03:57,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:57,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:57,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204691412] [2019-11-20 00:03:57,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:57,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:57,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:57,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,827 INFO L87 Difference]: Start difference. First operand 1172 states and 1906 transitions. Second operand 3 states. [2019-11-20 00:03:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:57,859 INFO L93 Difference]: Finished difference Result 2120 states and 3508 transitions. [2019-11-20 00:03:57,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:57,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 00:03:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:57,872 INFO L225 Difference]: With dead ends: 2120 [2019-11-20 00:03:57,872 INFO L226 Difference]: Without dead ends: 2118 [2019-11-20 00:03:57,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-11-20 00:03:57,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 1668. [2019-11-20 00:03:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2019-11-20 00:03:57,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2642 transitions. [2019-11-20 00:03:57,932 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2642 transitions. Word has length 23 [2019-11-20 00:03:57,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:57,932 INFO L462 AbstractCegarLoop]: Abstraction has 1668 states and 2642 transitions. [2019-11-20 00:03:57,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:57,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2642 transitions. [2019-11-20 00:03:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 00:03:57,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:57,935 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-20 00:03:57,935 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:57,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:57,935 INFO L82 PathProgramCache]: Analyzing trace with hash 44582478, now seen corresponding path program 1 times [2019-11-20 00:03:57,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:57,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254130064] [2019-11-20 00:03:57,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:57,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254130064] [2019-11-20 00:03:57,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:57,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:57,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244157535] [2019-11-20 00:03:57,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:57,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:57,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:57,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:57,963 INFO L87 Difference]: Start difference. First operand 1668 states and 2642 transitions. Second operand 3 states. [2019-11-20 00:03:58,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:58,033 INFO L93 Difference]: Finished difference Result 3912 states and 6228 transitions. [2019-11-20 00:03:58,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:58,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 00:03:58,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:58,046 INFO L225 Difference]: With dead ends: 3912 [2019-11-20 00:03:58,046 INFO L226 Difference]: Without dead ends: 2278 [2019-11-20 00:03:58,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:58,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-11-20 00:03:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2276. [2019-11-20 00:03:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2276 states. [2019-11-20 00:03:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3586 transitions. [2019-11-20 00:03:58,112 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3586 transitions. Word has length 23 [2019-11-20 00:03:58,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:58,112 INFO L462 AbstractCegarLoop]: Abstraction has 2276 states and 3586 transitions. [2019-11-20 00:03:58,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3586 transitions. [2019-11-20 00:03:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 00:03:58,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:58,115 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-20 00:03:58,115 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:58,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:58,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1891627720, now seen corresponding path program 1 times [2019-11-20 00:03:58,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:58,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153716733] [2019-11-20 00:03:58,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:58,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153716733] [2019-11-20 00:03:58,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:58,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:58,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188430119] [2019-11-20 00:03:58,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:58,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:58,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:58,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:58,139 INFO L87 Difference]: Start difference. First operand 2276 states and 3586 transitions. Second operand 3 states. [2019-11-20 00:03:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:58,186 INFO L93 Difference]: Finished difference Result 3416 states and 5364 transitions. [2019-11-20 00:03:58,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:58,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-20 00:03:58,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:58,213 INFO L225 Difference]: With dead ends: 3416 [2019-11-20 00:03:58,216 INFO L226 Difference]: Without dead ends: 2310 [2019-11-20 00:03:58,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-11-20 00:03:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2308. [2019-11-20 00:03:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-11-20 00:03:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 3586 transitions. [2019-11-20 00:03:58,284 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 3586 transitions. Word has length 24 [2019-11-20 00:03:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:58,284 INFO L462 AbstractCegarLoop]: Abstraction has 2308 states and 3586 transitions. [2019-11-20 00:03:58,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3586 transitions. [2019-11-20 00:03:58,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 00:03:58,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:58,287 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-20 00:03:58,287 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:58,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:58,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1382271222, now seen corresponding path program 1 times [2019-11-20 00:03:58,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:58,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679255634] [2019-11-20 00:03:58,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:58,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679255634] [2019-11-20 00:03:58,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:58,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:58,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294130934] [2019-11-20 00:03:58,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:58,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:58,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:58,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:58,312 INFO L87 Difference]: Start difference. First operand 2308 states and 3586 transitions. Second operand 3 states. [2019-11-20 00:03:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:58,365 INFO L93 Difference]: Finished difference Result 4104 states and 6500 transitions. [2019-11-20 00:03:58,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:58,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-20 00:03:58,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:58,387 INFO L225 Difference]: With dead ends: 4104 [2019-11-20 00:03:58,387 INFO L226 Difference]: Without dead ends: 4102 [2019-11-20 00:03:58,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:58,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4102 states. [2019-11-20 00:03:58,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4102 to 3332. [2019-11-20 00:03:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2019-11-20 00:03:58,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 5026 transitions. [2019-11-20 00:03:58,475 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 5026 transitions. Word has length 24 [2019-11-20 00:03:58,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:58,476 INFO L462 AbstractCegarLoop]: Abstraction has 3332 states and 5026 transitions. [2019-11-20 00:03:58,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 5026 transitions. [2019-11-20 00:03:58,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 00:03:58,480 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:58,480 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-20 00:03:58,480 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:58,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:58,480 INFO L82 PathProgramCache]: Analyzing trace with hash 102407544, now seen corresponding path program 1 times [2019-11-20 00:03:58,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:58,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042717760] [2019-11-20 00:03:58,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:58,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042717760] [2019-11-20 00:03:58,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:58,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:58,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415496927] [2019-11-20 00:03:58,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:58,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:58,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:58,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:58,509 INFO L87 Difference]: Start difference. First operand 3332 states and 5026 transitions. Second operand 3 states. [2019-11-20 00:03:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:58,592 INFO L93 Difference]: Finished difference Result 7752 states and 11748 transitions. [2019-11-20 00:03:58,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:58,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-20 00:03:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:58,614 INFO L225 Difference]: With dead ends: 7752 [2019-11-20 00:03:58,615 INFO L226 Difference]: Without dead ends: 4486 [2019-11-20 00:03:58,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-11-20 00:03:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 4484. [2019-11-20 00:03:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4484 states. [2019-11-20 00:03:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6722 transitions. [2019-11-20 00:03:58,749 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6722 transitions. Word has length 24 [2019-11-20 00:03:58,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:58,749 INFO L462 AbstractCegarLoop]: Abstraction has 4484 states and 6722 transitions. [2019-11-20 00:03:58,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6722 transitions. [2019-11-20 00:03:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 00:03:58,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:58,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, 1, 1, 1, 1, 1] [2019-11-20 00:03:58,754 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:58,755 INFO L82 PathProgramCache]: Analyzing trace with hash -99050333, now seen corresponding path program 1 times [2019-11-20 00:03:58,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:58,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243140030] [2019-11-20 00:03:58,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:58,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243140030] [2019-11-20 00:03:58,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:58,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:58,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268885248] [2019-11-20 00:03:58,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:58,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:58,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:58,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:58,774 INFO L87 Difference]: Start difference. First operand 4484 states and 6722 transitions. Second operand 3 states. [2019-11-20 00:03:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:58,839 INFO L93 Difference]: Finished difference Result 6728 states and 10052 transitions. [2019-11-20 00:03:58,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:58,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-20 00:03:58,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:58,866 INFO L225 Difference]: With dead ends: 6728 [2019-11-20 00:03:58,866 INFO L226 Difference]: Without dead ends: 4550 [2019-11-20 00:03:58,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2019-11-20 00:03:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4548. [2019-11-20 00:03:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4548 states. [2019-11-20 00:03:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 6722 transitions. [2019-11-20 00:03:59,023 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 6722 transitions. Word has length 25 [2019-11-20 00:03:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:59,023 INFO L462 AbstractCegarLoop]: Abstraction has 4548 states and 6722 transitions. [2019-11-20 00:03:59,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 6722 transitions. [2019-11-20 00:03:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 00:03:59,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:59,028 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-20 00:03:59,028 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:59,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:59,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1120118687, now seen corresponding path program 1 times [2019-11-20 00:03:59,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:59,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374307638] [2019-11-20 00:03:59,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:59,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374307638] [2019-11-20 00:03:59,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:59,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:59,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880076691] [2019-11-20 00:03:59,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:59,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:59,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:59,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:59,044 INFO L87 Difference]: Start difference. First operand 4548 states and 6722 transitions. Second operand 3 states. [2019-11-20 00:03:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:59,135 INFO L93 Difference]: Finished difference Result 7944 states and 11972 transitions. [2019-11-20 00:03:59,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:59,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-20 00:03:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:59,160 INFO L225 Difference]: With dead ends: 7944 [2019-11-20 00:03:59,160 INFO L226 Difference]: Without dead ends: 7942 [2019-11-20 00:03:59,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7942 states. [2019-11-20 00:03:59,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7942 to 6660. [2019-11-20 00:03:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-11-20 00:03:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 9538 transitions. [2019-11-20 00:03:59,307 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 9538 transitions. Word has length 25 [2019-11-20 00:03:59,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:59,308 INFO L462 AbstractCegarLoop]: Abstraction has 6660 states and 9538 transitions. [2019-11-20 00:03:59,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 9538 transitions. [2019-11-20 00:03:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 00:03:59,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:59,316 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-20 00:03:59,317 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:59,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1894984931, now seen corresponding path program 1 times [2019-11-20 00:03:59,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:59,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772092746] [2019-11-20 00:03:59,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:59,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:59,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772092746] [2019-11-20 00:03:59,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:59,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:59,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836686761] [2019-11-20 00:03:59,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:59,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:59,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:59,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:59,337 INFO L87 Difference]: Start difference. First operand 6660 states and 9538 transitions. Second operand 3 states. [2019-11-20 00:03:59,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:59,438 INFO L93 Difference]: Finished difference Result 15368 states and 22084 transitions. [2019-11-20 00:03:59,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:59,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-20 00:03:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:59,453 INFO L225 Difference]: With dead ends: 15368 [2019-11-20 00:03:59,453 INFO L226 Difference]: Without dead ends: 8838 [2019-11-20 00:03:59,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:59,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8838 states. [2019-11-20 00:03:59,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8838 to 8836. [2019-11-20 00:03:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8836 states. [2019-11-20 00:03:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8836 states to 8836 states and 12546 transitions. [2019-11-20 00:03:59,651 INFO L78 Accepts]: Start accepts. Automaton has 8836 states and 12546 transitions. Word has length 25 [2019-11-20 00:03:59,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:03:59,652 INFO L462 AbstractCegarLoop]: Abstraction has 8836 states and 12546 transitions. [2019-11-20 00:03:59,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:03:59,652 INFO L276 IsEmpty]: Start isEmpty. Operand 8836 states and 12546 transitions. [2019-11-20 00:03:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 00:03:59,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:03:59,661 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-20 00:03:59,663 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:03:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:03:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash -363725843, now seen corresponding path program 1 times [2019-11-20 00:03:59,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:03:59,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053719819] [2019-11-20 00:03:59,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:03:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:03:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:03:59,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053719819] [2019-11-20 00:03:59,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:03:59,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:03:59,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856711411] [2019-11-20 00:03:59,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:03:59,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:03:59,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:03:59,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:59,689 INFO L87 Difference]: Start difference. First operand 8836 states and 12546 transitions. Second operand 3 states. [2019-11-20 00:03:59,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:03:59,786 INFO L93 Difference]: Finished difference Result 13256 states and 18756 transitions. [2019-11-20 00:03:59,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:03:59,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-20 00:03:59,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:03:59,804 INFO L225 Difference]: With dead ends: 13256 [2019-11-20 00:03:59,804 INFO L226 Difference]: Without dead ends: 8966 [2019-11-20 00:03:59,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:03:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8966 states. [2019-11-20 00:04:00,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8966 to 8964. [2019-11-20 00:04:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2019-11-20 00:04:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 12546 transitions. [2019-11-20 00:04:00,068 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 12546 transitions. Word has length 26 [2019-11-20 00:04:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:00,068 INFO L462 AbstractCegarLoop]: Abstraction has 8964 states and 12546 transitions. [2019-11-20 00:04:00,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:04:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 12546 transitions. [2019-11-20 00:04:00,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 00:04:00,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:04:00,077 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-20 00:04:00,078 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:04:00,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:04:00,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1384794197, now seen corresponding path program 1 times [2019-11-20 00:04:00,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:04:00,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343539099] [2019-11-20 00:04:00,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:04:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:04:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:00,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343539099] [2019-11-20 00:04:00,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:04:00,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:04:00,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163208656] [2019-11-20 00:04:00,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:04:00,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:04:00,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:04:00,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:00,099 INFO L87 Difference]: Start difference. First operand 8964 states and 12546 transitions. Second operand 3 states. [2019-11-20 00:04:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:04:00,248 INFO L93 Difference]: Finished difference Result 15368 states and 21892 transitions. [2019-11-20 00:04:00,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:04:00,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-20 00:04:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:04:00,275 INFO L225 Difference]: With dead ends: 15368 [2019-11-20 00:04:00,275 INFO L226 Difference]: Without dead ends: 15366 [2019-11-20 00:04:00,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15366 states. [2019-11-20 00:04:00,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15366 to 13316. [2019-11-20 00:04:00,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13316 states. [2019-11-20 00:04:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13316 states to 13316 states and 18050 transitions. [2019-11-20 00:04:00,535 INFO L78 Accepts]: Start accepts. Automaton has 13316 states and 18050 transitions. Word has length 26 [2019-11-20 00:04:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:00,535 INFO L462 AbstractCegarLoop]: Abstraction has 13316 states and 18050 transitions. [2019-11-20 00:04:00,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:04:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 13316 states and 18050 transitions. [2019-11-20 00:04:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 00:04:00,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:04:00,552 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-20 00:04:00,552 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:04:00,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:04:00,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1630309421, now seen corresponding path program 1 times [2019-11-20 00:04:00,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:04:00,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555384154] [2019-11-20 00:04:00,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:04:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:04:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:00,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555384154] [2019-11-20 00:04:00,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:04:00,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:04:00,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357784718] [2019-11-20 00:04:00,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:04:00,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:04:00,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:04:00,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:00,576 INFO L87 Difference]: Start difference. First operand 13316 states and 18050 transitions. Second operand 3 states. [2019-11-20 00:04:00,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:04:00,821 INFO L93 Difference]: Finished difference Result 30472 states and 41348 transitions. [2019-11-20 00:04:00,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:04:00,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-20 00:04:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:04:00,848 INFO L225 Difference]: With dead ends: 30472 [2019-11-20 00:04:00,848 INFO L226 Difference]: Without dead ends: 17414 [2019-11-20 00:04:00,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:00,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17414 states. [2019-11-20 00:04:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17414 to 17412. [2019-11-20 00:04:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2019-11-20 00:04:01,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 23298 transitions. [2019-11-20 00:04:01,165 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 23298 transitions. Word has length 26 [2019-11-20 00:04:01,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:01,166 INFO L462 AbstractCegarLoop]: Abstraction has 17412 states and 23298 transitions. [2019-11-20 00:04:01,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:04:01,166 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 23298 transitions. [2019-11-20 00:04:01,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 00:04:01,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:04:01,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, 1, 1] [2019-11-20 00:04:01,183 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:04:01,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:04:01,183 INFO L82 PathProgramCache]: Analyzing trace with hash 21268280, now seen corresponding path program 1 times [2019-11-20 00:04:01,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:04:01,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449416734] [2019-11-20 00:04:01,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:04:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:04:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:01,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449416734] [2019-11-20 00:04:01,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:04:01,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:04:01,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486872554] [2019-11-20 00:04:01,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:04:01,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:04:01,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:04:01,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:01,198 INFO L87 Difference]: Start difference. First operand 17412 states and 23298 transitions. Second operand 3 states. [2019-11-20 00:04:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:04:01,366 INFO L93 Difference]: Finished difference Result 26120 states and 34820 transitions. [2019-11-20 00:04:01,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:04:01,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-20 00:04:01,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:04:01,395 INFO L225 Difference]: With dead ends: 26120 [2019-11-20 00:04:01,396 INFO L226 Difference]: Without dead ends: 17670 [2019-11-20 00:04:01,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:01,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17670 states. [2019-11-20 00:04:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17670 to 17668. [2019-11-20 00:04:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17668 states. [2019-11-20 00:04:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17668 states to 17668 states and 23298 transitions. [2019-11-20 00:04:01,879 INFO L78 Accepts]: Start accepts. Automaton has 17668 states and 23298 transitions. Word has length 27 [2019-11-20 00:04:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:01,880 INFO L462 AbstractCegarLoop]: Abstraction has 17668 states and 23298 transitions. [2019-11-20 00:04:01,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:04:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 17668 states and 23298 transitions. [2019-11-20 00:04:01,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 00:04:01,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:04:01,897 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-20 00:04:01,897 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:04:01,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:04:01,898 INFO L82 PathProgramCache]: Analyzing trace with hash -999800074, now seen corresponding path program 1 times [2019-11-20 00:04:01,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:04:01,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504571330] [2019-11-20 00:04:01,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:04:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:04:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:01,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504571330] [2019-11-20 00:04:01,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:04:01,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:04:01,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456090603] [2019-11-20 00:04:01,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:04:01,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:04:01,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:04:01,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:01,913 INFO L87 Difference]: Start difference. First operand 17668 states and 23298 transitions. Second operand 3 states. [2019-11-20 00:04:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:04:02,178 INFO L93 Difference]: Finished difference Result 29704 states and 39684 transitions. [2019-11-20 00:04:02,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:04:02,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-20 00:04:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:04:02,228 INFO L225 Difference]: With dead ends: 29704 [2019-11-20 00:04:02,228 INFO L226 Difference]: Without dead ends: 29702 [2019-11-20 00:04:02,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:02,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29702 states. [2019-11-20 00:04:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29702 to 26628. [2019-11-20 00:04:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26628 states. [2019-11-20 00:04:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26628 states to 26628 states and 34050 transitions. [2019-11-20 00:04:02,707 INFO L78 Accepts]: Start accepts. Automaton has 26628 states and 34050 transitions. Word has length 27 [2019-11-20 00:04:02,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:02,708 INFO L462 AbstractCegarLoop]: Abstraction has 26628 states and 34050 transitions. [2019-11-20 00:04:02,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:04:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 26628 states and 34050 transitions. [2019-11-20 00:04:02,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 00:04:02,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:04:02,745 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-20 00:04:02,745 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:04:02,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:04:02,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2015303544, now seen corresponding path program 1 times [2019-11-20 00:04:02,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:04:02,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549621543] [2019-11-20 00:04:02,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:04:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:04:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:02,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549621543] [2019-11-20 00:04:02,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:04:02,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:04:02,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590503296] [2019-11-20 00:04:02,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:04:02,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:04:02,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:04:02,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:02,772 INFO L87 Difference]: Start difference. First operand 26628 states and 34050 transitions. Second operand 3 states. [2019-11-20 00:04:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:04:03,264 INFO L93 Difference]: Finished difference Result 60424 states and 77060 transitions. [2019-11-20 00:04:03,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:04:03,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-20 00:04:03,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:04:03,317 INFO L225 Difference]: With dead ends: 60424 [2019-11-20 00:04:03,317 INFO L226 Difference]: Without dead ends: 34310 [2019-11-20 00:04:03,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:03,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34310 states. [2019-11-20 00:04:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34310 to 34308. [2019-11-20 00:04:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34308 states. [2019-11-20 00:04:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34308 states to 34308 states and 43010 transitions. [2019-11-20 00:04:03,880 INFO L78 Accepts]: Start accepts. Automaton has 34308 states and 43010 transitions. Word has length 27 [2019-11-20 00:04:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:03,880 INFO L462 AbstractCegarLoop]: Abstraction has 34308 states and 43010 transitions. [2019-11-20 00:04:03,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:04:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 34308 states and 43010 transitions. [2019-11-20 00:04:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 00:04:03,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:04:03,906 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-20 00:04:03,907 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:04:03,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:04:03,907 INFO L82 PathProgramCache]: Analyzing trace with hash -928815454, now seen corresponding path program 1 times [2019-11-20 00:04:03,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:04:03,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402212309] [2019-11-20 00:04:03,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:04:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:04:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:03,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402212309] [2019-11-20 00:04:03,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:04:03,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:04:03,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122189136] [2019-11-20 00:04:03,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:04:03,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:04:03,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:04:03,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:03,926 INFO L87 Difference]: Start difference. First operand 34308 states and 43010 transitions. Second operand 3 states. [2019-11-20 00:04:04,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:04:04,292 INFO L93 Difference]: Finished difference Result 51464 states and 64260 transitions. [2019-11-20 00:04:04,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:04:04,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-20 00:04:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:04:04,333 INFO L225 Difference]: With dead ends: 51464 [2019-11-20 00:04:04,333 INFO L226 Difference]: Without dead ends: 34822 [2019-11-20 00:04:04,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:04,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34822 states. [2019-11-20 00:04:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34822 to 34820. [2019-11-20 00:04:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34820 states. [2019-11-20 00:04:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34820 states to 34820 states and 43010 transitions. [2019-11-20 00:04:05,201 INFO L78 Accepts]: Start accepts. Automaton has 34820 states and 43010 transitions. Word has length 28 [2019-11-20 00:04:05,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:05,201 INFO L462 AbstractCegarLoop]: Abstraction has 34820 states and 43010 transitions. [2019-11-20 00:04:05,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:04:05,201 INFO L276 IsEmpty]: Start isEmpty. Operand 34820 states and 43010 transitions. [2019-11-20 00:04:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 00:04:05,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:04:05,219 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:04:05,219 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:04:05,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:04:05,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1949883808, now seen corresponding path program 1 times [2019-11-20 00:04:05,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:04:05,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261475362] [2019-11-20 00:04:05,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:04:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:04:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:05,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261475362] [2019-11-20 00:04:05,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:04:05,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:04:05,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021336159] [2019-11-20 00:04:05,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:04:05,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:04:05,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:04:05,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:05,235 INFO L87 Difference]: Start difference. First operand 34820 states and 43010 transitions. Second operand 3 states. [2019-11-20 00:04:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:04:05,789 INFO L93 Difference]: Finished difference Result 101384 states and 122884 transitions. [2019-11-20 00:04:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:04:05,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-20 00:04:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:04:05,864 INFO L225 Difference]: With dead ends: 101384 [2019-11-20 00:04:05,864 INFO L226 Difference]: Without dead ends: 67590 [2019-11-20 00:04:05,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:05,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67590 states. [2019-11-20 00:04:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67590 to 67588. [2019-11-20 00:04:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-11-20 00:04:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 79874 transitions. [2019-11-20 00:04:07,009 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 79874 transitions. Word has length 28 [2019-11-20 00:04:07,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:07,009 INFO L462 AbstractCegarLoop]: Abstraction has 67588 states and 79874 transitions. [2019-11-20 00:04:07,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:04:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 79874 transitions. [2019-11-20 00:04:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 00:04:07,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:04:07,041 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-20 00:04:07,041 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:04:07,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:04:07,041 INFO L82 PathProgramCache]: Analyzing trace with hash -670020130, now seen corresponding path program 1 times [2019-11-20 00:04:07,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:04:07,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436696718] [2019-11-20 00:04:07,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:04:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:04:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:07,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436696718] [2019-11-20 00:04:07,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:04:07,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:04:07,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195602833] [2019-11-20 00:04:07,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:04:07,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:04:07,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:04:07,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:07,062 INFO L87 Difference]: Start difference. First operand 67588 states and 79874 transitions. Second operand 3 states. [2019-11-20 00:04:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:04:08,068 INFO L93 Difference]: Finished difference Result 71688 states and 86020 transitions. [2019-11-20 00:04:08,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:04:08,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-20 00:04:08,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:04:08,134 INFO L225 Difference]: With dead ends: 71688 [2019-11-20 00:04:08,135 INFO L226 Difference]: Without dead ends: 71686 [2019-11-20 00:04:08,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71686 states. [2019-11-20 00:04:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71686 to 67588. [2019-11-20 00:04:08,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67588 states. [2019-11-20 00:04:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67588 states to 67588 states and 78850 transitions. [2019-11-20 00:04:09,047 INFO L78 Accepts]: Start accepts. Automaton has 67588 states and 78850 transitions. Word has length 28 [2019-11-20 00:04:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:09,047 INFO L462 AbstractCegarLoop]: Abstraction has 67588 states and 78850 transitions. [2019-11-20 00:04:09,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:04:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 67588 states and 78850 transitions. [2019-11-20 00:04:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 00:04:09,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:04:09,075 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-20 00:04:09,075 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:04:09,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:04:09,075 INFO L82 PathProgramCache]: Analyzing trace with hash -316639795, now seen corresponding path program 1 times [2019-11-20 00:04:09,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:04:09,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330311107] [2019-11-20 00:04:09,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:04:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:04:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:09,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330311107] [2019-11-20 00:04:09,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:04:09,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:04:09,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142694199] [2019-11-20 00:04:09,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:04:09,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:04:09,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:04:09,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:09,097 INFO L87 Difference]: Start difference. First operand 67588 states and 78850 transitions. Second operand 3 states. [2019-11-20 00:04:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:04:10,233 INFO L93 Difference]: Finished difference Result 109574 states and 126979 transitions. [2019-11-20 00:04:10,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:04:10,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-20 00:04:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:04:10,322 INFO L225 Difference]: With dead ends: 109574 [2019-11-20 00:04:10,322 INFO L226 Difference]: Without dead ends: 109572 [2019-11-20 00:04:10,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:10,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109572 states. [2019-11-20 00:04:11,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109572 to 105476. [2019-11-20 00:04:11,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105476 states. [2019-11-20 00:04:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105476 states to 105476 states and 120834 transitions. [2019-11-20 00:04:11,401 INFO L78 Accepts]: Start accepts. Automaton has 105476 states and 120834 transitions. Word has length 29 [2019-11-20 00:04:11,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:11,401 INFO L462 AbstractCegarLoop]: Abstraction has 105476 states and 120834 transitions. [2019-11-20 00:04:11,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:04:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 105476 states and 120834 transitions. [2019-11-20 00:04:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 00:04:11,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:04:11,458 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-20 00:04:11,458 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:04:11,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:04:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1596503473, now seen corresponding path program 1 times [2019-11-20 00:04:11,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:04:11,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389988219] [2019-11-20 00:04:11,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:04:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:04:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:04:11,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389988219] [2019-11-20 00:04:11,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:04:11,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:04:11,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346052897] [2019-11-20 00:04:11,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:04:11,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:04:11,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:04:11,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:11,482 INFO L87 Difference]: Start difference. First operand 105476 states and 120834 transitions. Second operand 3 states. [2019-11-20 00:04:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:04:13,042 INFO L93 Difference]: Finished difference Result 236548 states and 268290 transitions. [2019-11-20 00:04:13,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:04:13,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-20 00:04:13,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:04:13,043 INFO L225 Difference]: With dead ends: 236548 [2019-11-20 00:04:13,043 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 00:04:13,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:04:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 00:04:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 00:04:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 00:04:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 00:04:13,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-11-20 00:04:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:04:13,141 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:04:13,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:04:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:04:13,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 00:04:13,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 00:04:13,180 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,180 INFO L444 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,180 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,181 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-20 00:04:13,181 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 00:04:13,181 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 00:04:13,181 INFO L444 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-20 00:04:13,181 INFO L444 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-20 00:04:13,181 INFO L444 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,181 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,181 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,181 INFO L444 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,181 INFO L444 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-20 00:04:13,181 INFO L444 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,181 INFO L444 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-20 00:04:13,181 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,182 INFO L447 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-11-20 00:04:13,182 INFO L444 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,182 INFO L444 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,182 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-11-20 00:04:13,182 INFO L444 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,182 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,182 INFO L444 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-20 00:04:13,182 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 00:04:13,182 INFO L444 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,182 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,183 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-11-20 00:04:13,183 INFO L447 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-11-20 00:04:13,183 INFO L444 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-20 00:04:13,183 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 00:04:13,183 INFO L447 ceAbstractionStarter]: At program point L190(lines 4 191) the Hoare annotation is: true [2019-11-20 00:04:13,183 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-20 00:04:13,183 INFO L444 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-11-20 00:04:13,183 INFO L440 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-11-20 00:04:13,183 INFO L444 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,183 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,183 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,183 INFO L444 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,184 INFO L444 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,184 INFO L444 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,184 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,184 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-20 00:04:13,184 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-11-20 00:04:13,184 INFO L444 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2019-11-20 00:04:13,184 INFO L444 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-11-20 00:04:13,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:04:13 BoogieIcfgContainer [2019-11-20 00:04:13,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:04:13,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:04:13,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:04:13,194 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:04:13,195 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:03:56" (3/4) ... [2019-11-20 00:04:13,198 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 00:04:13,212 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 00:04:13,212 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 00:04:13,285 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c3b47a2a-1d00-43d5-b855-dd46a4fc2a9b/bin/uautomizer/witness.graphml [2019-11-20 00:04:13,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:04:13,289 INFO L168 Benchmark]: Toolchain (without parser) took 18019.87 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -185.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-20 00:04:13,290 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:04:13,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -190.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-20 00:04:13,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:04:13,291 INFO L168 Benchmark]: Boogie Preprocessor took 26.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:04:13,291 INFO L168 Benchmark]: RCFGBuilder took 481.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:04:13,292 INFO L168 Benchmark]: TraceAbstraction took 17092.66 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-20 00:04:13,292 INFO L168 Benchmark]: Witness Printer took 91.74 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.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-11-20 00:04:13,295 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -190.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 481.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17092.66 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 91.74 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.5 MB). Peak memory consumption was 9.5 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: 17.0s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3198 SDtfs, 1629 SDslu, 2141 SDs, 0 SdLazy, 175 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s 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: 7.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...