./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_342dbda3-2de7-4c41-a652-83c031829932/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_342dbda3-2de7-4c41-a652-83c031829932/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_342dbda3-2de7-4c41-a652-83c031829932/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_342dbda3-2de7-4c41-a652-83c031829932/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_342dbda3-2de7-4c41-a652-83c031829932/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_342dbda3-2de7-4c41-a652-83c031829932/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:08:33,465 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:08:33,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:08:33,474 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:08:33,474 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:08:33,475 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:08:33,475 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:08:33,476 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:08:33,478 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:08:33,479 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:08:33,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:08:33,479 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:08:33,480 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:08:33,481 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:08:33,482 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:08:33,483 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:08:33,483 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:08:33,484 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:08:33,486 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:08:33,487 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:08:33,488 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:08:33,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:08:33,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:08:33,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:08:33,490 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:08:33,491 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:08:33,492 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:08:33,492 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:08:33,493 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:08:33,493 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:08:33,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:08:33,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:08:33,494 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:08:33,494 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:08:33,495 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:08:33,495 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:08:33,496 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_342dbda3-2de7-4c41-a652-83c031829932/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 07:08:33,505 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:08:33,505 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:08:33,506 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:08:33,506 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 07:08:33,506 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:08:33,506 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:08:33,507 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:08:33,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:08:33,507 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:08:33,507 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:08:33,507 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:08:33,507 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:08:33,507 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:08:33,507 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:08:33,508 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:08:33,508 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:08:33,508 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:08:33,508 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:08:33,508 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:08:33,508 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:08:33,508 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:08:33,508 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:08:33,509 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 07:08:33,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:08:33,509 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:08:33,509 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:08:33,509 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:08:33,509 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:08:33,509 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:08:33,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:08:33,509 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_342dbda3-2de7-4c41-a652-83c031829932/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2018-11-23 07:08:33,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:08:33,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:08:33,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:08:33,545 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:08:33,545 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:08:33,546 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_342dbda3-2de7-4c41-a652-83c031829932/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 07:08:33,585 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_342dbda3-2de7-4c41-a652-83c031829932/bin-2019/uautomizer/data/a7209a820/7d882c79e7f44b559bcc33c6500c9c3e/FLAGd349b0a52 [2018-11-23 07:08:33,981 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:08:33,981 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_342dbda3-2de7-4c41-a652-83c031829932/sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 07:08:33,985 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_342dbda3-2de7-4c41-a652-83c031829932/bin-2019/uautomizer/data/a7209a820/7d882c79e7f44b559bcc33c6500c9c3e/FLAGd349b0a52 [2018-11-23 07:08:33,994 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_342dbda3-2de7-4c41-a652-83c031829932/bin-2019/uautomizer/data/a7209a820/7d882c79e7f44b559bcc33c6500c9c3e [2018-11-23 07:08:33,996 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:08:33,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:08:33,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:08:33,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:08:34,000 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:08:34,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:08:33" (1/1) ... [2018-11-23 07:08:34,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cfd07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:34, skipping insertion in model container [2018-11-23 07:08:34,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:08:33" (1/1) ... [2018-11-23 07:08:34,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:08:34,024 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:08:34,142 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:08:34,144 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:08:34,161 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:08:34,169 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:08:34,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:34 WrapperNode [2018-11-23 07:08:34,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:08:34,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:08:34,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:08:34,170 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:08:34,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:34" (1/1) ... [2018-11-23 07:08:34,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:34" (1/1) ... [2018-11-23 07:08:34,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:08:34,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:08:34,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:08:34,187 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:08:34,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:34" (1/1) ... [2018-11-23 07:08:34,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:34" (1/1) ... [2018-11-23 07:08:34,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:34" (1/1) ... [2018-11-23 07:08:34,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:34" (1/1) ... [2018-11-23 07:08:34,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:34" (1/1) ... [2018-11-23 07:08:34,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:34" (1/1) ... [2018-11-23 07:08:34,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:34" (1/1) ... [2018-11-23 07:08:34,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:08:34,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:08:34,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:08:34,242 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:08:34,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_342dbda3-2de7-4c41-a652-83c031829932/bin-2019/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 [2018-11-23 07:08:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 07:08:34,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 07:08:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:08:34,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:08:34,283 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 07:08:34,283 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 07:08:34,503 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:08:34,504 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 07:08:34,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:08:34 BoogieIcfgContainer [2018-11-23 07:08:34,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:08:34,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 07:08:34,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 07:08:34,508 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 07:08:34,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:08:33" (1/3) ... [2018-11-23 07:08:34,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f31e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:08:34, skipping insertion in model container [2018-11-23 07:08:34,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:08:34" (2/3) ... [2018-11-23 07:08:34,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f31e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:08:34, skipping insertion in model container [2018-11-23 07:08:34,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:08:34" (3/3) ... [2018-11-23 07:08:34,511 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 07:08:34,520 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 07:08:34,528 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 07:08:34,543 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 07:08:34,569 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:08:34,569 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 07:08:34,569 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 07:08:34,569 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 07:08:34,570 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:08:34,570 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:08:34,570 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 07:08:34,570 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:08:34,570 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 07:08:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-23 07:08:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 07:08:34,589 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:34,589 INFO L402 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] [2018-11-23 07:08:34,591 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:34,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2018-11-23 07:08:34,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:34,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:34,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:34,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:34,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:34,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:34,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:34,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:34,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:34,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:34,749 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2018-11-23 07:08:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:34,788 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2018-11-23 07:08:34,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:34,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 07:08:34,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:34,798 INFO L225 Difference]: With dead ends: 105 [2018-11-23 07:08:34,799 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 07:08:34,801 INFO L631 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 [2018-11-23 07:08:34,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 07:08:34,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2018-11-23 07:08:34,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 07:08:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2018-11-23 07:08:34,832 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2018-11-23 07:08:34,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:34,832 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2018-11-23 07:08:34,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:34,832 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2018-11-23 07:08:34,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 07:08:34,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:34,833 INFO L402 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] [2018-11-23 07:08:34,833 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:34,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:34,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2018-11-23 07:08:34,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:34,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:34,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:34,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:34,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:34,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:34,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:34,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:34,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:34,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:34,881 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2018-11-23 07:08:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:34,912 INFO L93 Difference]: Finished difference Result 147 states and 272 transitions. [2018-11-23 07:08:34,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:34,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 07:08:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:34,913 INFO L225 Difference]: With dead ends: 147 [2018-11-23 07:08:34,913 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 07:08:34,914 INFO L631 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 [2018-11-23 07:08:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 07:08:34,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-23 07:08:34,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 07:08:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2018-11-23 07:08:34,922 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2018-11-23 07:08:34,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:34,922 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2018-11-23 07:08:34,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:34,922 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2018-11-23 07:08:34,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 07:08:34,923 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:34,923 INFO L402 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] [2018-11-23 07:08:34,923 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:34,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:34,924 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2018-11-23 07:08:34,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:34,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:34,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:34,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:34,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:34,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:34,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:34,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:34,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:34,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:34,961 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2018-11-23 07:08:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:34,978 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2018-11-23 07:08:34,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:34,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 07:08:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:34,979 INFO L225 Difference]: With dead ends: 135 [2018-11-23 07:08:34,979 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 07:08:34,980 INFO L631 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 [2018-11-23 07:08:34,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 07:08:34,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-11-23 07:08:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 07:08:34,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2018-11-23 07:08:34,984 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2018-11-23 07:08:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:34,985 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2018-11-23 07:08:34,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2018-11-23 07:08:34,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 07:08:34,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:34,985 INFO L402 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] [2018-11-23 07:08:34,986 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:34,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:34,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2018-11-23 07:08:34,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:34,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:34,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:34,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:34,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:35,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:35,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:35,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:35,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:35,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:35,036 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2018-11-23 07:08:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:35,054 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2018-11-23 07:08:35,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:35,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 07:08:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:35,055 INFO L225 Difference]: With dead ends: 172 [2018-11-23 07:08:35,055 INFO L226 Difference]: Without dead ends: 170 [2018-11-23 07:08:35,056 INFO L631 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 [2018-11-23 07:08:35,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-11-23 07:08:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2018-11-23 07:08:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-23 07:08:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2018-11-23 07:08:35,064 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2018-11-23 07:08:35,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:35,064 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2018-11-23 07:08:35,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2018-11-23 07:08:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 07:08:35,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:35,065 INFO L402 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] [2018-11-23 07:08:35,065 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:35,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:35,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2018-11-23 07:08:35,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:35,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:35,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:35,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:35,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:35,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:35,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:35,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:35,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:35,093 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2018-11-23 07:08:35,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:35,110 INFO L93 Difference]: Finished difference Result 284 states and 518 transitions. [2018-11-23 07:08:35,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:35,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 07:08:35,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:35,112 INFO L225 Difference]: With dead ends: 284 [2018-11-23 07:08:35,112 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 07:08:35,112 INFO L631 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 [2018-11-23 07:08:35,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-23 07:08:35,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-11-23 07:08:35,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-23 07:08:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2018-11-23 07:08:35,122 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2018-11-23 07:08:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:35,122 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2018-11-23 07:08:35,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2018-11-23 07:08:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 07:08:35,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:35,123 INFO L402 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] [2018-11-23 07:08:35,123 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:35,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:35,124 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2018-11-23 07:08:35,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:35,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:35,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:35,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:35,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:35,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:35,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:35,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:35,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:35,167 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2018-11-23 07:08:35,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:35,183 INFO L93 Difference]: Finished difference Result 255 states and 457 transitions. [2018-11-23 07:08:35,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:35,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 07:08:35,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:35,185 INFO L225 Difference]: With dead ends: 255 [2018-11-23 07:08:35,185 INFO L226 Difference]: Without dead ends: 174 [2018-11-23 07:08:35,185 INFO L631 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 [2018-11-23 07:08:35,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-23 07:08:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-11-23 07:08:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-23 07:08:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2018-11-23 07:08:35,191 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2018-11-23 07:08:35,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:35,191 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2018-11-23 07:08:35,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2018-11-23 07:08:35,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 07:08:35,192 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:35,192 INFO L402 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] [2018-11-23 07:08:35,192 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:35,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:35,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2018-11-23 07:08:35,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:35,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:35,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:35,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:35,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:35,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:35,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:35,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:35,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:35,223 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2018-11-23 07:08:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:35,245 INFO L93 Difference]: Finished difference Result 324 states and 584 transitions. [2018-11-23 07:08:35,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:35,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 07:08:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:35,247 INFO L225 Difference]: With dead ends: 324 [2018-11-23 07:08:35,247 INFO L226 Difference]: Without dead ends: 322 [2018-11-23 07:08:35,248 INFO L631 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 [2018-11-23 07:08:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-23 07:08:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2018-11-23 07:08:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-23 07:08:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2018-11-23 07:08:35,257 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2018-11-23 07:08:35,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:35,258 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2018-11-23 07:08:35,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2018-11-23 07:08:35,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 07:08:35,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:35,259 INFO L402 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] [2018-11-23 07:08:35,259 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:35,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:35,259 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2018-11-23 07:08:35,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:35,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:35,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:35,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:35,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:35,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:35,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:35,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:35,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:35,288 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2018-11-23 07:08:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:35,306 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2018-11-23 07:08:35,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:35,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 07:08:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:35,308 INFO L225 Difference]: With dead ends: 552 [2018-11-23 07:08:35,308 INFO L226 Difference]: Without dead ends: 330 [2018-11-23 07:08:35,309 INFO L631 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 [2018-11-23 07:08:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-23 07:08:35,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2018-11-23 07:08:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-23 07:08:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2018-11-23 07:08:35,319 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2018-11-23 07:08:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:35,319 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2018-11-23 07:08:35,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2018-11-23 07:08:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 07:08:35,320 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:35,320 INFO L402 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] [2018-11-23 07:08:35,320 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:35,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:35,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2018-11-23 07:08:35,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:35,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:35,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:35,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:35,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:35,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:35,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:35,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:35,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:35,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:35,352 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2018-11-23 07:08:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:35,370 INFO L93 Difference]: Finished difference Result 492 states and 864 transitions. [2018-11-23 07:08:35,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:35,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 07:08:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:35,372 INFO L225 Difference]: With dead ends: 492 [2018-11-23 07:08:35,372 INFO L226 Difference]: Without dead ends: 334 [2018-11-23 07:08:35,373 INFO L631 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 [2018-11-23 07:08:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-11-23 07:08:35,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2018-11-23 07:08:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-11-23 07:08:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2018-11-23 07:08:35,383 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2018-11-23 07:08:35,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:35,384 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2018-11-23 07:08:35,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:35,384 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2018-11-23 07:08:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 07:08:35,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:35,385 INFO L402 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] [2018-11-23 07:08:35,385 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:35,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:35,385 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2018-11-23 07:08:35,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:35,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:35,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:35,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:35,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:35,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:35,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:35,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:35,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:35,403 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2018-11-23 07:08:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:35,428 INFO L93 Difference]: Finished difference Result 620 states and 1096 transitions. [2018-11-23 07:08:35,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:35,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 07:08:35,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:35,431 INFO L225 Difference]: With dead ends: 620 [2018-11-23 07:08:35,431 INFO L226 Difference]: Without dead ends: 618 [2018-11-23 07:08:35,431 INFO L631 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 [2018-11-23 07:08:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-11-23 07:08:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2018-11-23 07:08:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-23 07:08:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2018-11-23 07:08:35,450 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2018-11-23 07:08:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:35,450 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2018-11-23 07:08:35,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:35,450 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2018-11-23 07:08:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 07:08:35,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:35,451 INFO L402 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] [2018-11-23 07:08:35,452 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:35,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:35,452 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2018-11-23 07:08:35,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:35,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:35,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:35,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:35,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:35,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:35,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:35,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:35,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:35,480 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2018-11-23 07:08:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:35,530 INFO L93 Difference]: Finished difference Result 1084 states and 1872 transitions. [2018-11-23 07:08:35,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:35,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 07:08:35,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:35,532 INFO L225 Difference]: With dead ends: 1084 [2018-11-23 07:08:35,533 INFO L226 Difference]: Without dead ends: 642 [2018-11-23 07:08:35,534 INFO L631 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 [2018-11-23 07:08:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-11-23 07:08:35,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2018-11-23 07:08:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-11-23 07:08:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2018-11-23 07:08:35,553 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2018-11-23 07:08:35,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:35,554 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2018-11-23 07:08:35,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2018-11-23 07:08:35,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 07:08:35,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:35,555 INFO L402 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] [2018-11-23 07:08:35,555 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:35,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:35,556 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2018-11-23 07:08:35,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:35,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:35,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:35,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:35,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:35,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:35,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:35,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:35,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:35,580 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2018-11-23 07:08:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:35,605 INFO L93 Difference]: Finished difference Result 960 states and 1636 transitions. [2018-11-23 07:08:35,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:35,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 07:08:35,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:35,608 INFO L225 Difference]: With dead ends: 960 [2018-11-23 07:08:35,608 INFO L226 Difference]: Without dead ends: 650 [2018-11-23 07:08:35,609 INFO L631 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 [2018-11-23 07:08:35,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-11-23 07:08:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2018-11-23 07:08:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-11-23 07:08:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2018-11-23 07:08:35,628 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2018-11-23 07:08:35,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:35,629 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2018-11-23 07:08:35,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2018-11-23 07:08:35,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 07:08:35,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:35,630 INFO L402 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] [2018-11-23 07:08:35,630 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:35,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:35,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2018-11-23 07:08:35,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:35,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:35,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:35,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:35,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:35,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:35,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:35,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:35,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:35,652 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2018-11-23 07:08:35,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:35,677 INFO L93 Difference]: Finished difference Result 1196 states and 2056 transitions. [2018-11-23 07:08:35,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:35,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 07:08:35,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:35,682 INFO L225 Difference]: With dead ends: 1196 [2018-11-23 07:08:35,682 INFO L226 Difference]: Without dead ends: 1194 [2018-11-23 07:08:35,683 INFO L631 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 [2018-11-23 07:08:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2018-11-23 07:08:35,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2018-11-23 07:08:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-11-23 07:08:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2018-11-23 07:08:35,710 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2018-11-23 07:08:35,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:35,710 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2018-11-23 07:08:35,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:35,710 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2018-11-23 07:08:35,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 07:08:35,712 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:35,712 INFO L402 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] [2018-11-23 07:08:35,712 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:35,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:35,713 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2018-11-23 07:08:35,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:35,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:35,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:35,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:35,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:35,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:35,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:35,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:35,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:35,736 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2018-11-23 07:08:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:35,770 INFO L93 Difference]: Finished difference Result 2140 states and 3560 transitions. [2018-11-23 07:08:35,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:35,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 07:08:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:35,774 INFO L225 Difference]: With dead ends: 2140 [2018-11-23 07:08:35,775 INFO L226 Difference]: Without dead ends: 1258 [2018-11-23 07:08:35,777 INFO L631 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 [2018-11-23 07:08:35,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2018-11-23 07:08:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2018-11-23 07:08:35,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2018-11-23 07:08:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2018-11-23 07:08:35,815 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2018-11-23 07:08:35,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:35,816 INFO L480 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2018-11-23 07:08:35,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2018-11-23 07:08:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 07:08:35,818 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:35,818 INFO L402 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] [2018-11-23 07:08:35,818 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:35,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:35,818 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2018-11-23 07:08:35,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:35,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:35,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:35,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:35,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:35,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:35,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:35,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:35,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:35,847 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2018-11-23 07:08:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:35,879 INFO L93 Difference]: Finished difference Result 1884 states and 3096 transitions. [2018-11-23 07:08:35,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:35,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 07:08:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:35,883 INFO L225 Difference]: With dead ends: 1884 [2018-11-23 07:08:35,883 INFO L226 Difference]: Without dead ends: 1274 [2018-11-23 07:08:35,884 INFO L631 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 [2018-11-23 07:08:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2018-11-23 07:08:35,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2018-11-23 07:08:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-11-23 07:08:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2018-11-23 07:08:35,919 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2018-11-23 07:08:35,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:35,920 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2018-11-23 07:08:35,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2018-11-23 07:08:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 07:08:35,921 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:35,921 INFO L402 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] [2018-11-23 07:08:35,922 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:35,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2018-11-23 07:08:35,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:35,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:35,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:35,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:35,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:35,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:35,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:35,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:35,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:35,943 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2018-11-23 07:08:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:35,977 INFO L93 Difference]: Finished difference Result 2316 states and 3848 transitions. [2018-11-23 07:08:35,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:35,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 07:08:35,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:35,984 INFO L225 Difference]: With dead ends: 2316 [2018-11-23 07:08:35,984 INFO L226 Difference]: Without dead ends: 2314 [2018-11-23 07:08:35,985 INFO L631 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 [2018-11-23 07:08:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-11-23 07:08:36,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2018-11-23 07:08:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2018-11-23 07:08:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2018-11-23 07:08:36,032 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2018-11-23 07:08:36,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:36,033 INFO L480 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2018-11-23 07:08:36,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:36,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2018-11-23 07:08:36,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 07:08:36,035 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:36,035 INFO L402 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] [2018-11-23 07:08:36,036 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:36,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:36,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2018-11-23 07:08:36,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:36,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:36,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:36,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:36,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:36,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:36,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:36,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:36,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:36,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:36,056 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2018-11-23 07:08:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:36,112 INFO L93 Difference]: Finished difference Result 4236 states and 6760 transitions. [2018-11-23 07:08:36,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:36,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 07:08:36,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:36,120 INFO L225 Difference]: With dead ends: 4236 [2018-11-23 07:08:36,120 INFO L226 Difference]: Without dead ends: 2474 [2018-11-23 07:08:36,123 INFO L631 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 [2018-11-23 07:08:36,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2018-11-23 07:08:36,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2018-11-23 07:08:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2018-11-23 07:08:36,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2018-11-23 07:08:36,191 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2018-11-23 07:08:36,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:36,192 INFO L480 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2018-11-23 07:08:36,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2018-11-23 07:08:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 07:08:36,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:36,194 INFO L402 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] [2018-11-23 07:08:36,194 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:36,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:36,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2018-11-23 07:08:36,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:36,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:36,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:36,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:36,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:36,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:36,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:36,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:36,216 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2018-11-23 07:08:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:36,242 INFO L93 Difference]: Finished difference Result 3708 states and 5848 transitions. [2018-11-23 07:08:36,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:36,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 07:08:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:36,246 INFO L225 Difference]: With dead ends: 3708 [2018-11-23 07:08:36,247 INFO L226 Difference]: Without dead ends: 2506 [2018-11-23 07:08:36,248 INFO L631 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 [2018-11-23 07:08:36,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-11-23 07:08:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2018-11-23 07:08:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2018-11-23 07:08:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2018-11-23 07:08:36,282 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2018-11-23 07:08:36,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:36,282 INFO L480 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2018-11-23 07:08:36,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:36,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2018-11-23 07:08:36,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 07:08:36,284 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:36,284 INFO L402 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] [2018-11-23 07:08:36,284 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:36,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:36,284 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2018-11-23 07:08:36,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:36,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:36,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:36,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:36,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:36,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:36,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:36,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:36,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:36,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:36,307 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2018-11-23 07:08:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:36,345 INFO L93 Difference]: Finished difference Result 4492 states and 7176 transitions. [2018-11-23 07:08:36,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:36,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 07:08:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:36,352 INFO L225 Difference]: With dead ends: 4492 [2018-11-23 07:08:36,352 INFO L226 Difference]: Without dead ends: 4490 [2018-11-23 07:08:36,353 INFO L631 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 [2018-11-23 07:08:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-11-23 07:08:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2018-11-23 07:08:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2018-11-23 07:08:36,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2018-11-23 07:08:36,402 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2018-11-23 07:08:36,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:36,402 INFO L480 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2018-11-23 07:08:36,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2018-11-23 07:08:36,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 07:08:36,405 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:36,405 INFO L402 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] [2018-11-23 07:08:36,405 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:36,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:36,406 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2018-11-23 07:08:36,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:36,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:36,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:36,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:36,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:36,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:36,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:36,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:36,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:36,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:36,427 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2018-11-23 07:08:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:36,478 INFO L93 Difference]: Finished difference Result 8396 states and 12808 transitions. [2018-11-23 07:08:36,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:36,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 07:08:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:36,488 INFO L225 Difference]: With dead ends: 8396 [2018-11-23 07:08:36,488 INFO L226 Difference]: Without dead ends: 4874 [2018-11-23 07:08:36,493 INFO L631 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 [2018-11-23 07:08:36,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-11-23 07:08:36,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2018-11-23 07:08:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2018-11-23 07:08:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2018-11-23 07:08:36,563 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2018-11-23 07:08:36,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:36,563 INFO L480 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2018-11-23 07:08:36,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:36,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2018-11-23 07:08:36,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 07:08:36,566 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:36,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:36,566 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:36,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:36,567 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2018-11-23 07:08:36,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:36,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:36,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:36,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:36,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:36,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:36,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:36,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:36,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:36,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:36,583 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2018-11-23 07:08:36,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:36,636 INFO L93 Difference]: Finished difference Result 7308 states and 11016 transitions. [2018-11-23 07:08:36,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:36,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 07:08:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:36,645 INFO L225 Difference]: With dead ends: 7308 [2018-11-23 07:08:36,645 INFO L226 Difference]: Without dead ends: 4938 [2018-11-23 07:08:36,648 INFO L631 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 [2018-11-23 07:08:36,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2018-11-23 07:08:36,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2018-11-23 07:08:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2018-11-23 07:08:36,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2018-11-23 07:08:36,719 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2018-11-23 07:08:36,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:36,719 INFO L480 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2018-11-23 07:08:36,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2018-11-23 07:08:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 07:08:36,722 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:36,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:36,722 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:36,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:36,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2018-11-23 07:08:36,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:36,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:36,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:36,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:36,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:36,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:36,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:36,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:36,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:36,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:36,739 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2018-11-23 07:08:36,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:36,837 INFO L93 Difference]: Finished difference Result 14412 states and 21320 transitions. [2018-11-23 07:08:36,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:36,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 07:08:36,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:36,850 INFO L225 Difference]: With dead ends: 14412 [2018-11-23 07:08:36,850 INFO L226 Difference]: Without dead ends: 9610 [2018-11-23 07:08:36,857 INFO L631 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 [2018-11-23 07:08:36,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2018-11-23 07:08:37,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2018-11-23 07:08:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-11-23 07:08:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2018-11-23 07:08:37,022 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2018-11-23 07:08:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:37,022 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2018-11-23 07:08:37,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2018-11-23 07:08:37,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 07:08:37,027 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:37,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:37,027 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:37,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:37,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2018-11-23 07:08:37,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:37,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:37,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:37,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:37,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:37,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:37,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:37,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:37,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:37,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:37,051 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2018-11-23 07:08:37,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:37,235 INFO L93 Difference]: Finished difference Result 11148 states and 16776 transitions. [2018-11-23 07:08:37,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:37,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 07:08:37,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:37,250 INFO L225 Difference]: With dead ends: 11148 [2018-11-23 07:08:37,251 INFO L226 Difference]: Without dead ends: 11146 [2018-11-23 07:08:37,254 INFO L631 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 [2018-11-23 07:08:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-11-23 07:08:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2018-11-23 07:08:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-11-23 07:08:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2018-11-23 07:08:37,463 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2018-11-23 07:08:37,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:37,463 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2018-11-23 07:08:37,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2018-11-23 07:08:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 07:08:37,471 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:37,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:37,471 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:37,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:37,472 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2018-11-23 07:08:37,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:37,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:37,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:37,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:37,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:37,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:37,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:37,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:37,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:37,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:37,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:37,496 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2018-11-23 07:08:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:37,709 INFO L93 Difference]: Finished difference Result 16780 states and 24712 transitions. [2018-11-23 07:08:37,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:37,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 07:08:37,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:37,735 INFO L225 Difference]: With dead ends: 16780 [2018-11-23 07:08:37,736 INFO L226 Difference]: Without dead ends: 16778 [2018-11-23 07:08:37,741 INFO L631 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 [2018-11-23 07:08:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2018-11-23 07:08:37,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2018-11-23 07:08:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-11-23 07:08:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2018-11-23 07:08:38,031 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2018-11-23 07:08:38,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:38,031 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2018-11-23 07:08:38,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2018-11-23 07:08:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 07:08:38,048 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:38,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:38,048 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:38,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:38,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2018-11-23 07:08:38,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:38,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:38,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:38,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:38,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:38,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:38,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:38,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:38,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:38,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:38,065 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2018-11-23 07:08:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:38,347 INFO L93 Difference]: Finished difference Result 32908 states and 46216 transitions. [2018-11-23 07:08:38,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:38,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 07:08:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:38,374 INFO L225 Difference]: With dead ends: 32908 [2018-11-23 07:08:38,374 INFO L226 Difference]: Without dead ends: 18826 [2018-11-23 07:08:38,390 INFO L631 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 [2018-11-23 07:08:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2018-11-23 07:08:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2018-11-23 07:08:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2018-11-23 07:08:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2018-11-23 07:08:38,664 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2018-11-23 07:08:38,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:38,664 INFO L480 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2018-11-23 07:08:38,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2018-11-23 07:08:38,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 07:08:38,679 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:38,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:38,680 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:38,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:38,680 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2018-11-23 07:08:38,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:38,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:38,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:38,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:38,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:38,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:38,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:38,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:38,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:38,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:38,717 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2018-11-23 07:08:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:38,888 INFO L93 Difference]: Finished difference Result 28428 states and 39432 transitions. [2018-11-23 07:08:38,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:38,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 07:08:38,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:38,902 INFO L225 Difference]: With dead ends: 28428 [2018-11-23 07:08:38,902 INFO L226 Difference]: Without dead ends: 19210 [2018-11-23 07:08:38,910 INFO L631 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 [2018-11-23 07:08:38,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2018-11-23 07:08:39,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2018-11-23 07:08:39,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2018-11-23 07:08:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2018-11-23 07:08:39,162 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2018-11-23 07:08:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:39,162 INFO L480 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2018-11-23 07:08:39,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2018-11-23 07:08:39,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 07:08:39,174 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:39,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:39,174 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:39,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:39,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2018-11-23 07:08:39,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:39,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:39,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:39,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:39,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:39,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:39,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:39,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:39,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:39,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:39,188 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2018-11-23 07:08:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:39,420 INFO L93 Difference]: Finished difference Result 32780 states and 45832 transitions. [2018-11-23 07:08:39,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:39,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 07:08:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:39,449 INFO L225 Difference]: With dead ends: 32780 [2018-11-23 07:08:39,449 INFO L226 Difference]: Without dead ends: 32778 [2018-11-23 07:08:39,459 INFO L631 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 [2018-11-23 07:08:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2018-11-23 07:08:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2018-11-23 07:08:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2018-11-23 07:08:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2018-11-23 07:08:39,826 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2018-11-23 07:08:39,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:39,826 INFO L480 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2018-11-23 07:08:39,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:39,826 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2018-11-23 07:08:39,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 07:08:39,845 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:39,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:39,846 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:39,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:39,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2018-11-23 07:08:39,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:39,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:39,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:39,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:39,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:39,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:39,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:39,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:39,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:39,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:39,918 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2018-11-23 07:08:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:40,236 INFO L93 Difference]: Finished difference Result 65548 states and 87304 transitions. [2018-11-23 07:08:40,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:40,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 07:08:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:40,263 INFO L225 Difference]: With dead ends: 65548 [2018-11-23 07:08:40,263 INFO L226 Difference]: Without dead ends: 37386 [2018-11-23 07:08:40,288 INFO L631 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 [2018-11-23 07:08:40,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2018-11-23 07:08:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2018-11-23 07:08:40,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2018-11-23 07:08:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2018-11-23 07:08:40,758 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2018-11-23 07:08:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:40,759 INFO L480 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2018-11-23 07:08:40,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2018-11-23 07:08:40,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 07:08:40,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:40,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:40,833 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:40,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:40,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2018-11-23 07:08:40,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:40,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:40,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:40,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:40,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:40,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:40,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:40,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:40,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:40,844 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2018-11-23 07:08:41,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:41,132 INFO L93 Difference]: Finished difference Result 56076 states and 73480 transitions. [2018-11-23 07:08:41,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:41,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 07:08:41,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:41,160 INFO L225 Difference]: With dead ends: 56076 [2018-11-23 07:08:41,161 INFO L226 Difference]: Without dead ends: 37898 [2018-11-23 07:08:41,175 INFO L631 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 [2018-11-23 07:08:41,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2018-11-23 07:08:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2018-11-23 07:08:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2018-11-23 07:08:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2018-11-23 07:08:41,626 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2018-11-23 07:08:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:41,626 INFO L480 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2018-11-23 07:08:41,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:41,627 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2018-11-23 07:08:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 07:08:41,639 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:41,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:41,640 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:41,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:41,640 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2018-11-23 07:08:41,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:41,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:41,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:41,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:41,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:41,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:41,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:41,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:41,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:41,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:41,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:41,663 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2018-11-23 07:08:42,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:42,309 INFO L93 Difference]: Finished difference Result 63500 states and 83464 transitions. [2018-11-23 07:08:42,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:42,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 07:08:42,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:42,343 INFO L225 Difference]: With dead ends: 63500 [2018-11-23 07:08:42,343 INFO L226 Difference]: Without dead ends: 63498 [2018-11-23 07:08:42,349 INFO L631 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 [2018-11-23 07:08:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2018-11-23 07:08:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2018-11-23 07:08:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2018-11-23 07:08:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2018-11-23 07:08:42,964 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2018-11-23 07:08:42,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:42,964 INFO L480 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2018-11-23 07:08:42,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:42,964 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2018-11-23 07:08:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 07:08:42,994 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:42,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:42,994 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:42,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:42,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2018-11-23 07:08:42,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:42,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:42,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:42,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:42,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:43,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:43,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:43,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:43,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:43,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:43,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:43,011 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2018-11-23 07:08:43,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:43,742 INFO L93 Difference]: Finished difference Result 130060 states and 163336 transitions. [2018-11-23 07:08:43,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:43,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 07:08:43,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:43,788 INFO L225 Difference]: With dead ends: 130060 [2018-11-23 07:08:43,788 INFO L226 Difference]: Without dead ends: 73738 [2018-11-23 07:08:43,819 INFO L631 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 [2018-11-23 07:08:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2018-11-23 07:08:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2018-11-23 07:08:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2018-11-23 07:08:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2018-11-23 07:08:44,736 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2018-11-23 07:08:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:44,736 INFO L480 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2018-11-23 07:08:44,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2018-11-23 07:08:44,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 07:08:44,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:44,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:44,767 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:44,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:44,767 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2018-11-23 07:08:44,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:44,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:44,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:44,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:44,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:44,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:44,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:44,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:44,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:44,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:44,810 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2018-11-23 07:08:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:45,614 INFO L93 Difference]: Finished difference Result 110604 states and 136200 transitions. [2018-11-23 07:08:45,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:45,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 07:08:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:45,663 INFO L225 Difference]: With dead ends: 110604 [2018-11-23 07:08:45,664 INFO L226 Difference]: Without dead ends: 74762 [2018-11-23 07:08:45,687 INFO L631 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 [2018-11-23 07:08:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2018-11-23 07:08:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2018-11-23 07:08:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2018-11-23 07:08:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2018-11-23 07:08:46,609 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2018-11-23 07:08:46,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:46,609 INFO L480 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2018-11-23 07:08:46,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:46,609 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2018-11-23 07:08:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 07:08:46,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:46,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:46,631 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:46,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:46,632 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2018-11-23 07:08:46,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:46,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:46,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:46,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:46,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:46,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:46,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:46,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:46,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:46,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:46,656 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2018-11-23 07:08:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:47,777 INFO L93 Difference]: Finished difference Result 122892 states and 150536 transitions. [2018-11-23 07:08:47,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:47,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 07:08:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:47,863 INFO L225 Difference]: With dead ends: 122892 [2018-11-23 07:08:47,863 INFO L226 Difference]: Without dead ends: 122890 [2018-11-23 07:08:47,879 INFO L631 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 [2018-11-23 07:08:47,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2018-11-23 07:08:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2018-11-23 07:08:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2018-11-23 07:08:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2018-11-23 07:08:49,374 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2018-11-23 07:08:49,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:49,374 INFO L480 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2018-11-23 07:08:49,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:49,374 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2018-11-23 07:08:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 07:08:49,422 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:49,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:49,423 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:49,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:49,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2018-11-23 07:08:49,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:49,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:49,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:49,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:49,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:49,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:49,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:49,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:49,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:49,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:49,453 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2018-11-23 07:08:50,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:50,780 INFO L93 Difference]: Finished difference Result 258060 states and 304136 transitions. [2018-11-23 07:08:50,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:50,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 07:08:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:50,891 INFO L225 Difference]: With dead ends: 258060 [2018-11-23 07:08:50,891 INFO L226 Difference]: Without dead ends: 145418 [2018-11-23 07:08:50,955 INFO L631 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 [2018-11-23 07:08:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2018-11-23 07:08:53,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2018-11-23 07:08:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2018-11-23 07:08:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2018-11-23 07:08:53,155 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2018-11-23 07:08:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:53,155 INFO L480 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2018-11-23 07:08:53,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2018-11-23 07:08:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 07:08:53,207 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:53,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:53,207 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:53,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:53,207 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2018-11-23 07:08:53,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:53,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:53,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:53,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:53,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:53,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:53,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:53,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:53,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:53,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:53,233 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2018-11-23 07:08:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:54,637 INFO L93 Difference]: Finished difference Result 218124 states and 250888 transitions. [2018-11-23 07:08:54,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:54,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 07:08:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:54,771 INFO L225 Difference]: With dead ends: 218124 [2018-11-23 07:08:54,772 INFO L226 Difference]: Without dead ends: 147466 [2018-11-23 07:08:54,836 INFO L631 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 [2018-11-23 07:08:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2018-11-23 07:08:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 147464. [2018-11-23 07:08:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147464 states. [2018-11-23 07:08:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147464 states to 147464 states and 167942 transitions. [2018-11-23 07:08:57,140 INFO L78 Accepts]: Start accepts. Automaton has 147464 states and 167942 transitions. Word has length 35 [2018-11-23 07:08:57,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:08:57,140 INFO L480 AbstractCegarLoop]: Abstraction has 147464 states and 167942 transitions. [2018-11-23 07:08:57,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:08:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 147464 states and 167942 transitions. [2018-11-23 07:08:57,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 07:08:57,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:08:57,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:08:57,197 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:08:57,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:08:57,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1504278924, now seen corresponding path program 1 times [2018-11-23 07:08:57,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:08:57,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:08:57,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:57,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:08:57,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:08:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:08:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:08:57,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:08:57,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:08:57,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:08:57,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:08:57,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:08:57,224 INFO L87 Difference]: Start difference. First operand 147464 states and 167942 transitions. Second operand 3 states. [2018-11-23 07:08:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:08:59,610 INFO L93 Difference]: Finished difference Result 237578 states and 268295 transitions. [2018-11-23 07:08:59,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:08:59,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 07:08:59,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:08:59,791 INFO L225 Difference]: With dead ends: 237578 [2018-11-23 07:08:59,791 INFO L226 Difference]: Without dead ends: 237576 [2018-11-23 07:08:59,814 INFO L631 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 [2018-11-23 07:08:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237576 states. [2018-11-23 07:09:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237576 to 229384. [2018-11-23 07:09:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229384 states. [2018-11-23 07:09:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229384 states to 229384 states and 256006 transitions. [2018-11-23 07:09:05,423 INFO L78 Accepts]: Start accepts. Automaton has 229384 states and 256006 transitions. Word has length 35 [2018-11-23 07:09:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:09:05,423 INFO L480 AbstractCegarLoop]: Abstraction has 229384 states and 256006 transitions. [2018-11-23 07:09:05,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:09:05,424 INFO L276 IsEmpty]: Start isEmpty. Operand 229384 states and 256006 transitions. [2018-11-23 07:09:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 07:09:05,527 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:09:05,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:09:05,527 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:09:05,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:09:05,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1769620018, now seen corresponding path program 1 times [2018-11-23 07:09:05,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:09:05,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:09:05,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:09:05,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:09:05,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:09:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:09:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:09:05,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:09:05,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:09:05,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:09:05,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:09:05,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:09:05,540 INFO L87 Difference]: Start difference. First operand 229384 states and 256006 transitions. Second operand 3 states. [2018-11-23 07:09:08,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:09:08,266 INFO L93 Difference]: Finished difference Result 512008 states and 563206 transitions. [2018-11-23 07:09:08,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:09:08,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 07:09:08,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:09:08,266 INFO L225 Difference]: With dead ends: 512008 [2018-11-23 07:09:08,266 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 07:09:08,472 INFO L631 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 [2018-11-23 07:09:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 07:09:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 07:09:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 07:09:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 07:09:08,472 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-11-23 07:09:08,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:09:08,472 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 07:09:08,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:09:08,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 07:09:08,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 07:09:08,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 07:09:08,533 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 07:09:08,534 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 07:09:08,534 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 07:09:08,534 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 07:09:08,534 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 07:09:08,534 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 07:09:08,534 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2018-11-23 07:09:08,534 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-23 07:09:08,534 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,534 INFO L451 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2018-11-23 07:09:08,534 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,534 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,534 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-23 07:09:08,535 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-23 07:09:08,535 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2018-11-23 07:09:08,535 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,535 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2018-11-23 07:09:08,535 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,535 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-23 07:09:08,535 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,535 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,535 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,535 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-23 07:09:08,535 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,535 INFO L448 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,535 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-23 07:09:08,536 INFO L448 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2018-11-23 07:09:08,536 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,536 INFO L448 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,536 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,536 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,536 INFO L448 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-11-23 07:09:08,536 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,536 INFO L448 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2018-11-23 07:09:08,536 INFO L448 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,536 INFO L451 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2018-11-23 07:09:08,536 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,536 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2018-11-23 07:09:08,536 INFO L448 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2018-11-23 07:09:08,536 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,537 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-23 07:09:08,537 INFO L444 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2018-11-23 07:09:08,537 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,537 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,537 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2018-11-23 07:09:08,537 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,537 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-23 07:09:08,537 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,537 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2018-11-23 07:09:08,545 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-23 07:09:08,545 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,545 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,546 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2018-11-23 07:09:08,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:09:08 BoogieIcfgContainer [2018-11-23 07:09:08,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 07:09:08,550 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:09:08,551 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:09:08,551 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:09:08,551 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:08:34" (3/4) ... [2018-11-23 07:09:08,554 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 07:09:08,559 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 07:09:08,559 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 07:09:08,563 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 07:09:08,564 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 07:09:08,564 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 07:09:08,608 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_342dbda3-2de7-4c41-a652-83c031829932/bin-2019/uautomizer/witness.graphml [2018-11-23 07:09:08,608 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:09:08,609 INFO L168 Benchmark]: Toolchain (without parser) took 34613.10 ms. Allocated memory was 1.0 GB in the beginning and 5.9 GB in the end (delta: 4.9 GB). Free memory was 959.1 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-11-23 07:09:08,610 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:09:08,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.37 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:09:08,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.56 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:09:08,611 INFO L168 Benchmark]: Boogie Preprocessor took 54.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -216.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:09:08,611 INFO L168 Benchmark]: RCFGBuilder took 262.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-23 07:09:08,611 INFO L168 Benchmark]: TraceAbstraction took 34045.37 ms. Allocated memory was 1.2 GB in the beginning and 5.9 GB in the end (delta: 4.7 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-11-23 07:09:08,611 INFO L168 Benchmark]: Witness Printer took 57.97 ms. Allocated memory is still 5.9 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 11.5 GB. [2018-11-23 07:09:08,613 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 172.37 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.56 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -216.7 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 262.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34045.37 ms. Allocated memory was 1.2 GB in the beginning and 5.9 GB in the end (delta: 4.7 GB). Free memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 57.97 ms. Allocated memory is still 5.9 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 1 error locations. SAFE Result, 33.9s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 15.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4001 SDtfs, 1984 SDslu, 2752 SDs, 0 SdLazy, 197 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229384occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 17.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 32808 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 8202 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1077 NumberOfCodeBlocks, 1077 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 61562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...