./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_8_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_01060159-3c0b-4b9c-8ae5-f60a75a3a830/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_01060159-3c0b-4b9c-8ae5-f60a75a3a830/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_01060159-3c0b-4b9c-8ae5-f60a75a3a830/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_01060159-3c0b-4b9c-8ae5-f60a75a3a830/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_01060159-3c0b-4b9c-8ae5-f60a75a3a830/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_01060159-3c0b-4b9c-8ae5-f60a75a3a830/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 f2cbbf56a13532141372a32a461d64a9d1351c0e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:09:09,602 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:09:09,603 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:09:09,610 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:09:09,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:09:09,611 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:09:09,612 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:09:09,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:09:09,614 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:09:09,614 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:09:09,615 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:09:09,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:09:09,616 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:09:09,617 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:09:09,617 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:09:09,618 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:09:09,618 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:09:09,620 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:09:09,621 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:09:09,622 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:09:09,623 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:09:09,623 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:09:09,625 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:09:09,625 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:09:09,625 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:09:09,626 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:09:09,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:09:09,627 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:09:09,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:09:09,629 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:09:09,629 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:09:09,629 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:09:09,629 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:09:09,629 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:09:09,630 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:09:09,631 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:09:09,631 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_01060159-3c0b-4b9c-8ae5-f60a75a3a830/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 03:09:09,641 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:09:09,641 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:09:09,642 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:09:09,642 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:09:09,642 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:09:09,642 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:09:09,642 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:09:09,643 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:09:09,643 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:09:09,643 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:09:09,643 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:09:09,643 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:09:09,643 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:09:09,643 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:09:09,643 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:09:09,644 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:09:09,644 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:09:09,644 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:09:09,644 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:09:09,644 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:09:09,644 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:09:09,644 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:09:09,645 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:09:09,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:09:09,645 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:09:09,645 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:09:09,645 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:09:09,645 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:09:09,645 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:09:09,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:09:09,645 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_01060159-3c0b-4b9c-8ae5-f60a75a3a830/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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2018-11-23 03:09:09,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:09:09,674 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:09:09,676 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:09:09,677 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:09:09,677 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:09:09,677 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_01060159-3c0b-4b9c-8ae5-f60a75a3a830/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 03:09:09,712 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_01060159-3c0b-4b9c-8ae5-f60a75a3a830/bin-2019/uautomizer/data/c66d059ff/eb2f27eba2ff445a88788655a4dd9e8f/FLAG9e1a0089f [2018-11-23 03:09:10,112 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:09:10,113 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_01060159-3c0b-4b9c-8ae5-f60a75a3a830/sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 03:09:10,118 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_01060159-3c0b-4b9c-8ae5-f60a75a3a830/bin-2019/uautomizer/data/c66d059ff/eb2f27eba2ff445a88788655a4dd9e8f/FLAG9e1a0089f [2018-11-23 03:09:10,126 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_01060159-3c0b-4b9c-8ae5-f60a75a3a830/bin-2019/uautomizer/data/c66d059ff/eb2f27eba2ff445a88788655a4dd9e8f [2018-11-23 03:09:10,128 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:09:10,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:09:10,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:09:10,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:09:10,133 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:09:10,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:09:10" (1/1) ... [2018-11-23 03:09:10,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e234a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:10, skipping insertion in model container [2018-11-23 03:09:10,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:09:10" (1/1) ... [2018-11-23 03:09:10,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:09:10,161 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:09:10,282 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:09:10,284 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:09:10,300 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:09:10,310 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:09:10,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:10 WrapperNode [2018-11-23 03:09:10,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:09:10,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:09:10,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:09:10,311 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:09:10,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:10" (1/1) ... [2018-11-23 03:09:10,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:10" (1/1) ... [2018-11-23 03:09:10,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:09:10,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:09:10,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:09:10,325 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:09:10,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:10" (1/1) ... [2018-11-23 03:09:10,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:10" (1/1) ... [2018-11-23 03:09:10,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:10" (1/1) ... [2018-11-23 03:09:10,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:10" (1/1) ... [2018-11-23 03:09:10,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:10" (1/1) ... [2018-11-23 03:09:10,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:10" (1/1) ... [2018-11-23 03:09:10,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:10" (1/1) ... [2018-11-23 03:09:10,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:09:10,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:09:10,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:09:10,373 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:09:10,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01060159-3c0b-4b9c-8ae5-f60a75a3a830/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 03:09:10,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:09:10,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:09:10,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:09:10,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:09:10,405 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:09:10,405 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:09:10,562 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:09:10,562 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 03:09:10,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:09:10 BoogieIcfgContainer [2018-11-23 03:09:10,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:09:10,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:09:10,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:09:10,566 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:09:10,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:09:10" (1/3) ... [2018-11-23 03:09:10,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6131e4c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:09:10, skipping insertion in model container [2018-11-23 03:09:10,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:09:10" (2/3) ... [2018-11-23 03:09:10,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6131e4c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:09:10, skipping insertion in model container [2018-11-23 03:09:10,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:09:10" (3/3) ... [2018-11-23 03:09:10,568 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 03:09:10,574 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:09:10,579 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:09:10,588 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:09:10,604 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:09:10,606 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:09:10,606 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:09:10,606 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:09:10,606 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:09:10,606 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:09:10,606 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:09:10,606 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:09:10,606 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:09:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-23 03:09:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 03:09:10,620 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:10,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:09:10,622 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:10,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:10,626 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2018-11-23 03:09:10,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:10,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:10,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:10,736 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 03:09:10,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:10,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:10,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:10,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:10,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:10,750 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-11-23 03:09:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:10,802 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2018-11-23 03:09:10,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:10,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 03:09:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:10,813 INFO L225 Difference]: With dead ends: 75 [2018-11-23 03:09:10,813 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 03:09:10,815 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 03:09:10,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 03:09:10,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2018-11-23 03:09:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 03:09:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2018-11-23 03:09:10,847 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2018-11-23 03:09:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:10,848 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2018-11-23 03:09:10,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2018-11-23 03:09:10,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 03:09:10,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:10,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:09:10,849 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:10,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:10,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2018-11-23 03:09:10,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:10,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:10,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:10,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:10,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:10,895 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 03:09:10,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:10,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:10,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:10,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:10,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:10,897 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2018-11-23 03:09:10,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:10,926 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2018-11-23 03:09:10,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:10,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 03:09:10,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:10,927 INFO L225 Difference]: With dead ends: 97 [2018-11-23 03:09:10,928 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 03:09:10,928 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 03:09:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 03:09:10,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-23 03:09:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 03:09:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2018-11-23 03:09:10,933 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2018-11-23 03:09:10,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:10,933 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2018-11-23 03:09:10,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:10,933 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2018-11-23 03:09:10,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 03:09:10,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:10,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:09:10,934 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:10,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:10,934 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2018-11-23 03:09:10,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:10,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:10,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:10,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:10,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:10,977 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 03:09:10,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:10,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:10,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:10,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:10,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:10,979 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2018-11-23 03:09:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:11,007 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2018-11-23 03:09:11,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:11,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 03:09:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:11,008 INFO L225 Difference]: With dead ends: 90 [2018-11-23 03:09:11,008 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 03:09:11,008 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 03:09:11,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 03:09:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-23 03:09:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 03:09:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2018-11-23 03:09:11,014 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2018-11-23 03:09:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:11,014 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2018-11-23 03:09:11,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2018-11-23 03:09:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 03:09:11,015 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:11,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:09:11,016 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:11,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:11,016 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2018-11-23 03:09:11,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:11,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:11,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:11,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:11,047 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 03:09:11,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:11,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:11,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:11,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:11,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:11,048 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2018-11-23 03:09:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:11,066 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2018-11-23 03:09:11,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:11,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 03:09:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:11,067 INFO L225 Difference]: With dead ends: 112 [2018-11-23 03:09:11,067 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 03:09:11,067 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 03:09:11,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 03:09:11,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2018-11-23 03:09:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 03:09:11,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2018-11-23 03:09:11,073 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2018-11-23 03:09:11,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:11,073 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2018-11-23 03:09:11,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:11,073 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2018-11-23 03:09:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 03:09:11,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:11,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:09:11,074 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:11,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:11,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2018-11-23 03:09:11,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:11,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:11,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:11,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:11,113 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 03:09:11,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:11,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:11,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:11,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:11,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:11,114 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2018-11-23 03:09:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:11,136 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2018-11-23 03:09:11,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:11,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 03:09:11,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:11,137 INFO L225 Difference]: With dead ends: 184 [2018-11-23 03:09:11,137 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 03:09:11,138 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 03:09:11,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 03:09:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-11-23 03:09:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 03:09:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2018-11-23 03:09:11,145 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2018-11-23 03:09:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:11,145 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2018-11-23 03:09:11,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2018-11-23 03:09:11,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 03:09:11,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:11,146 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] [2018-11-23 03:09:11,146 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:11,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:11,146 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2018-11-23 03:09:11,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:11,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:11,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:11,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:11,169 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 03:09:11,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:11,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:11,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:11,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:11,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:11,170 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2018-11-23 03:09:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:11,181 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2018-11-23 03:09:11,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:11,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 03:09:11,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:11,182 INFO L225 Difference]: With dead ends: 165 [2018-11-23 03:09:11,182 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 03:09:11,183 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 03:09:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 03:09:11,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-23 03:09:11,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 03:09:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2018-11-23 03:09:11,189 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2018-11-23 03:09:11,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:11,189 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2018-11-23 03:09:11,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:11,189 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2018-11-23 03:09:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 03:09:11,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:11,190 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] [2018-11-23 03:09:11,190 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:11,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:11,190 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2018-11-23 03:09:11,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:11,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:11,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:11,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:11,214 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 03:09:11,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:11,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:11,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:11,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:11,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:11,216 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2018-11-23 03:09:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:11,230 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2018-11-23 03:09:11,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:11,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 03:09:11,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:11,231 INFO L225 Difference]: With dead ends: 204 [2018-11-23 03:09:11,231 INFO L226 Difference]: Without dead ends: 202 [2018-11-23 03:09:11,232 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 03:09:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-23 03:09:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2018-11-23 03:09:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-23 03:09:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2018-11-23 03:09:11,240 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2018-11-23 03:09:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:11,240 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2018-11-23 03:09:11,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2018-11-23 03:09:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 03:09:11,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:11,241 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] [2018-11-23 03:09:11,241 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:11,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:11,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2018-11-23 03:09:11,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:11,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:11,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:11,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:11,270 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 03:09:11,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:11,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:11,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:11,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:11,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:11,271 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2018-11-23 03:09:11,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:11,297 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2018-11-23 03:09:11,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:11,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 03:09:11,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:11,299 INFO L225 Difference]: With dead ends: 352 [2018-11-23 03:09:11,299 INFO L226 Difference]: Without dead ends: 210 [2018-11-23 03:09:11,300 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 03:09:11,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-23 03:09:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2018-11-23 03:09:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-23 03:09:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2018-11-23 03:09:11,311 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2018-11-23 03:09:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:11,311 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2018-11-23 03:09:11,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:11,311 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2018-11-23 03:09:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 03:09:11,312 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:11,313 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] [2018-11-23 03:09:11,313 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:11,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:11,313 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2018-11-23 03:09:11,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:11,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:11,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:11,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:11,328 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 03:09:11,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:11,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:11,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:11,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:11,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:11,329 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2018-11-23 03:09:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:11,357 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2018-11-23 03:09:11,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:11,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 03:09:11,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:11,358 INFO L225 Difference]: With dead ends: 312 [2018-11-23 03:09:11,358 INFO L226 Difference]: Without dead ends: 214 [2018-11-23 03:09:11,359 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 03:09:11,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-11-23 03:09:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-11-23 03:09:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-23 03:09:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2018-11-23 03:09:11,366 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2018-11-23 03:09:11,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:11,367 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2018-11-23 03:09:11,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:11,367 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2018-11-23 03:09:11,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 03:09:11,367 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:11,368 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] [2018-11-23 03:09:11,368 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:11,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:11,368 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2018-11-23 03:09:11,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:11,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:11,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:11,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:11,401 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 03:09:11,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:11,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:11,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:11,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:11,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:11,403 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2018-11-23 03:09:11,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:11,418 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2018-11-23 03:09:11,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:11,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 03:09:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:11,419 INFO L225 Difference]: With dead ends: 380 [2018-11-23 03:09:11,420 INFO L226 Difference]: Without dead ends: 378 [2018-11-23 03:09:11,420 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 03:09:11,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-11-23 03:09:11,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2018-11-23 03:09:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-11-23 03:09:11,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2018-11-23 03:09:11,429 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2018-11-23 03:09:11,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:11,429 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2018-11-23 03:09:11,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:11,429 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2018-11-23 03:09:11,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 03:09:11,430 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:11,430 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] [2018-11-23 03:09:11,430 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:11,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:11,431 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2018-11-23 03:09:11,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:11,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:11,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:11,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:11,450 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 03:09:11,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:11,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:11,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:11,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:11,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:11,451 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2018-11-23 03:09:11,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:11,465 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2018-11-23 03:09:11,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:11,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 03:09:11,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:11,466 INFO L225 Difference]: With dead ends: 684 [2018-11-23 03:09:11,466 INFO L226 Difference]: Without dead ends: 402 [2018-11-23 03:09:11,467 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 03:09:11,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-23 03:09:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2018-11-23 03:09:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-11-23 03:09:11,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2018-11-23 03:09:11,478 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2018-11-23 03:09:11,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:11,478 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2018-11-23 03:09:11,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:11,478 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2018-11-23 03:09:11,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 03:09:11,479 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:11,479 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] [2018-11-23 03:09:11,479 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:11,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:11,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2018-11-23 03:09:11,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:11,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:11,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:11,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:11,499 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 03:09:11,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:11,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:11,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:11,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:11,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:11,500 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2018-11-23 03:09:11,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:11,514 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2018-11-23 03:09:11,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:11,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 03:09:11,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:11,516 INFO L225 Difference]: With dead ends: 600 [2018-11-23 03:09:11,516 INFO L226 Difference]: Without dead ends: 410 [2018-11-23 03:09:11,517 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 03:09:11,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-11-23 03:09:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2018-11-23 03:09:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-11-23 03:09:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2018-11-23 03:09:11,532 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2018-11-23 03:09:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:11,532 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2018-11-23 03:09:11,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2018-11-23 03:09:11,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 03:09:11,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:11,533 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] [2018-11-23 03:09:11,534 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:11,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:11,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2018-11-23 03:09:11,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:11,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:11,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:11,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:11,554 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 03:09:11,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:11,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:11,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:11,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:11,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:11,556 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2018-11-23 03:09:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:11,584 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2018-11-23 03:09:11,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:11,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 03:09:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:11,587 INFO L225 Difference]: With dead ends: 716 [2018-11-23 03:09:11,587 INFO L226 Difference]: Without dead ends: 714 [2018-11-23 03:09:11,588 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 03:09:11,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-11-23 03:09:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2018-11-23 03:09:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-11-23 03:09:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2018-11-23 03:09:11,606 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2018-11-23 03:09:11,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:11,607 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2018-11-23 03:09:11,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2018-11-23 03:09:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 03:09:11,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:11,608 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] [2018-11-23 03:09:11,608 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:11,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:11,609 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2018-11-23 03:09:11,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:11,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:11,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:11,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:11,630 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 03:09:11,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:11,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:11,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:11,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:11,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:11,631 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2018-11-23 03:09:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:11,659 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2018-11-23 03:09:11,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:11,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 03:09:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:11,662 INFO L225 Difference]: With dead ends: 1340 [2018-11-23 03:09:11,662 INFO L226 Difference]: Without dead ends: 778 [2018-11-23 03:09:11,663 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 03:09:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-11-23 03:09:11,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2018-11-23 03:09:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-23 03:09:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2018-11-23 03:09:11,689 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2018-11-23 03:09:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:11,689 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2018-11-23 03:09:11,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:11,689 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2018-11-23 03:09:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 03:09:11,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:11,690 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 03:09:11,691 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:11,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2018-11-23 03:09:11,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:11,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:11,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:11,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:11,706 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 03:09:11,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:11,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:11,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:11,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:11,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:11,707 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2018-11-23 03:09:11,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:11,742 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2018-11-23 03:09:11,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:11,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 03:09:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:11,745 INFO L225 Difference]: With dead ends: 1164 [2018-11-23 03:09:11,745 INFO L226 Difference]: Without dead ends: 794 [2018-11-23 03:09:11,746 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 03:09:11,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-11-23 03:09:11,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2018-11-23 03:09:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-11-23 03:09:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2018-11-23 03:09:11,771 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2018-11-23 03:09:11,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:11,772 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2018-11-23 03:09:11,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2018-11-23 03:09:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 03:09:11,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:11,773 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 03:09:11,773 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:11,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:11,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2018-11-23 03:09:11,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:11,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:11,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:11,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:11,790 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 03:09:11,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:11,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:11,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:11,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:11,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:11,791 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2018-11-23 03:09:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:11,825 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2018-11-23 03:09:11,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:11,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 03:09:11,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:11,829 INFO L225 Difference]: With dead ends: 1356 [2018-11-23 03:09:11,830 INFO L226 Difference]: Without dead ends: 1354 [2018-11-23 03:09:11,830 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 03:09:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-23 03:09:11,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2018-11-23 03:09:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-11-23 03:09:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2018-11-23 03:09:11,865 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2018-11-23 03:09:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:11,865 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2018-11-23 03:09:11,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2018-11-23 03:09:11,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 03:09:11,867 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:11,867 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 03:09:11,867 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:11,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:11,868 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2018-11-23 03:09:11,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:11,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:11,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:11,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:11,880 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 03:09:11,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:11,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:11,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:11,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:11,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:11,881 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2018-11-23 03:09:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:11,929 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2018-11-23 03:09:11,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:11,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 03:09:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:11,934 INFO L225 Difference]: With dead ends: 2636 [2018-11-23 03:09:11,934 INFO L226 Difference]: Without dead ends: 1514 [2018-11-23 03:09:11,936 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 03:09:11,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-11-23 03:09:11,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2018-11-23 03:09:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2018-11-23 03:09:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2018-11-23 03:09:11,985 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2018-11-23 03:09:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:11,985 INFO L480 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2018-11-23 03:09:11,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:11,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2018-11-23 03:09:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 03:09:11,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:11,987 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 03:09:11,987 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:11,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:11,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2018-11-23 03:09:11,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:11,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:11,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:11,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:11,998 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 03:09:11,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:11,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:11,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:11,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:11,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:11,999 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2018-11-23 03:09:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:12,033 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2018-11-23 03:09:12,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:12,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 03:09:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:12,037 INFO L225 Difference]: With dead ends: 2268 [2018-11-23 03:09:12,037 INFO L226 Difference]: Without dead ends: 1546 [2018-11-23 03:09:12,039 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 03:09:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-11-23 03:09:12,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2018-11-23 03:09:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-23 03:09:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2018-11-23 03:09:12,090 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2018-11-23 03:09:12,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:12,090 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2018-11-23 03:09:12,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:12,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2018-11-23 03:09:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 03:09:12,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:12,092 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 03:09:12,093 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:12,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:12,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2018-11-23 03:09:12,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:12,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:12,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:12,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:12,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:12,117 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 03:09:12,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:12,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:12,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:12,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:12,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:12,118 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2018-11-23 03:09:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:12,187 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2018-11-23 03:09:12,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:12,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 03:09:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:12,193 INFO L225 Difference]: With dead ends: 2572 [2018-11-23 03:09:12,194 INFO L226 Difference]: Without dead ends: 2570 [2018-11-23 03:09:12,195 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 03:09:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2018-11-23 03:09:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2018-11-23 03:09:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-11-23 03:09:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2018-11-23 03:09:12,268 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2018-11-23 03:09:12,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:12,268 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2018-11-23 03:09:12,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2018-11-23 03:09:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 03:09:12,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:12,271 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 03:09:12,272 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:12,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:12,272 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2018-11-23 03:09:12,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:12,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:12,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:12,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:12,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:12,287 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 03:09:12,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:12,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:12,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:12,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:12,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:12,288 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2018-11-23 03:09:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:12,360 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2018-11-23 03:09:12,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:12,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 03:09:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:12,368 INFO L225 Difference]: With dead ends: 5196 [2018-11-23 03:09:12,368 INFO L226 Difference]: Without dead ends: 2954 [2018-11-23 03:09:12,371 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 03:09:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-11-23 03:09:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2018-11-23 03:09:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2018-11-23 03:09:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2018-11-23 03:09:12,456 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2018-11-23 03:09:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:12,456 INFO L480 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2018-11-23 03:09:12,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:12,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2018-11-23 03:09:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 03:09:12,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:12,461 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 03:09:12,461 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:12,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:12,461 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2018-11-23 03:09:12,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:12,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:12,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:12,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:12,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:12,477 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 03:09:12,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:12,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:12,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:12,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:12,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:12,478 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2018-11-23 03:09:12,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:12,545 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2018-11-23 03:09:12,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:12,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 03:09:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:12,551 INFO L225 Difference]: With dead ends: 4428 [2018-11-23 03:09:12,552 INFO L226 Difference]: Without dead ends: 3018 [2018-11-23 03:09:12,554 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 03:09:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2018-11-23 03:09:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2018-11-23 03:09:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-11-23 03:09:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2018-11-23 03:09:12,646 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2018-11-23 03:09:12,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:12,646 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2018-11-23 03:09:12,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2018-11-23 03:09:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 03:09:12,649 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:12,649 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 03:09:12,649 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:12,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:12,649 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2018-11-23 03:09:12,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:12,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:12,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:12,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:12,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:12,666 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 03:09:12,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:12,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:12,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:12,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:12,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:12,667 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2018-11-23 03:09:12,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:12,787 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2018-11-23 03:09:12,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:12,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 03:09:12,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:12,794 INFO L225 Difference]: With dead ends: 8650 [2018-11-23 03:09:12,794 INFO L226 Difference]: Without dead ends: 3016 [2018-11-23 03:09:12,800 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 03:09:12,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2018-11-23 03:09:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2018-11-23 03:09:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-11-23 03:09:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2018-11-23 03:09:12,879 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2018-11-23 03:09:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:12,880 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2018-11-23 03:09:12,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2018-11-23 03:09:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 03:09:12,882 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:09:12,882 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 03:09:12,882 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:09:12,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:09:12,883 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2018-11-23 03:09:12,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:09:12,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:09:12,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:12,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:09:12,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:09:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:09:12,897 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 03:09:12,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:09:12,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:09:12,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:09:12,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:09:12,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:09:12,898 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2018-11-23 03:09:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:09:12,954 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2018-11-23 03:09:12,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:09:12,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 03:09:12,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:09:12,955 INFO L225 Difference]: With dead ends: 3016 [2018-11-23 03:09:12,955 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 03:09:12,958 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 03:09:12,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 03:09:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 03:09:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 03:09:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 03:09:12,959 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-11-23 03:09:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:09:12,959 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:09:12,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:09:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 03:09:12,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 03:09:12,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 03:09:12,981 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 03:09:12,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 03:09:12,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 03:09:12,981 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 03:09:12,982 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 03:09:12,982 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 03:09:12,982 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-23 03:09:12,982 INFO L444 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-11-23 03:09:12,982 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 03:09:12,982 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-11-23 03:09:12,982 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 03:09:12,982 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-23 03:09:12,982 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 03:09:12,982 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 03:09:12,982 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-11-23 03:09:12,982 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-23 03:09:12,982 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-11-23 03:09:12,983 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-23 03:09:12,983 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-11-23 03:09:12,983 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 03:09:12,983 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 03:09:12,983 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 03:09:12,983 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 03:09:12,983 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-23 03:09:12,983 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-11-23 03:09:12,983 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-23 03:09:12,983 INFO L451 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-11-23 03:09:12,983 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 03:09:12,983 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 03:09:12,983 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-23 03:09:12,984 INFO L448 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-11-23 03:09:12,984 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 03:09:12,984 INFO L451 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-11-23 03:09:12,984 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 03:09:12,984 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 03:09:12,984 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-11-23 03:09:12,984 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-11-23 03:09:12,984 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-11-23 03:09:12,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:09:12 BoogieIcfgContainer [2018-11-23 03:09:12,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:09:12,990 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:09:12,990 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:09:12,990 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:09:12,991 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:09:10" (3/4) ... [2018-11-23 03:09:12,993 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 03:09:12,998 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 03:09:12,998 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 03:09:13,002 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 03:09:13,002 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 03:09:13,003 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 03:09:13,041 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_01060159-3c0b-4b9c-8ae5-f60a75a3a830/bin-2019/uautomizer/witness.graphml [2018-11-23 03:09:13,041 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:09:13,041 INFO L168 Benchmark]: Toolchain (without parser) took 2912.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 959.1 MB in the beginning and 928.9 MB in the end (delta: 30.3 MB). Peak memory consumption was 244.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:09:13,042 INFO L168 Benchmark]: CDTParser took 0.10 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 03:09:13,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.34 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:09:13,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.13 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 03:09:13,043 INFO L168 Benchmark]: Boogie Preprocessor took 48.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:09:13,043 INFO L168 Benchmark]: RCFGBuilder took 189.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-23 03:09:13,043 INFO L168 Benchmark]: TraceAbstraction took 2426.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 928.9 MB in the end (delta: 188.2 MB). Peak memory consumption was 262.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:09:13,044 INFO L168 Benchmark]: Witness Printer took 50.66 ms. Allocated memory is still 1.2 GB. Free memory is still 928.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:09:13,045 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.10 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 180.34 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.13 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 48.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -192.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 189.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2426.91 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 928.9 MB in the end (delta: 188.2 MB). Peak memory consumption was 262.7 MB. Max. memory is 11.5 GB. * Witness Printer took 50.66 ms. Allocated memory is still 1.2 GB. Free memory is still 928.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: 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, 38 locations, 1 error locations. SAFE Result, 2.3s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, 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: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 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.4s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...