./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3d87b17c-0642-4521-a035-e4652e7213d0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3d87b17c-0642-4521-a035-e4652e7213d0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3d87b17c-0642-4521-a035-e4652e7213d0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3d87b17c-0642-4521-a035-e4652e7213d0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3d87b17c-0642-4521-a035-e4652e7213d0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3d87b17c-0642-4521-a035-e4652e7213d0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 11:13:13,180 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:13:13,181 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:13:13,187 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:13:13,187 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:13:13,187 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:13:13,188 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:13:13,189 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:13:13,190 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:13:13,191 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:13:13,191 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:13:13,191 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:13:13,192 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:13:13,192 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:13:13,193 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:13:13,193 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:13:13,194 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:13:13,195 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:13:13,196 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:13:13,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:13:13,197 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:13:13,198 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:13:13,199 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:13:13,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:13:13,199 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:13:13,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:13:13,200 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:13:13,201 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:13:13,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:13:13,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:13:13,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:13:13,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:13:13,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:13:13,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:13:13,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:13:13,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:13:13,204 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3d87b17c-0642-4521-a035-e4652e7213d0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 11:13:13,211 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:13:13,211 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:13:13,211 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 11:13:13,212 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 11:13:13,212 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 11:13:13,212 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 11:13:13,212 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 11:13:13,212 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:13:13,213 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:13:13,213 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:13:13,213 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:13:13,213 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:13:13,213 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 11:13:13,213 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 11:13:13,213 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 11:13:13,213 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:13:13,214 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 11:13:13,214 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 11:13:13,214 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 11:13:13,214 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:13:13,214 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:13:13,214 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 11:13:13,214 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 11:13:13,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:13:13,215 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:13:13,215 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 11:13:13,215 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 11:13:13,215 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 11:13:13,215 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 11:13:13,215 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 11:13:13,215 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_3d87b17c-0642-4521-a035-e4652e7213d0/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2018-12-09 11:13:13,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:13:13,240 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:13:13,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:13:13,243 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:13:13,243 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:13:13,243 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3d87b17c-0642-4521-a035-e4652e7213d0/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 11:13:13,277 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d87b17c-0642-4521-a035-e4652e7213d0/bin-2019/uautomizer/data/8b5299c94/fe828ab84abb458e8d7784a4bcddf24c/FLAG3ab175051 [2018-12-09 11:13:13,766 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:13:13,766 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3d87b17c-0642-4521-a035-e4652e7213d0/sv-benchmarks/c/locks/test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 11:13:13,770 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3d87b17c-0642-4521-a035-e4652e7213d0/bin-2019/uautomizer/data/8b5299c94/fe828ab84abb458e8d7784a4bcddf24c/FLAG3ab175051 [2018-12-09 11:13:14,264 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3d87b17c-0642-4521-a035-e4652e7213d0/bin-2019/uautomizer/data/8b5299c94/fe828ab84abb458e8d7784a4bcddf24c [2018-12-09 11:13:14,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:13:14,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:13:14,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:13:14,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:13:14,269 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:13:14,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:13:14" (1/1) ... [2018-12-09 11:13:14,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2817da2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:14, skipping insertion in model container [2018-12-09 11:13:14,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:13:14" (1/1) ... [2018-12-09 11:13:14,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:13:14,286 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:13:14,376 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:13:14,379 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:13:14,395 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:13:14,402 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:13:14,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:14 WrapperNode [2018-12-09 11:13:14,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:13:14,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:13:14,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:13:14,403 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:13:14,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:14" (1/1) ... [2018-12-09 11:13:14,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:14" (1/1) ... [2018-12-09 11:13:14,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:13:14,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:13:14,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:13:14,416 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:13:14,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:14" (1/1) ... [2018-12-09 11:13:14,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:14" (1/1) ... [2018-12-09 11:13:14,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:14" (1/1) ... [2018-12-09 11:13:14,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:14" (1/1) ... [2018-12-09 11:13:14,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:14" (1/1) ... [2018-12-09 11:13:14,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:14" (1/1) ... [2018-12-09 11:13:14,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:14" (1/1) ... [2018-12-09 11:13:14,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:13:14,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:13:14,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:13:14,460 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:13:14,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3d87b17c-0642-4521-a035-e4652e7213d0/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-12-09 11:13:14,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 11:13:14,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 11:13:14,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:13:14,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:13:14,492 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 11:13:14,492 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 11:13:14,658 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:13:14,658 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 11:13:14,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:13:14 BoogieIcfgContainer [2018-12-09 11:13:14,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:13:14,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 11:13:14,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 11:13:14,661 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 11:13:14,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:13:14" (1/3) ... [2018-12-09 11:13:14,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23088837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:13:14, skipping insertion in model container [2018-12-09 11:13:14,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:13:14" (2/3) ... [2018-12-09 11:13:14,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23088837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:13:14, skipping insertion in model container [2018-12-09 11:13:14,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:13:14" (3/3) ... [2018-12-09 11:13:14,663 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_13_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 11:13:14,669 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 11:13:14,674 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 11:13:14,684 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 11:13:14,702 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 11:13:14,702 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 11:13:14,702 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 11:13:14,702 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 11:13:14,702 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:13:14,702 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:13:14,702 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 11:13:14,702 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:13:14,703 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 11:13:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-12-09 11:13:14,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 11:13:14,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:14,717 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-12-09 11:13:14,719 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:14,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:14,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2018-12-09 11:13:14,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:14,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:14,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:14,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:14,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:14,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:14,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:14,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:14,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:14,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:14,850 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2018-12-09 11:13:14,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:14,886 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2018-12-09 11:13:14,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:14,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 11:13:14,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:14,893 INFO L225 Difference]: With dead ends: 105 [2018-12-09 11:13:14,893 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 11:13:14,895 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-12-09 11:13:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 11:13:14,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2018-12-09 11:13:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 11:13:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2018-12-09 11:13:14,919 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2018-12-09 11:13:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:14,919 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2018-12-09 11:13:14,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2018-12-09 11:13:14,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 11:13:14,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:14,920 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-12-09 11:13:14,920 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:14,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:14,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2018-12-09 11:13:14,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:14,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:14,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:14,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:14,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:14,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:14,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:14,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:14,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:14,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:14,966 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2018-12-09 11:13:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:14,991 INFO L93 Difference]: Finished difference Result 147 states and 272 transitions. [2018-12-09 11:13:14,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:14,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 11:13:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:14,993 INFO L225 Difference]: With dead ends: 147 [2018-12-09 11:13:14,993 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 11:13:14,993 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-12-09 11:13:14,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 11:13:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-12-09 11:13:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-09 11:13:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2018-12-09 11:13:14,999 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2018-12-09 11:13:14,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:14,999 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2018-12-09 11:13:14,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2018-12-09 11:13:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 11:13:14,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,000 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-12-09 11:13:15,000 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,000 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2018-12-09 11:13:15,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:15,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,024 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2018-12-09 11:13:15,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:15,038 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2018-12-09 11:13:15,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:15,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 11:13:15,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:15,039 INFO L225 Difference]: With dead ends: 135 [2018-12-09 11:13:15,039 INFO L226 Difference]: Without dead ends: 93 [2018-12-09 11:13:15,040 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-12-09 11:13:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-09 11:13:15,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-12-09 11:13:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-09 11:13:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2018-12-09 11:13:15,044 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2018-12-09 11:13:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:15,045 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2018-12-09 11:13:15,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2018-12-09 11:13:15,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 11:13:15,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,046 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-12-09 11:13:15,046 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2018-12-09 11:13:15,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:15,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,077 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2018-12-09 11:13:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:15,091 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2018-12-09 11:13:15,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:15,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 11:13:15,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:15,093 INFO L225 Difference]: With dead ends: 172 [2018-12-09 11:13:15,093 INFO L226 Difference]: Without dead ends: 170 [2018-12-09 11:13:15,093 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-12-09 11:13:15,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-09 11:13:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2018-12-09 11:13:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-09 11:13:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2018-12-09 11:13:15,099 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2018-12-09 11:13:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:15,099 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2018-12-09 11:13:15,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2018-12-09 11:13:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 11:13:15,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,100 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-12-09 11:13:15,101 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2018-12-09 11:13:15,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:15,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,123 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2018-12-09 11:13:15,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:15,134 INFO L93 Difference]: Finished difference Result 284 states and 518 transitions. [2018-12-09 11:13:15,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:15,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-09 11:13:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:15,136 INFO L225 Difference]: With dead ends: 284 [2018-12-09 11:13:15,136 INFO L226 Difference]: Without dead ends: 172 [2018-12-09 11:13:15,136 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-12-09 11:13:15,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-09 11:13:15,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-12-09 11:13:15,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-09 11:13:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2018-12-09 11:13:15,146 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2018-12-09 11:13:15,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:15,146 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2018-12-09 11:13:15,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:15,146 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2018-12-09 11:13:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 11:13:15,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,147 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-12-09 11:13:15,147 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,148 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2018-12-09 11:13:15,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:15,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,172 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2018-12-09 11:13:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:15,186 INFO L93 Difference]: Finished difference Result 255 states and 457 transitions. [2018-12-09 11:13:15,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:15,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 11:13:15,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:15,188 INFO L225 Difference]: With dead ends: 255 [2018-12-09 11:13:15,188 INFO L226 Difference]: Without dead ends: 174 [2018-12-09 11:13:15,188 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-12-09 11:13:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-09 11:13:15,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-12-09 11:13:15,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-09 11:13:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2018-12-09 11:13:15,197 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2018-12-09 11:13:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:15,198 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2018-12-09 11:13:15,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2018-12-09 11:13:15,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 11:13:15,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,199 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-12-09 11:13:15,199 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2018-12-09 11:13:15,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:15,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,223 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2018-12-09 11:13:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:15,236 INFO L93 Difference]: Finished difference Result 324 states and 584 transitions. [2018-12-09 11:13:15,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:15,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 11:13:15,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:15,238 INFO L225 Difference]: With dead ends: 324 [2018-12-09 11:13:15,238 INFO L226 Difference]: Without dead ends: 322 [2018-12-09 11:13:15,238 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-12-09 11:13:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-09 11:13:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2018-12-09 11:13:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-09 11:13:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2018-12-09 11:13:15,244 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2018-12-09 11:13:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:15,244 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2018-12-09 11:13:15,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2018-12-09 11:13:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 11:13:15,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,245 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-12-09 11:13:15,246 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2018-12-09 11:13:15,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:15,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,259 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2018-12-09 11:13:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:15,270 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2018-12-09 11:13:15,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:15,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 11:13:15,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:15,272 INFO L225 Difference]: With dead ends: 552 [2018-12-09 11:13:15,272 INFO L226 Difference]: Without dead ends: 330 [2018-12-09 11:13:15,272 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-12-09 11:13:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-09 11:13:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2018-12-09 11:13:15,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-12-09 11:13:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2018-12-09 11:13:15,279 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2018-12-09 11:13:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:15,279 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2018-12-09 11:13:15,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:15,279 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2018-12-09 11:13:15,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 11:13:15,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:15,280 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2018-12-09 11:13:15,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:15,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,293 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2018-12-09 11:13:15,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:15,310 INFO L93 Difference]: Finished difference Result 492 states and 864 transitions. [2018-12-09 11:13:15,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:15,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 11:13:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:15,311 INFO L225 Difference]: With dead ends: 492 [2018-12-09 11:13:15,311 INFO L226 Difference]: Without dead ends: 334 [2018-12-09 11:13:15,311 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-12-09 11:13:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-09 11:13:15,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2018-12-09 11:13:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-12-09 11:13:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2018-12-09 11:13:15,317 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2018-12-09 11:13:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:15,317 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2018-12-09 11:13:15,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2018-12-09 11:13:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 11:13:15,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:15,319 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,319 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2018-12-09 11:13:15,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:15,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,332 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2018-12-09 11:13:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:15,352 INFO L93 Difference]: Finished difference Result 620 states and 1096 transitions. [2018-12-09 11:13:15,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:15,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 11:13:15,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:15,354 INFO L225 Difference]: With dead ends: 620 [2018-12-09 11:13:15,354 INFO L226 Difference]: Without dead ends: 618 [2018-12-09 11:13:15,355 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-12-09 11:13:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-12-09 11:13:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2018-12-09 11:13:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-12-09 11:13:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2018-12-09 11:13:15,364 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2018-12-09 11:13:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:15,365 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2018-12-09 11:13:15,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2018-12-09 11:13:15,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 11:13:15,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:15,366 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,366 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2018-12-09 11:13:15,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:15,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,384 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2018-12-09 11:13:15,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:15,411 INFO L93 Difference]: Finished difference Result 1084 states and 1872 transitions. [2018-12-09 11:13:15,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:15,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 11:13:15,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:15,414 INFO L225 Difference]: With dead ends: 1084 [2018-12-09 11:13:15,414 INFO L226 Difference]: Without dead ends: 642 [2018-12-09 11:13:15,415 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-12-09 11:13:15,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-12-09 11:13:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2018-12-09 11:13:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-12-09 11:13:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2018-12-09 11:13:15,434 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2018-12-09 11:13:15,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:15,434 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2018-12-09 11:13:15,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2018-12-09 11:13:15,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 11:13:15,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:15,436 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,436 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2018-12-09 11:13:15,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,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-12-09 11:13:15,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,451 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2018-12-09 11:13:15,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:15,469 INFO L93 Difference]: Finished difference Result 960 states and 1636 transitions. [2018-12-09 11:13:15,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:15,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 11:13:15,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:15,472 INFO L225 Difference]: With dead ends: 960 [2018-12-09 11:13:15,472 INFO L226 Difference]: Without dead ends: 650 [2018-12-09 11:13:15,473 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-12-09 11:13:15,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-12-09 11:13:15,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2018-12-09 11:13:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-12-09 11:13:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2018-12-09 11:13:15,490 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2018-12-09 11:13:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:15,490 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2018-12-09 11:13:15,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:15,490 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2018-12-09 11:13:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 11:13:15,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:15,492 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2018-12-09 11:13:15,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:15,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,514 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2018-12-09 11:13:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:15,537 INFO L93 Difference]: Finished difference Result 1196 states and 2056 transitions. [2018-12-09 11:13:15,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:15,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 11:13:15,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:15,540 INFO L225 Difference]: With dead ends: 1196 [2018-12-09 11:13:15,540 INFO L226 Difference]: Without dead ends: 1194 [2018-12-09 11:13:15,540 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-12-09 11:13:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2018-12-09 11:13:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2018-12-09 11:13:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-09 11:13:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2018-12-09 11:13:15,556 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2018-12-09 11:13:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:15,557 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2018-12-09 11:13:15,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2018-12-09 11:13:15,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 11:13:15,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:15,558 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,558 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2018-12-09 11:13:15,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:15,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,569 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2018-12-09 11:13:15,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:15,598 INFO L93 Difference]: Finished difference Result 2140 states and 3560 transitions. [2018-12-09 11:13:15,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:15,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 11:13:15,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:15,603 INFO L225 Difference]: With dead ends: 2140 [2018-12-09 11:13:15,603 INFO L226 Difference]: Without dead ends: 1258 [2018-12-09 11:13:15,604 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-12-09 11:13:15,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2018-12-09 11:13:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2018-12-09 11:13:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2018-12-09 11:13:15,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2018-12-09 11:13:15,630 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2018-12-09 11:13:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:15,630 INFO L480 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2018-12-09 11:13:15,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2018-12-09 11:13:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 11:13:15,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:15,631 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,632 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2018-12-09 11:13:15,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:15,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,647 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2018-12-09 11:13:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:15,679 INFO L93 Difference]: Finished difference Result 1884 states and 3096 transitions. [2018-12-09 11:13:15,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:15,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 11:13:15,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:15,683 INFO L225 Difference]: With dead ends: 1884 [2018-12-09 11:13:15,683 INFO L226 Difference]: Without dead ends: 1274 [2018-12-09 11:13:15,684 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-12-09 11:13:15,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2018-12-09 11:13:15,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2018-12-09 11:13:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2018-12-09 11:13:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2018-12-09 11:13:15,718 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2018-12-09 11:13:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:15,718 INFO L480 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2018-12-09 11:13:15,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2018-12-09 11:13:15,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 11:13:15,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:15,720 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2018-12-09 11:13:15,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:15,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,737 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2018-12-09 11:13:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:15,772 INFO L93 Difference]: Finished difference Result 2316 states and 3848 transitions. [2018-12-09 11:13:15,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:15,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 11:13:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:15,778 INFO L225 Difference]: With dead ends: 2316 [2018-12-09 11:13:15,778 INFO L226 Difference]: Without dead ends: 2314 [2018-12-09 11:13:15,779 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-12-09 11:13:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-12-09 11:13:15,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2018-12-09 11:13:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2018-12-09 11:13:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2018-12-09 11:13:15,825 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2018-12-09 11:13:15,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:15,825 INFO L480 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2018-12-09 11:13:15,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2018-12-09 11:13:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 11:13:15,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:15,828 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2018-12-09 11:13:15,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:15,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,843 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2018-12-09 11:13:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:15,888 INFO L93 Difference]: Finished difference Result 4236 states and 6760 transitions. [2018-12-09 11:13:15,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:15,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 11:13:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:15,893 INFO L225 Difference]: With dead ends: 4236 [2018-12-09 11:13:15,893 INFO L226 Difference]: Without dead ends: 2474 [2018-12-09 11:13:15,895 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-12-09 11:13:15,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2018-12-09 11:13:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2018-12-09 11:13:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2018-12-09 11:13:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2018-12-09 11:13:15,939 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2018-12-09 11:13:15,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:15,939 INFO L480 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2018-12-09 11:13:15,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2018-12-09 11:13:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 11:13:15,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:15,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:15,941 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:15,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:15,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2018-12-09 11:13:15,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:15,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:15,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:15,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:15,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:15,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:15,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:15,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:15,965 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2018-12-09 11:13:16,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:16,006 INFO L93 Difference]: Finished difference Result 3708 states and 5848 transitions. [2018-12-09 11:13:16,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:16,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 11:13:16,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:16,012 INFO L225 Difference]: With dead ends: 3708 [2018-12-09 11:13:16,013 INFO L226 Difference]: Without dead ends: 2506 [2018-12-09 11:13:16,015 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-12-09 11:13:16,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-12-09 11:13:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2018-12-09 11:13:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2018-12-09 11:13:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2018-12-09 11:13:16,052 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2018-12-09 11:13:16,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:16,052 INFO L480 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2018-12-09 11:13:16,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2018-12-09 11:13:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 11:13:16,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:16,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:16,054 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:16,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:16,054 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2018-12-09 11:13:16,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:16,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:16,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:16,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:16,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:16,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:16,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:16,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:16,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:16,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:16,066 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2018-12-09 11:13:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:16,105 INFO L93 Difference]: Finished difference Result 4492 states and 7176 transitions. [2018-12-09 11:13:16,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:16,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 11:13:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:16,113 INFO L225 Difference]: With dead ends: 4492 [2018-12-09 11:13:16,113 INFO L226 Difference]: Without dead ends: 4490 [2018-12-09 11:13:16,114 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-12-09 11:13:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-12-09 11:13:16,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2018-12-09 11:13:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2018-12-09 11:13:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2018-12-09 11:13:16,166 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2018-12-09 11:13:16,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:16,166 INFO L480 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2018-12-09 11:13:16,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2018-12-09 11:13:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 11:13:16,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:16,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:16,168 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:16,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:16,168 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2018-12-09 11:13:16,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:16,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:16,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:16,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:16,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:16,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:16,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:16,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:16,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:16,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:16,178 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2018-12-09 11:13:16,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:16,245 INFO L93 Difference]: Finished difference Result 8396 states and 12808 transitions. [2018-12-09 11:13:16,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:16,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 11:13:16,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:16,253 INFO L225 Difference]: With dead ends: 8396 [2018-12-09 11:13:16,253 INFO L226 Difference]: Without dead ends: 4874 [2018-12-09 11:13:16,257 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-12-09 11:13:16,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-12-09 11:13:16,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2018-12-09 11:13:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2018-12-09 11:13:16,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2018-12-09 11:13:16,334 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2018-12-09 11:13:16,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:16,334 INFO L480 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2018-12-09 11:13:16,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2018-12-09 11:13:16,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 11:13:16,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:16,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:16,338 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:16,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:16,338 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2018-12-09 11:13:16,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:16,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:16,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:16,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:16,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:16,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:16,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:16,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:16,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:16,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:16,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:16,359 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2018-12-09 11:13:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:16,407 INFO L93 Difference]: Finished difference Result 7308 states and 11016 transitions. [2018-12-09 11:13:16,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:16,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 11:13:16,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:16,413 INFO L225 Difference]: With dead ends: 7308 [2018-12-09 11:13:16,413 INFO L226 Difference]: Without dead ends: 4938 [2018-12-09 11:13:16,416 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-12-09 11:13:16,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2018-12-09 11:13:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2018-12-09 11:13:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2018-12-09 11:13:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2018-12-09 11:13:16,478 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2018-12-09 11:13:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:16,478 INFO L480 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2018-12-09 11:13:16,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2018-12-09 11:13:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 11:13:16,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:16,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:16,481 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:16,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:16,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2018-12-09 11:13:16,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:16,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:16,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:16,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:16,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:16,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:16,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:16,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:16,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:16,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:16,496 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2018-12-09 11:13:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:16,571 INFO L93 Difference]: Finished difference Result 14412 states and 21320 transitions. [2018-12-09 11:13:16,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:16,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 11:13:16,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:16,581 INFO L225 Difference]: With dead ends: 14412 [2018-12-09 11:13:16,582 INFO L226 Difference]: Without dead ends: 9610 [2018-12-09 11:13:16,587 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-12-09 11:13:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2018-12-09 11:13:16,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2018-12-09 11:13:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-12-09 11:13:16,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2018-12-09 11:13:16,730 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2018-12-09 11:13:16,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:16,731 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2018-12-09 11:13:16,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:16,731 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2018-12-09 11:13:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 11:13:16,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:16,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:16,736 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:16,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:16,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2018-12-09 11:13:16,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:16,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:16,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:16,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:16,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:16,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:16,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:16,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:16,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:16,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:16,763 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2018-12-09 11:13:16,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:16,848 INFO L93 Difference]: Finished difference Result 11148 states and 16776 transitions. [2018-12-09 11:13:16,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:16,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 11:13:16,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:16,861 INFO L225 Difference]: With dead ends: 11148 [2018-12-09 11:13:16,861 INFO L226 Difference]: Without dead ends: 11146 [2018-12-09 11:13:16,864 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-12-09 11:13:16,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-12-09 11:13:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2018-12-09 11:13:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2018-12-09 11:13:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2018-12-09 11:13:16,976 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2018-12-09 11:13:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:16,976 INFO L480 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2018-12-09 11:13:16,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2018-12-09 11:13:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 11:13:16,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:16,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:16,981 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:16,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:16,981 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2018-12-09 11:13:16,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:16,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:16,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:16,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:16,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:16,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:16,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:16,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:16,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:16,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:16,995 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2018-12-09 11:13:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:17,112 INFO L93 Difference]: Finished difference Result 16780 states and 24712 transitions. [2018-12-09 11:13:17,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:17,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 11:13:17,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:17,128 INFO L225 Difference]: With dead ends: 16780 [2018-12-09 11:13:17,128 INFO L226 Difference]: Without dead ends: 16778 [2018-12-09 11:13:17,131 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-12-09 11:13:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2018-12-09 11:13:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2018-12-09 11:13:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-12-09 11:13:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2018-12-09 11:13:17,277 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2018-12-09 11:13:17,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:17,277 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2018-12-09 11:13:17,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:17,278 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2018-12-09 11:13:17,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 11:13:17,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:17,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:17,284 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:17,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:17,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2018-12-09 11:13:17,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:17,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:17,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:17,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:17,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:17,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:17,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:17,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:17,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:17,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:17,307 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2018-12-09 11:13:17,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:17,476 INFO L93 Difference]: Finished difference Result 32908 states and 46216 transitions. [2018-12-09 11:13:17,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:17,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 11:13:17,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:17,500 INFO L225 Difference]: With dead ends: 32908 [2018-12-09 11:13:17,500 INFO L226 Difference]: Without dead ends: 18826 [2018-12-09 11:13:17,515 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-12-09 11:13:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2018-12-09 11:13:17,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2018-12-09 11:13:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2018-12-09 11:13:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2018-12-09 11:13:17,727 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2018-12-09 11:13:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:17,728 INFO L480 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2018-12-09 11:13:17,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:17,728 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2018-12-09 11:13:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 11:13:17,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:17,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:17,733 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:17,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:17,734 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2018-12-09 11:13:17,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:17,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:17,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:17,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:17,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:17,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:17,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:17,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:17,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:17,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:17,751 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2018-12-09 11:13:17,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:17,884 INFO L93 Difference]: Finished difference Result 28428 states and 39432 transitions. [2018-12-09 11:13:17,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:17,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-09 11:13:17,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:17,899 INFO L225 Difference]: With dead ends: 28428 [2018-12-09 11:13:17,899 INFO L226 Difference]: Without dead ends: 19210 [2018-12-09 11:13:17,906 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-12-09 11:13:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2018-12-09 11:13:18,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2018-12-09 11:13:18,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2018-12-09 11:13:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2018-12-09 11:13:18,136 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2018-12-09 11:13:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:18,136 INFO L480 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2018-12-09 11:13:18,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2018-12-09 11:13:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 11:13:18,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:18,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:18,143 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:18,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:18,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2018-12-09 11:13:18,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:18,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:18,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:18,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:18,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:18,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:18,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:18,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:18,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:18,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:18,155 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2018-12-09 11:13:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:18,359 INFO L93 Difference]: Finished difference Result 32780 states and 45832 transitions. [2018-12-09 11:13:18,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:18,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-09 11:13:18,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:18,379 INFO L225 Difference]: With dead ends: 32780 [2018-12-09 11:13:18,379 INFO L226 Difference]: Without dead ends: 32778 [2018-12-09 11:13:18,384 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-12-09 11:13:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2018-12-09 11:13:18,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2018-12-09 11:13:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2018-12-09 11:13:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2018-12-09 11:13:18,677 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2018-12-09 11:13:18,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:18,677 INFO L480 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2018-12-09 11:13:18,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:18,677 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2018-12-09 11:13:18,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 11:13:18,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:18,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:18,692 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:18,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:18,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2018-12-09 11:13:18,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:18,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:18,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:18,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:18,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:18,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:18,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:18,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:18,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:18,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:18,712 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2018-12-09 11:13:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:19,035 INFO L93 Difference]: Finished difference Result 65548 states and 87304 transitions. [2018-12-09 11:13:19,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:19,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-09 11:13:19,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:19,057 INFO L225 Difference]: With dead ends: 65548 [2018-12-09 11:13:19,057 INFO L226 Difference]: Without dead ends: 37386 [2018-12-09 11:13:19,075 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-12-09 11:13:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2018-12-09 11:13:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2018-12-09 11:13:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2018-12-09 11:13:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2018-12-09 11:13:19,494 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2018-12-09 11:13:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:19,494 INFO L480 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2018-12-09 11:13:19,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:19,494 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2018-12-09 11:13:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 11:13:19,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:19,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:19,504 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:19,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:19,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2018-12-09 11:13:19,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:19,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:19,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:19,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:19,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:19,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:19,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:19,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:19,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:19,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:19,527 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2018-12-09 11:13:19,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:19,828 INFO L93 Difference]: Finished difference Result 56076 states and 73480 transitions. [2018-12-09 11:13:19,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:19,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-09 11:13:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:19,851 INFO L225 Difference]: With dead ends: 56076 [2018-12-09 11:13:19,851 INFO L226 Difference]: Without dead ends: 37898 [2018-12-09 11:13:19,862 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-12-09 11:13:19,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2018-12-09 11:13:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2018-12-09 11:13:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2018-12-09 11:13:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2018-12-09 11:13:20,282 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2018-12-09 11:13:20,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:20,283 INFO L480 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2018-12-09 11:13:20,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:20,283 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2018-12-09 11:13:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 11:13:20,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:20,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:20,293 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:20,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:20,293 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2018-12-09 11:13:20,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:20,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:20,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:20,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:20,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:20,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:20,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:20,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:20,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:20,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:20,311 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2018-12-09 11:13:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:20,813 INFO L93 Difference]: Finished difference Result 63500 states and 83464 transitions. [2018-12-09 11:13:20,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:20,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-09 11:13:20,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:20,860 INFO L225 Difference]: With dead ends: 63500 [2018-12-09 11:13:20,860 INFO L226 Difference]: Without dead ends: 63498 [2018-12-09 11:13:20,871 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-12-09 11:13:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2018-12-09 11:13:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2018-12-09 11:13:21,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2018-12-09 11:13:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2018-12-09 11:13:21,517 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2018-12-09 11:13:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:21,518 INFO L480 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2018-12-09 11:13:21,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:21,518 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2018-12-09 11:13:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 11:13:21,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:21,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:21,539 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:21,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:21,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2018-12-09 11:13:21,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:21,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:21,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:21,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:21,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:21,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:21,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:21,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:21,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:21,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:21,553 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2018-12-09 11:13:22,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:22,167 INFO L93 Difference]: Finished difference Result 130060 states and 163336 transitions. [2018-12-09 11:13:22,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:22,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-09 11:13:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:22,306 INFO L225 Difference]: With dead ends: 130060 [2018-12-09 11:13:22,306 INFO L226 Difference]: Without dead ends: 73738 [2018-12-09 11:13:22,326 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-12-09 11:13:22,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2018-12-09 11:13:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2018-12-09 11:13:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2018-12-09 11:13:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2018-12-09 11:13:23,185 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2018-12-09 11:13:23,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:23,185 INFO L480 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2018-12-09 11:13:23,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:23,185 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2018-12-09 11:13:23,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 11:13:23,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:23,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:23,208 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:23,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:23,208 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2018-12-09 11:13:23,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:23,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:23,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:23,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:23,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:23,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:23,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:23,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:23,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:23,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:23,231 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2018-12-09 11:13:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:23,990 INFO L93 Difference]: Finished difference Result 110604 states and 136200 transitions. [2018-12-09 11:13:23,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:23,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-09 11:13:23,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:24,039 INFO L225 Difference]: With dead ends: 110604 [2018-12-09 11:13:24,040 INFO L226 Difference]: Without dead ends: 74762 [2018-12-09 11:13:24,057 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-12-09 11:13:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2018-12-09 11:13:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2018-12-09 11:13:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2018-12-09 11:13:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2018-12-09 11:13:24,943 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2018-12-09 11:13:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:24,943 INFO L480 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2018-12-09 11:13:24,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2018-12-09 11:13:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 11:13:24,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:24,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:24,966 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:24,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:24,966 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2018-12-09 11:13:24,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:24,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:24,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:24,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:24,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:24,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:24,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:24,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:24,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:24,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:24,977 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2018-12-09 11:13:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:26,063 INFO L93 Difference]: Finished difference Result 122892 states and 150536 transitions. [2018-12-09 11:13:26,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:26,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-09 11:13:26,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:26,151 INFO L225 Difference]: With dead ends: 122892 [2018-12-09 11:13:26,151 INFO L226 Difference]: Without dead ends: 122890 [2018-12-09 11:13:26,166 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-12-09 11:13:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2018-12-09 11:13:27,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2018-12-09 11:13:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2018-12-09 11:13:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2018-12-09 11:13:27,385 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2018-12-09 11:13:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:27,385 INFO L480 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2018-12-09 11:13:27,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2018-12-09 11:13:27,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 11:13:27,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:27,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:27,433 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:27,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:27,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2018-12-09 11:13:27,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:27,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:27,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:27,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:27,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:27,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:27,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:27,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:27,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:27,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:27,443 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2018-12-09 11:13:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:28,906 INFO L93 Difference]: Finished difference Result 258060 states and 304136 transitions. [2018-12-09 11:13:28,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:28,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-09 11:13:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:29,003 INFO L225 Difference]: With dead ends: 258060 [2018-12-09 11:13:29,003 INFO L226 Difference]: Without dead ends: 145418 [2018-12-09 11:13:29,062 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-12-09 11:13:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2018-12-09 11:13:31,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2018-12-09 11:13:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2018-12-09 11:13:31,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2018-12-09 11:13:31,925 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2018-12-09 11:13:31,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:31,925 INFO L480 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2018-12-09 11:13:31,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2018-12-09 11:13:31,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 11:13:31,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:31,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:31,976 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:31,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:31,976 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2018-12-09 11:13:31,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:31,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:31,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:31,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:31,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:31,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:31,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:31,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:31,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:31,987 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2018-12-09 11:13:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:33,236 INFO L93 Difference]: Finished difference Result 218124 states and 250888 transitions. [2018-12-09 11:13:33,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:33,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-09 11:13:33,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:33,353 INFO L225 Difference]: With dead ends: 218124 [2018-12-09 11:13:33,354 INFO L226 Difference]: Without dead ends: 147466 [2018-12-09 11:13:33,416 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-12-09 11:13:33,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2018-12-09 11:13:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 147464. [2018-12-09 11:13:35,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147464 states. [2018-12-09 11:13:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147464 states to 147464 states and 167942 transitions. [2018-12-09 11:13:35,565 INFO L78 Accepts]: Start accepts. Automaton has 147464 states and 167942 transitions. Word has length 35 [2018-12-09 11:13:35,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:35,565 INFO L480 AbstractCegarLoop]: Abstraction has 147464 states and 167942 transitions. [2018-12-09 11:13:35,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 147464 states and 167942 transitions. [2018-12-09 11:13:35,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 11:13:35,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:35,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:35,615 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:35,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:35,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1504278924, now seen corresponding path program 1 times [2018-12-09 11:13:35,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:35,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:35,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:35,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:35,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:35,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:35,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:35,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:35,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:35,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:35,628 INFO L87 Difference]: Start difference. First operand 147464 states and 167942 transitions. Second operand 3 states. [2018-12-09 11:13:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:37,729 INFO L93 Difference]: Finished difference Result 237578 states and 268295 transitions. [2018-12-09 11:13:37,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:37,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-09 11:13:37,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:37,931 INFO L225 Difference]: With dead ends: 237578 [2018-12-09 11:13:37,931 INFO L226 Difference]: Without dead ends: 237576 [2018-12-09 11:13:37,975 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-12-09 11:13:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237576 states. [2018-12-09 11:13:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237576 to 229384. [2018-12-09 11:13:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229384 states. [2018-12-09 11:13:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229384 states to 229384 states and 256006 transitions. [2018-12-09 11:13:40,778 INFO L78 Accepts]: Start accepts. Automaton has 229384 states and 256006 transitions. Word has length 35 [2018-12-09 11:13:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:40,778 INFO L480 AbstractCegarLoop]: Abstraction has 229384 states and 256006 transitions. [2018-12-09 11:13:40,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand 229384 states and 256006 transitions. [2018-12-09 11:13:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 11:13:40,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:13:40,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:13:40,891 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:13:40,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:13:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1769620018, now seen corresponding path program 1 times [2018-12-09 11:13:40,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:13:40,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:13:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:40,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:13:40,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:13:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:13:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:13:40,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:13:40,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:13:40,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:13:40,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:13:40,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:13:40,905 INFO L87 Difference]: Start difference. First operand 229384 states and 256006 transitions. Second operand 3 states. [2018-12-09 11:13:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:13:43,824 INFO L93 Difference]: Finished difference Result 512008 states and 563206 transitions. [2018-12-09 11:13:43,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:13:43,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-09 11:13:43,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:13:43,824 INFO L225 Difference]: With dead ends: 512008 [2018-12-09 11:13:43,824 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 11:13:44,012 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-12-09 11:13:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 11:13:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 11:13:44,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 11:13:44,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 11:13:44,012 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-12-09 11:13:44,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:13:44,013 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 11:13:44,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:13:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 11:13:44,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 11:13:44,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 11:13:44,049 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 11:13:44,049 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 11:13:44,049 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 11:13:44,049 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 11:13:44,049 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 11:13:44,049 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 11:13:44,049 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2018-12-09 11:13:44,049 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-09 11:13:44,049 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,049 INFO L451 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2018-12-09 11:13:44,049 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,049 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,049 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-09 11:13:44,049 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-12-09 11:13:44,050 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L451 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L444 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,051 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,052 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2018-12-09 11:13:44,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:13:44 BoogieIcfgContainer [2018-12-09 11:13:44,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 11:13:44,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:13:44,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:13:44,057 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:13:44,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:13:14" (3/4) ... [2018-12-09 11:13:44,060 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 11:13:44,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 11:13:44,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 11:13:44,069 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 11:13:44,069 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 11:13:44,069 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 11:13:44,106 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3d87b17c-0642-4521-a035-e4652e7213d0/bin-2019/uautomizer/witness.graphml [2018-12-09 11:13:44,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:13:44,106 INFO L168 Benchmark]: Toolchain (without parser) took 29840.27 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 961.4 MB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-12-09 11:13:44,107 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:13:44,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.75 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:13:44,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.28 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 11:13:44,108 INFO L168 Benchmark]: Boogie Preprocessor took 44.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -139.2 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-09 11:13:44,108 INFO L168 Benchmark]: RCFGBuilder took 197.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2018-12-09 11:13:44,108 INFO L168 Benchmark]: TraceAbstraction took 29397.70 ms. Allocated memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-12-09 11:13:44,108 INFO L168 Benchmark]: Witness Printer took 49.54 ms. Allocated memory is still 5.4 GB. Free memory is still 2.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:13:44,109 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 135.75 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 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 12.28 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.8 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -139.2 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 197.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29397.70 ms. Allocated memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 49.54 ms. Allocated memory is still 5.4 GB. Free memory is still 2.8 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 1 error locations. SAFE Result, 29.3s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 14.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4001 SDtfs, 1984 SDslu, 2752 SDs, 0 SdLazy, 197 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229384occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 13.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 32808 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 8202 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 1077 NumberOfCodeBlocks, 1077 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 61562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...