./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_15_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_13521cec-af7d-4256-ba28-894c7a2c63c7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_13521cec-af7d-4256-ba28-894c7a2c63c7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_13521cec-af7d-4256-ba28-894c7a2c63c7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_13521cec-af7d-4256-ba28-894c7a2c63c7/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_13521cec-af7d-4256-ba28-894c7a2c63c7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_13521cec-af7d-4256-ba28-894c7a2c63c7/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 129b0578c0c64625cef50fbcfd5d128651ff3275 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 15:00:06,563 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 15:00:06,564 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 15:00:06,570 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 15:00:06,570 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 15:00:06,570 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 15:00:06,571 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 15:00:06,572 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 15:00:06,572 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 15:00:06,573 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 15:00:06,573 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 15:00:06,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 15:00:06,574 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 15:00:06,574 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 15:00:06,575 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 15:00:06,575 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 15:00:06,576 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 15:00:06,576 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 15:00:06,577 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 15:00:06,578 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 15:00:06,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 15:00:06,579 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 15:00:06,580 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 15:00:06,580 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 15:00:06,581 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 15:00:06,581 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 15:00:06,581 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 15:00:06,582 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 15:00:06,582 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 15:00:06,583 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 15:00:06,583 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 15:00:06,583 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 15:00:06,583 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 15:00:06,583 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 15:00:06,584 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 15:00:06,584 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 15:00:06,584 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_13521cec-af7d-4256-ba28-894c7a2c63c7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 15:00:06,591 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 15:00:06,591 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 15:00:06,592 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 15:00:06,592 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 15:00:06,592 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 15:00:06,592 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 15:00:06,593 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 15:00:06,593 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 15:00:06,593 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 15:00:06,593 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 15:00:06,593 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 15:00:06,593 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 15:00:06,593 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 15:00:06,593 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 15:00:06,593 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 15:00:06,593 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 15:00:06,594 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 15:00:06,594 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 15:00:06,594 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 15:00:06,594 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 15:00:06,594 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 15:00:06,594 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 15:00:06,594 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 15:00:06,594 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 15:00:06,594 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 15:00:06,594 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 15:00:06,594 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 15:00:06,595 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 15:00:06,595 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 15:00:06,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 15:00:06,595 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_13521cec-af7d-4256-ba28-894c7a2c63c7/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 -> 129b0578c0c64625cef50fbcfd5d128651ff3275 [2018-12-01 15:00:06,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 15:00:06,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 15:00:06,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 15:00:06,623 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 15:00:06,623 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 15:00:06,623 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_13521cec-af7d-4256-ba28-894c7a2c63c7/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 15:00:06,665 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_13521cec-af7d-4256-ba28-894c7a2c63c7/bin-2019/uautomizer/data/bc16a6137/9444a3f0db6c4697a3142d2eee223d4c/FLAGe7721e0a8 [2018-12-01 15:00:07,076 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 15:00:07,076 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_13521cec-af7d-4256-ba28-894c7a2c63c7/sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 15:00:07,081 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_13521cec-af7d-4256-ba28-894c7a2c63c7/bin-2019/uautomizer/data/bc16a6137/9444a3f0db6c4697a3142d2eee223d4c/FLAGe7721e0a8 [2018-12-01 15:00:07,089 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_13521cec-af7d-4256-ba28-894c7a2c63c7/bin-2019/uautomizer/data/bc16a6137/9444a3f0db6c4697a3142d2eee223d4c [2018-12-01 15:00:07,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 15:00:07,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 15:00:07,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 15:00:07,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 15:00:07,094 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 15:00:07,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:00:07" (1/1) ... [2018-12-01 15:00:07,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27d92faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:00:07, skipping insertion in model container [2018-12-01 15:00:07,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:00:07" (1/1) ... [2018-12-01 15:00:07,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 15:00:07,113 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 15:00:07,204 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:00:07,206 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 15:00:07,223 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:00:07,231 INFO L195 MainTranslator]: Completed translation [2018-12-01 15:00:07,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:00:07 WrapperNode [2018-12-01 15:00:07,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 15:00:07,232 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 15:00:07,232 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 15:00:07,232 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 15:00:07,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:00:07" (1/1) ... [2018-12-01 15:00:07,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:00:07" (1/1) ... [2018-12-01 15:00:07,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 15:00:07,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 15:00:07,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 15:00:07,244 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 15:00:07,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:00:07" (1/1) ... [2018-12-01 15:00:07,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:00:07" (1/1) ... [2018-12-01 15:00:07,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:00:07" (1/1) ... [2018-12-01 15:00:07,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:00:07" (1/1) ... [2018-12-01 15:00:07,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:00:07" (1/1) ... [2018-12-01 15:00:07,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:00:07" (1/1) ... [2018-12-01 15:00:07,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:00:07" (1/1) ... [2018-12-01 15:00:07,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 15:00:07,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 15:00:07,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 15:00:07,290 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 15:00:07,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:00:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_13521cec-af7d-4256-ba28-894c7a2c63c7/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-01 15:00:07,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 15:00:07,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 15:00:07,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 15:00:07,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 15:00:07,322 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 15:00:07,322 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 15:00:07,501 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 15:00:07,501 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-01 15:00:07,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:00:07 BoogieIcfgContainer [2018-12-01 15:00:07,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 15:00:07,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 15:00:07,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 15:00:07,504 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 15:00:07,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:00:07" (1/3) ... [2018-12-01 15:00:07,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7570a7ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:00:07, skipping insertion in model container [2018-12-01 15:00:07,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:00:07" (2/3) ... [2018-12-01 15:00:07,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7570a7ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:00:07, skipping insertion in model container [2018-12-01 15:00:07,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:00:07" (3/3) ... [2018-12-01 15:00:07,507 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 15:00:07,513 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 15:00:07,518 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 15:00:07,527 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 15:00:07,546 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 15:00:07,546 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 15:00:07,547 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 15:00:07,547 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 15:00:07,547 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 15:00:07,547 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 15:00:07,547 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 15:00:07,547 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 15:00:07,547 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 15:00:07,558 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-12-01 15:00:07,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 15:00:07,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:07,562 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-01 15:00:07,563 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:07,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:07,566 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2018-12-01 15:00:07,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:07,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:07,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:07,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:07,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:07,678 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-01 15:00:07,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:07,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:07,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:07,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:07,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:07,691 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-12-01 15:00:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:07,727 INFO L93 Difference]: Finished difference Result 117 states and 210 transitions. [2018-12-01 15:00:07,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:07,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-01 15:00:07,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:07,735 INFO L225 Difference]: With dead ends: 117 [2018-12-01 15:00:07,735 INFO L226 Difference]: Without dead ends: 102 [2018-12-01 15:00:07,737 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-01 15:00:07,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-01 15:00:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2018-12-01 15:00:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-01 15:00:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 129 transitions. [2018-12-01 15:00:07,762 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 129 transitions. Word has length 25 [2018-12-01 15:00:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:07,762 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 129 transitions. [2018-12-01 15:00:07,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:07,763 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions. [2018-12-01 15:00:07,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 15:00:07,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:07,763 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-01 15:00:07,763 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:07,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:07,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2018-12-01 15:00:07,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:07,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:07,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:07,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:07,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:07,799 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-01 15:00:07,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:07,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:07,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:07,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:07,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:07,801 INFO L87 Difference]: Start difference. First operand 70 states and 129 transitions. Second operand 3 states. [2018-12-01 15:00:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:07,815 INFO L93 Difference]: Finished difference Result 167 states and 312 transitions. [2018-12-01 15:00:07,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:07,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-01 15:00:07,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:07,816 INFO L225 Difference]: With dead ends: 167 [2018-12-01 15:00:07,816 INFO L226 Difference]: Without dead ends: 102 [2018-12-01 15:00:07,817 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-01 15:00:07,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-01 15:00:07,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-12-01 15:00:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-01 15:00:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2018-12-01 15:00:07,822 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 25 [2018-12-01 15:00:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:07,823 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2018-12-01 15:00:07,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2018-12-01 15:00:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 15:00:07,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:07,823 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-01 15:00:07,823 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:07,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:07,824 INFO L82 PathProgramCache]: Analyzing trace with hash -284082342, now seen corresponding path program 1 times [2018-12-01 15:00:07,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:07,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:07,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:07,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:07,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:07,849 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-01 15:00:07,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:07,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:07,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:07,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:07,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:07,850 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 3 states. [2018-12-01 15:00:07,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:07,863 INFO L93 Difference]: Finished difference Result 153 states and 279 transitions. [2018-12-01 15:00:07,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:07,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-01 15:00:07,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:07,864 INFO L225 Difference]: With dead ends: 153 [2018-12-01 15:00:07,864 INFO L226 Difference]: Without dead ends: 105 [2018-12-01 15:00:07,865 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-01 15:00:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-01 15:00:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-12-01 15:00:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-01 15:00:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2018-12-01 15:00:07,872 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 26 [2018-12-01 15:00:07,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:07,872 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2018-12-01 15:00:07,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:07,873 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2018-12-01 15:00:07,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 15:00:07,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:07,873 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-01 15:00:07,873 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:07,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:07,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1973026084, now seen corresponding path program 1 times [2018-12-01 15:00:07,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:07,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:07,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:07,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:07,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:07,900 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-01 15:00:07,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:07,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:07,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:07,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:07,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:07,902 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 3 states. [2018-12-01 15:00:07,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:07,917 INFO L93 Difference]: Finished difference Result 196 states and 360 transitions. [2018-12-01 15:00:07,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:07,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-01 15:00:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:07,918 INFO L225 Difference]: With dead ends: 196 [2018-12-01 15:00:07,918 INFO L226 Difference]: Without dead ends: 194 [2018-12-01 15:00:07,919 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-01 15:00:07,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-01 15:00:07,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2018-12-01 15:00:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-01 15:00:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 248 transitions. [2018-12-01 15:00:07,927 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 248 transitions. Word has length 26 [2018-12-01 15:00:07,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:07,927 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 248 transitions. [2018-12-01 15:00:07,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 248 transitions. [2018-12-01 15:00:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 15:00:07,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:07,928 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-01 15:00:07,928 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:07,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:07,928 INFO L82 PathProgramCache]: Analyzing trace with hash 327796506, now seen corresponding path program 1 times [2018-12-01 15:00:07,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:07,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:07,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:07,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:07,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:07,952 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-01 15:00:07,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:07,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:07,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:07,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:07,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:07,953 INFO L87 Difference]: Start difference. First operand 136 states and 248 transitions. Second operand 3 states. [2018-12-01 15:00:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:07,966 INFO L93 Difference]: Finished difference Result 324 states and 598 transitions. [2018-12-01 15:00:07,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:07,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-01 15:00:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:07,968 INFO L225 Difference]: With dead ends: 324 [2018-12-01 15:00:07,968 INFO L226 Difference]: Without dead ends: 196 [2018-12-01 15:00:07,969 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-01 15:00:07,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-01 15:00:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-12-01 15:00:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-01 15:00:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 354 transitions. [2018-12-01 15:00:07,976 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 354 transitions. Word has length 26 [2018-12-01 15:00:07,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:07,976 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 354 transitions. [2018-12-01 15:00:07,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 354 transitions. [2018-12-01 15:00:07,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 15:00:07,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:07,977 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-01 15:00:07,977 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:07,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:07,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1034054359, now seen corresponding path program 1 times [2018-12-01 15:00:07,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:07,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:07,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:07,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:07,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:08,000 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-01 15:00:08,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:08,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:08,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:08,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:08,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,001 INFO L87 Difference]: Start difference. First operand 194 states and 354 transitions. Second operand 3 states. [2018-12-01 15:00:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:08,015 INFO L93 Difference]: Finished difference Result 291 states and 529 transitions. [2018-12-01 15:00:08,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:08,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 15:00:08,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:08,016 INFO L225 Difference]: With dead ends: 291 [2018-12-01 15:00:08,016 INFO L226 Difference]: Without dead ends: 198 [2018-12-01 15:00:08,017 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-01 15:00:08,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-01 15:00:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-12-01 15:00:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-01 15:00:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 354 transitions. [2018-12-01 15:00:08,024 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 354 transitions. Word has length 27 [2018-12-01 15:00:08,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:08,024 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 354 transitions. [2018-12-01 15:00:08,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 354 transitions. [2018-12-01 15:00:08,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 15:00:08,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:08,026 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-01 15:00:08,026 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:08,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:08,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1571969195, now seen corresponding path program 1 times [2018-12-01 15:00:08,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:08,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:08,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:08,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:08,048 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-01 15:00:08,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:08,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:08,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:08,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:08,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,049 INFO L87 Difference]: Start difference. First operand 196 states and 354 transitions. Second operand 3 states. [2018-12-01 15:00:08,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:08,064 INFO L93 Difference]: Finished difference Result 372 states and 680 transitions. [2018-12-01 15:00:08,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:08,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 15:00:08,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:08,066 INFO L225 Difference]: With dead ends: 372 [2018-12-01 15:00:08,066 INFO L226 Difference]: Without dead ends: 370 [2018-12-01 15:00:08,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-12-01 15:00:08,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 264. [2018-12-01 15:00:08,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-01 15:00:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 474 transitions. [2018-12-01 15:00:08,073 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 474 transitions. Word has length 27 [2018-12-01 15:00:08,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:08,073 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 474 transitions. [2018-12-01 15:00:08,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 474 transitions. [2018-12-01 15:00:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 15:00:08,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:08,075 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-01 15:00:08,075 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:08,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:08,075 INFO L82 PathProgramCache]: Analyzing trace with hash -422175511, now seen corresponding path program 1 times [2018-12-01 15:00:08,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:08,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:08,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:08,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:00:08,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:08,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:08,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:08,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:08,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,093 INFO L87 Difference]: Start difference. First operand 264 states and 474 transitions. Second operand 3 states. [2018-12-01 15:00:08,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:08,108 INFO L93 Difference]: Finished difference Result 632 states and 1144 transitions. [2018-12-01 15:00:08,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:08,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 15:00:08,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:08,109 INFO L225 Difference]: With dead ends: 632 [2018-12-01 15:00:08,110 INFO L226 Difference]: Without dead ends: 378 [2018-12-01 15:00:08,110 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-01 15:00:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-12-01 15:00:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2018-12-01 15:00:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-12-01 15:00:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 674 transitions. [2018-12-01 15:00:08,121 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 674 transitions. Word has length 27 [2018-12-01 15:00:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:08,121 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 674 transitions. [2018-12-01 15:00:08,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 674 transitions. [2018-12-01 15:00:08,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 15:00:08,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:08,122 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-01 15:00:08,122 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:08,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:08,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1486617231, now seen corresponding path program 1 times [2018-12-01 15:00:08,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:08,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:08,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:08,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:08,140 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-01 15:00:08,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:08,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:08,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:08,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:08,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,141 INFO L87 Difference]: Start difference. First operand 376 states and 674 transitions. Second operand 3 states. [2018-12-01 15:00:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:08,153 INFO L93 Difference]: Finished difference Result 564 states and 1008 transitions. [2018-12-01 15:00:08,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:08,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-01 15:00:08,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:08,155 INFO L225 Difference]: With dead ends: 564 [2018-12-01 15:00:08,155 INFO L226 Difference]: Without dead ends: 382 [2018-12-01 15:00:08,156 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-01 15:00:08,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-12-01 15:00:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2018-12-01 15:00:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-12-01 15:00:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 674 transitions. [2018-12-01 15:00:08,168 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 674 transitions. Word has length 28 [2018-12-01 15:00:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:08,168 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 674 transitions. [2018-12-01 15:00:08,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 674 transitions. [2018-12-01 15:00:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 15:00:08,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:08,169 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-01 15:00:08,170 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:08,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:08,170 INFO L82 PathProgramCache]: Analyzing trace with hash -202326511, now seen corresponding path program 1 times [2018-12-01 15:00:08,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:08,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:08,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:08,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:08,190 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-01 15:00:08,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:08,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:08,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:08,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:08,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,191 INFO L87 Difference]: Start difference. First operand 380 states and 674 transitions. Second operand 3 states. [2018-12-01 15:00:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:08,208 INFO L93 Difference]: Finished difference Result 716 states and 1288 transitions. [2018-12-01 15:00:08,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:08,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-01 15:00:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:08,211 INFO L225 Difference]: With dead ends: 716 [2018-12-01 15:00:08,211 INFO L226 Difference]: Without dead ends: 714 [2018-12-01 15:00:08,211 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-01 15:00:08,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-12-01 15:00:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 520. [2018-12-01 15:00:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-01 15:00:08,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 910 transitions. [2018-12-01 15:00:08,226 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 910 transitions. Word has length 28 [2018-12-01 15:00:08,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:08,227 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 910 transitions. [2018-12-01 15:00:08,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:08,227 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 910 transitions. [2018-12-01 15:00:08,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 15:00:08,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:08,228 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-01 15:00:08,228 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:08,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:08,229 INFO L82 PathProgramCache]: Analyzing trace with hash 2098496079, now seen corresponding path program 1 times [2018-12-01 15:00:08,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:08,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:08,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:08,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:08,249 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-01 15:00:08,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:08,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:08,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:08,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:08,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,250 INFO L87 Difference]: Start difference. First operand 520 states and 910 transitions. Second operand 3 states. [2018-12-01 15:00:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:08,276 INFO L93 Difference]: Finished difference Result 1244 states and 2192 transitions. [2018-12-01 15:00:08,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:08,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-01 15:00:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:08,279 INFO L225 Difference]: With dead ends: 1244 [2018-12-01 15:00:08,279 INFO L226 Difference]: Without dead ends: 738 [2018-12-01 15:00:08,280 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-01 15:00:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-12-01 15:00:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2018-12-01 15:00:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-01 15:00:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1286 transitions. [2018-12-01 15:00:08,296 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1286 transitions. Word has length 28 [2018-12-01 15:00:08,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:08,296 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 1286 transitions. [2018-12-01 15:00:08,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:08,296 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1286 transitions. [2018-12-01 15:00:08,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 15:00:08,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:08,297 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-01 15:00:08,297 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:08,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:08,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1976941762, now seen corresponding path program 1 times [2018-12-01 15:00:08,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:08,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:08,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:08,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:08,320 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-01 15:00:08,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:08,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:08,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:08,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:08,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,321 INFO L87 Difference]: Start difference. First operand 736 states and 1286 transitions. Second operand 3 states. [2018-12-01 15:00:08,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:08,336 INFO L93 Difference]: Finished difference Result 1104 states and 1924 transitions. [2018-12-01 15:00:08,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:08,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 15:00:08,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:08,338 INFO L225 Difference]: With dead ends: 1104 [2018-12-01 15:00:08,338 INFO L226 Difference]: Without dead ends: 746 [2018-12-01 15:00:08,338 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-01 15:00:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-12-01 15:00:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-12-01 15:00:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-12-01 15:00:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1286 transitions. [2018-12-01 15:00:08,351 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1286 transitions. Word has length 29 [2018-12-01 15:00:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:08,351 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1286 transitions. [2018-12-01 15:00:08,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1286 transitions. [2018-12-01 15:00:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 15:00:08,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:08,352 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-01 15:00:08,352 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:08,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:08,352 INFO L82 PathProgramCache]: Analyzing trace with hash 629081792, now seen corresponding path program 1 times [2018-12-01 15:00:08,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:08,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:08,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:08,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:08,369 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-01 15:00:08,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:08,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:08,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:08,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:08,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,370 INFO L87 Difference]: Start difference. First operand 744 states and 1286 transitions. Second operand 3 states. [2018-12-01 15:00:08,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:08,387 INFO L93 Difference]: Finished difference Result 1388 states and 2440 transitions. [2018-12-01 15:00:08,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:08,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 15:00:08,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:08,392 INFO L225 Difference]: With dead ends: 1388 [2018-12-01 15:00:08,392 INFO L226 Difference]: Without dead ends: 1386 [2018-12-01 15:00:08,392 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-01 15:00:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2018-12-01 15:00:08,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1032. [2018-12-01 15:00:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-12-01 15:00:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1750 transitions. [2018-12-01 15:00:08,412 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1750 transitions. Word has length 29 [2018-12-01 15:00:08,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:08,413 INFO L480 AbstractCegarLoop]: Abstraction has 1032 states and 1750 transitions. [2018-12-01 15:00:08,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:08,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1750 transitions. [2018-12-01 15:00:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 15:00:08,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:08,414 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-01 15:00:08,414 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:08,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:08,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1365062914, now seen corresponding path program 1 times [2018-12-01 15:00:08,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:08,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:08,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:08,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:08,432 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-01 15:00:08,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:08,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:08,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:08,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:08,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,433 INFO L87 Difference]: Start difference. First operand 1032 states and 1750 transitions. Second operand 3 states. [2018-12-01 15:00:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:08,461 INFO L93 Difference]: Finished difference Result 2460 states and 4200 transitions. [2018-12-01 15:00:08,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:08,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 15:00:08,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:08,466 INFO L225 Difference]: With dead ends: 2460 [2018-12-01 15:00:08,466 INFO L226 Difference]: Without dead ends: 1450 [2018-12-01 15:00:08,468 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-01 15:00:08,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2018-12-01 15:00:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1448. [2018-12-01 15:00:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2018-12-01 15:00:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2454 transitions. [2018-12-01 15:00:08,507 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2454 transitions. Word has length 29 [2018-12-01 15:00:08,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:08,508 INFO L480 AbstractCegarLoop]: Abstraction has 1448 states and 2454 transitions. [2018-12-01 15:00:08,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2454 transitions. [2018-12-01 15:00:08,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 15:00:08,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:08,509 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-01 15:00:08,509 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:08,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:08,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1973087804, now seen corresponding path program 1 times [2018-12-01 15:00:08,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:08,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:08,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:08,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:08,524 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-01 15:00:08,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:08,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:08,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:08,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:08,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,525 INFO L87 Difference]: Start difference. First operand 1448 states and 2454 transitions. Second operand 3 states. [2018-12-01 15:00:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:08,548 INFO L93 Difference]: Finished difference Result 2172 states and 3672 transitions. [2018-12-01 15:00:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:08,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-01 15:00:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:08,551 INFO L225 Difference]: With dead ends: 2172 [2018-12-01 15:00:08,551 INFO L226 Difference]: Without dead ends: 1466 [2018-12-01 15:00:08,552 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-01 15:00:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-12-01 15:00:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1464. [2018-12-01 15:00:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2018-12-01 15:00:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2454 transitions. [2018-12-01 15:00:08,592 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2454 transitions. Word has length 30 [2018-12-01 15:00:08,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:08,593 INFO L480 AbstractCegarLoop]: Abstraction has 1464 states and 2454 transitions. [2018-12-01 15:00:08,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2454 transitions. [2018-12-01 15:00:08,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 15:00:08,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:08,594 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-01 15:00:08,594 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:08,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:08,594 INFO L82 PathProgramCache]: Analyzing trace with hash 632935750, now seen corresponding path program 1 times [2018-12-01 15:00:08,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:08,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:08,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:08,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:08,607 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-01 15:00:08,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:08,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:08,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:08,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:08,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,608 INFO L87 Difference]: Start difference. First operand 1464 states and 2454 transitions. Second operand 3 states. [2018-12-01 15:00:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:08,631 INFO L93 Difference]: Finished difference Result 2700 states and 4616 transitions. [2018-12-01 15:00:08,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:08,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-01 15:00:08,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:08,636 INFO L225 Difference]: With dead ends: 2700 [2018-12-01 15:00:08,636 INFO L226 Difference]: Without dead ends: 2698 [2018-12-01 15:00:08,637 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-01 15:00:08,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-12-01 15:00:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2056. [2018-12-01 15:00:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2018-12-01 15:00:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3366 transitions. [2018-12-01 15:00:08,668 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3366 transitions. Word has length 30 [2018-12-01 15:00:08,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:08,668 INFO L480 AbstractCegarLoop]: Abstraction has 2056 states and 3366 transitions. [2018-12-01 15:00:08,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:08,668 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3366 transitions. [2018-12-01 15:00:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 15:00:08,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:08,669 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-01 15:00:08,669 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:08,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:08,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1361208956, now seen corresponding path program 1 times [2018-12-01 15:00:08,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:08,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:08,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:08,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:08,679 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-01 15:00:08,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:08,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:08,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:08,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:08,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,679 INFO L87 Difference]: Start difference. First operand 2056 states and 3366 transitions. Second operand 3 states. [2018-12-01 15:00:08,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:08,714 INFO L93 Difference]: Finished difference Result 4876 states and 8040 transitions. [2018-12-01 15:00:08,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:08,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-01 15:00:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:08,718 INFO L225 Difference]: With dead ends: 4876 [2018-12-01 15:00:08,718 INFO L226 Difference]: Without dead ends: 2858 [2018-12-01 15:00:08,720 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-01 15:00:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2018-12-01 15:00:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2856. [2018-12-01 15:00:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2018-12-01 15:00:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4678 transitions. [2018-12-01 15:00:08,763 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4678 transitions. Word has length 30 [2018-12-01 15:00:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:08,763 INFO L480 AbstractCegarLoop]: Abstraction has 2856 states and 4678 transitions. [2018-12-01 15:00:08,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4678 transitions. [2018-12-01 15:00:08,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 15:00:08,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:08,765 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-01 15:00:08,765 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:08,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:08,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1853614765, now seen corresponding path program 1 times [2018-12-01 15:00:08,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:08,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:08,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:08,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:08,774 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-01 15:00:08,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:08,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:08,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:08,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:08,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,775 INFO L87 Difference]: Start difference. First operand 2856 states and 4678 transitions. Second operand 3 states. [2018-12-01 15:00:08,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:08,807 INFO L93 Difference]: Finished difference Result 4284 states and 7000 transitions. [2018-12-01 15:00:08,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:08,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-01 15:00:08,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:08,812 INFO L225 Difference]: With dead ends: 4284 [2018-12-01 15:00:08,812 INFO L226 Difference]: Without dead ends: 2890 [2018-12-01 15:00:08,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2018-12-01 15:00:08,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2018-12-01 15:00:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2018-12-01 15:00:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4678 transitions. [2018-12-01 15:00:08,855 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4678 transitions. Word has length 31 [2018-12-01 15:00:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:08,855 INFO L480 AbstractCegarLoop]: Abstraction has 2888 states and 4678 transitions. [2018-12-01 15:00:08,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:08,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4678 transitions. [2018-12-01 15:00:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 15:00:08,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:08,857 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-01 15:00:08,857 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:08,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:08,857 INFO L82 PathProgramCache]: Analyzing trace with hash 752408789, now seen corresponding path program 1 times [2018-12-01 15:00:08,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:08,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:08,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:08,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:08,867 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-01 15:00:08,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:08,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:08,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:08,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:08,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:08,868 INFO L87 Difference]: Start difference. First operand 2888 states and 4678 transitions. Second operand 3 states. [2018-12-01 15:00:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:08,909 INFO L93 Difference]: Finished difference Result 5260 states and 8712 transitions. [2018-12-01 15:00:08,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:08,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-01 15:00:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:08,918 INFO L225 Difference]: With dead ends: 5260 [2018-12-01 15:00:08,919 INFO L226 Difference]: Without dead ends: 5258 [2018-12-01 15:00:08,920 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-01 15:00:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-12-01 15:00:08,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 4104. [2018-12-01 15:00:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-12-01 15:00:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 6470 transitions. [2018-12-01 15:00:08,981 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 6470 transitions. Word has length 31 [2018-12-01 15:00:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:08,982 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 6470 transitions. [2018-12-01 15:00:08,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 6470 transitions. [2018-12-01 15:00:08,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 15:00:08,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:08,984 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-01 15:00:08,984 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:08,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:08,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1241735917, now seen corresponding path program 1 times [2018-12-01 15:00:08,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:08,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:08,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:08,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:08,999 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-01 15:00:09,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:09,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:09,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:09,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:09,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:09,001 INFO L87 Difference]: Start difference. First operand 4104 states and 6470 transitions. Second operand 3 states. [2018-12-01 15:00:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:09,084 INFO L93 Difference]: Finished difference Result 9676 states and 15368 transitions. [2018-12-01 15:00:09,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:09,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-01 15:00:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:09,094 INFO L225 Difference]: With dead ends: 9676 [2018-12-01 15:00:09,094 INFO L226 Difference]: Without dead ends: 5642 [2018-12-01 15:00:09,098 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-01 15:00:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2018-12-01 15:00:09,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5640. [2018-12-01 15:00:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5640 states. [2018-12-01 15:00:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5640 states to 5640 states and 8902 transitions. [2018-12-01 15:00:09,181 INFO L78 Accepts]: Start accepts. Automaton has 5640 states and 8902 transitions. Word has length 31 [2018-12-01 15:00:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:09,182 INFO L480 AbstractCegarLoop]: Abstraction has 5640 states and 8902 transitions. [2018-12-01 15:00:09,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 5640 states and 8902 transitions. [2018-12-01 15:00:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 15:00:09,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:09,184 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-01 15:00:09,184 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:09,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:09,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1850049785, now seen corresponding path program 1 times [2018-12-01 15:00:09,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:09,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:09,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:09,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:09,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:09,194 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-01 15:00:09,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:09,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:09,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:09,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:09,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:09,194 INFO L87 Difference]: Start difference. First operand 5640 states and 8902 transitions. Second operand 3 states. [2018-12-01 15:00:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:09,270 INFO L93 Difference]: Finished difference Result 8460 states and 13320 transitions. [2018-12-01 15:00:09,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:09,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-01 15:00:09,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:09,280 INFO L225 Difference]: With dead ends: 8460 [2018-12-01 15:00:09,280 INFO L226 Difference]: Without dead ends: 5706 [2018-12-01 15:00:09,285 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-01 15:00:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2018-12-01 15:00:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5704. [2018-12-01 15:00:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2018-12-01 15:00:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 8902 transitions. [2018-12-01 15:00:09,356 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 8902 transitions. Word has length 32 [2018-12-01 15:00:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:09,356 INFO L480 AbstractCegarLoop]: Abstraction has 5704 states and 8902 transitions. [2018-12-01 15:00:09,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 8902 transitions. [2018-12-01 15:00:09,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 15:00:09,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:09,359 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-01 15:00:09,359 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:09,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:09,360 INFO L82 PathProgramCache]: Analyzing trace with hash 161106043, now seen corresponding path program 1 times [2018-12-01 15:00:09,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:09,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:09,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:09,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:09,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:09,373 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-01 15:00:09,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:09,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:09,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:09,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:09,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:09,374 INFO L87 Difference]: Start difference. First operand 5704 states and 8902 transitions. Second operand 3 states. [2018-12-01 15:00:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:09,460 INFO L93 Difference]: Finished difference Result 16716 states and 25928 transitions. [2018-12-01 15:00:09,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:09,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-01 15:00:09,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:09,472 INFO L225 Difference]: With dead ends: 16716 [2018-12-01 15:00:09,472 INFO L226 Difference]: Without dead ends: 11146 [2018-12-01 15:00:09,477 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-01 15:00:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-12-01 15:00:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 11144. [2018-12-01 15:00:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-12-01 15:00:09,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 17030 transitions. [2018-12-01 15:00:09,611 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 17030 transitions. Word has length 32 [2018-12-01 15:00:09,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:09,612 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 17030 transitions. [2018-12-01 15:00:09,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:09,612 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 17030 transitions. [2018-12-01 15:00:09,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 15:00:09,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:09,616 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-01 15:00:09,617 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:09,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:09,617 INFO L82 PathProgramCache]: Analyzing trace with hash -2139716547, now seen corresponding path program 1 times [2018-12-01 15:00:09,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:09,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:09,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:09,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:09,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:09,635 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-01 15:00:09,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:09,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:09,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:09,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:09,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:09,636 INFO L87 Difference]: Start difference. First operand 11144 states and 17030 transitions. Second operand 3 states. [2018-12-01 15:00:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:09,795 INFO L93 Difference]: Finished difference Result 13196 states and 20872 transitions. [2018-12-01 15:00:09,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:09,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-01 15:00:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:09,816 INFO L225 Difference]: With dead ends: 13196 [2018-12-01 15:00:09,816 INFO L226 Difference]: Without dead ends: 13194 [2018-12-01 15:00:09,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13194 states. [2018-12-01 15:00:09,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13194 to 11144. [2018-12-01 15:00:09,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-12-01 15:00:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 16902 transitions. [2018-12-01 15:00:09,943 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 16902 transitions. Word has length 32 [2018-12-01 15:00:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:09,943 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 16902 transitions. [2018-12-01 15:00:09,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 16902 transitions. [2018-12-01 15:00:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 15:00:09,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:09,947 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-01 15:00:09,947 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:09,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:09,947 INFO L82 PathProgramCache]: Analyzing trace with hash 699534184, now seen corresponding path program 1 times [2018-12-01 15:00:09,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:09,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:09,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:09,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:09,959 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-01 15:00:09,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:09,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:09,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:09,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:09,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:09,960 INFO L87 Difference]: Start difference. First operand 11144 states and 16902 transitions. Second operand 3 states. [2018-12-01 15:00:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:10,062 INFO L93 Difference]: Finished difference Result 19852 states and 30856 transitions. [2018-12-01 15:00:10,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:10,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-01 15:00:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:10,076 INFO L225 Difference]: With dead ends: 19852 [2018-12-01 15:00:10,077 INFO L226 Difference]: Without dead ends: 19850 [2018-12-01 15:00:10,080 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-01 15:00:10,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19850 states. [2018-12-01 15:00:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19850 to 16264. [2018-12-01 15:00:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16264 states. [2018-12-01 15:00:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16264 states to 16264 states and 23942 transitions. [2018-12-01 15:00:10,253 INFO L78 Accepts]: Start accepts. Automaton has 16264 states and 23942 transitions. Word has length 33 [2018-12-01 15:00:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:10,253 INFO L480 AbstractCegarLoop]: Abstraction has 16264 states and 23942 transitions. [2018-12-01 15:00:10,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 16264 states and 23942 transitions. [2018-12-01 15:00:10,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 15:00:10,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:10,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:00:10,260 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:10,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:10,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1294610522, now seen corresponding path program 1 times [2018-12-01 15:00:10,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:10,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:10,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:10,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:10,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:10,279 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-01 15:00:10,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:10,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:10,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:10,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:10,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:10,280 INFO L87 Difference]: Start difference. First operand 16264 states and 23942 transitions. Second operand 3 states. [2018-12-01 15:00:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:10,429 INFO L93 Difference]: Finished difference Result 38028 states and 56456 transitions. [2018-12-01 15:00:10,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:10,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-01 15:00:10,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:10,451 INFO L225 Difference]: With dead ends: 38028 [2018-12-01 15:00:10,451 INFO L226 Difference]: Without dead ends: 21898 [2018-12-01 15:00:10,464 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-01 15:00:10,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2018-12-01 15:00:10,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 21896. [2018-12-01 15:00:10,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21896 states. [2018-12-01 15:00:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21896 states to 21896 states and 32262 transitions. [2018-12-01 15:00:10,751 INFO L78 Accepts]: Start accepts. Automaton has 21896 states and 32262 transitions. Word has length 33 [2018-12-01 15:00:10,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:10,751 INFO L480 AbstractCegarLoop]: Abstraction has 21896 states and 32262 transitions. [2018-12-01 15:00:10,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 21896 states and 32262 transitions. [2018-12-01 15:00:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 15:00:10,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:10,760 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-01 15:00:10,760 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:10,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:10,760 INFO L82 PathProgramCache]: Analyzing trace with hash 210937712, now seen corresponding path program 1 times [2018-12-01 15:00:10,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:10,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:10,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:10,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:10,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:10,780 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-01 15:00:10,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:10,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:10,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:10,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:10,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:10,781 INFO L87 Difference]: Start difference. First operand 21896 states and 32262 transitions. Second operand 3 states. [2018-12-01 15:00:10,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:10,932 INFO L93 Difference]: Finished difference Result 33036 states and 48648 transitions. [2018-12-01 15:00:10,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:10,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-01 15:00:10,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:10,947 INFO L225 Difference]: With dead ends: 33036 [2018-12-01 15:00:10,947 INFO L226 Difference]: Without dead ends: 22282 [2018-12-01 15:00:10,956 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-01 15:00:10,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22282 states. [2018-12-01 15:00:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22282 to 22280. [2018-12-01 15:00:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22280 states. [2018-12-01 15:00:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 32518 transitions. [2018-12-01 15:00:11,181 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 32518 transitions. Word has length 34 [2018-12-01 15:00:11,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:11,181 INFO L480 AbstractCegarLoop]: Abstraction has 22280 states and 32518 transitions. [2018-12-01 15:00:11,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 32518 transitions. [2018-12-01 15:00:11,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 15:00:11,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:11,188 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-01 15:00:11,188 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:11,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:11,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1478006030, now seen corresponding path program 1 times [2018-12-01 15:00:11,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:11,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:11,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:11,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:11,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:11,207 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-01 15:00:11,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:11,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:11,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:11,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:11,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:11,208 INFO L87 Difference]: Start difference. First operand 22280 states and 32518 transitions. Second operand 3 states. [2018-12-01 15:00:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:11,448 INFO L93 Difference]: Finished difference Result 38924 states and 58120 transitions. [2018-12-01 15:00:11,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:11,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-01 15:00:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:11,469 INFO L225 Difference]: With dead ends: 38924 [2018-12-01 15:00:11,469 INFO L226 Difference]: Without dead ends: 38922 [2018-12-01 15:00:11,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38922 states. [2018-12-01 15:00:11,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38922 to 32776. [2018-12-01 15:00:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32776 states. [2018-12-01 15:00:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32776 states to 32776 states and 46342 transitions. [2018-12-01 15:00:11,809 INFO L78 Accepts]: Start accepts. Automaton has 32776 states and 46342 transitions. Word has length 34 [2018-12-01 15:00:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:11,810 INFO L480 AbstractCegarLoop]: Abstraction has 32776 states and 46342 transitions. [2018-12-01 15:00:11,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 32776 states and 46342 transitions. [2018-12-01 15:00:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 15:00:11,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:11,822 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-01 15:00:11,823 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:11,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:11,823 INFO L82 PathProgramCache]: Analyzing trace with hash 822816560, now seen corresponding path program 1 times [2018-12-01 15:00:11,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:11,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:11,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:11,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:11,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:11,847 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-01 15:00:11,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:11,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:11,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:11,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:11,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:11,848 INFO L87 Difference]: Start difference. First operand 32776 states and 46342 transitions. Second operand 3 states. [2018-12-01 15:00:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:12,176 INFO L93 Difference]: Finished difference Result 75788 states and 107784 transitions. [2018-12-01 15:00:12,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:12,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-01 15:00:12,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:12,209 INFO L225 Difference]: With dead ends: 75788 [2018-12-01 15:00:12,210 INFO L226 Difference]: Without dead ends: 43530 [2018-12-01 15:00:12,236 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-01 15:00:12,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43530 states. [2018-12-01 15:00:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43530 to 43528. [2018-12-01 15:00:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43528 states. [2018-12-01 15:00:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43528 states to 43528 states and 61446 transitions. [2018-12-01 15:00:12,749 INFO L78 Accepts]: Start accepts. Automaton has 43528 states and 61446 transitions. Word has length 34 [2018-12-01 15:00:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:12,749 INFO L480 AbstractCegarLoop]: Abstraction has 43528 states and 61446 transitions. [2018-12-01 15:00:12,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 43528 states and 61446 transitions. [2018-12-01 15:00:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 15:00:12,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:12,762 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-01 15:00:12,762 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:12,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:12,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1426668155, now seen corresponding path program 1 times [2018-12-01 15:00:12,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:12,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:12,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:12,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:12,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:12,775 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-01 15:00:12,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:12,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:12,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:12,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:12,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:12,776 INFO L87 Difference]: Start difference. First operand 43528 states and 61446 transitions. Second operand 3 states. [2018-12-01 15:00:13,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:13,077 INFO L93 Difference]: Finished difference Result 65292 states and 91912 transitions. [2018-12-01 15:00:13,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:13,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-01 15:00:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:13,183 INFO L225 Difference]: With dead ends: 65292 [2018-12-01 15:00:13,183 INFO L226 Difference]: Without dead ends: 44042 [2018-12-01 15:00:13,194 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-01 15:00:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44042 states. [2018-12-01 15:00:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44042 to 44040. [2018-12-01 15:00:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44040 states. [2018-12-01 15:00:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44040 states to 44040 states and 61446 transitions. [2018-12-01 15:00:13,655 INFO L78 Accepts]: Start accepts. Automaton has 44040 states and 61446 transitions. Word has length 35 [2018-12-01 15:00:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:13,655 INFO L480 AbstractCegarLoop]: Abstraction has 44040 states and 61446 transitions. [2018-12-01 15:00:13,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 44040 states and 61446 transitions. [2018-12-01 15:00:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 15:00:13,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:13,668 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-01 15:00:13,668 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:13,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:13,668 INFO L82 PathProgramCache]: Analyzing trace with hash -262275587, now seen corresponding path program 1 times [2018-12-01 15:00:13,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:13,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:13,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:13,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:13,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:13,695 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-01 15:00:13,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:13,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:13,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:13,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:13,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:13,696 INFO L87 Difference]: Start difference. First operand 44040 states and 61446 transitions. Second operand 3 states. [2018-12-01 15:00:14,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:14,189 INFO L93 Difference]: Finished difference Result 75788 states and 108040 transitions. [2018-12-01 15:00:14,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:14,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-01 15:00:14,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:14,347 INFO L225 Difference]: With dead ends: 75788 [2018-12-01 15:00:14,347 INFO L226 Difference]: Without dead ends: 75786 [2018-12-01 15:00:14,354 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-01 15:00:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75786 states. [2018-12-01 15:00:14,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75786 to 65544. [2018-12-01 15:00:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65544 states. [2018-12-01 15:00:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65544 states to 65544 states and 88582 transitions. [2018-12-01 15:00:15,003 INFO L78 Accepts]: Start accepts. Automaton has 65544 states and 88582 transitions. Word has length 35 [2018-12-01 15:00:15,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:15,003 INFO L480 AbstractCegarLoop]: Abstraction has 65544 states and 88582 transitions. [2018-12-01 15:00:15,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 65544 states and 88582 transitions. [2018-12-01 15:00:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 15:00:15,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:15,032 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-01 15:00:15,032 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:15,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:15,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2038547003, now seen corresponding path program 1 times [2018-12-01 15:00:15,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:15,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:15,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:15,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:15,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:00:15,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:15,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:15,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:15,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:15,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:15,048 INFO L87 Difference]: Start difference. First operand 65544 states and 88582 transitions. Second operand 3 states. [2018-12-01 15:00:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:15,778 INFO L93 Difference]: Finished difference Result 150540 states and 204296 transitions. [2018-12-01 15:00:15,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:15,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-01 15:00:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:15,831 INFO L225 Difference]: With dead ends: 150540 [2018-12-01 15:00:15,831 INFO L226 Difference]: Without dead ends: 86026 [2018-12-01 15:00:15,865 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-01 15:00:15,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86026 states. [2018-12-01 15:00:16,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86026 to 86024. [2018-12-01 15:00:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86024 states. [2018-12-01 15:00:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86024 states to 86024 states and 115718 transitions. [2018-12-01 15:00:17,032 INFO L78 Accepts]: Start accepts. Automaton has 86024 states and 115718 transitions. Word has length 35 [2018-12-01 15:00:17,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:17,032 INFO L480 AbstractCegarLoop]: Abstraction has 86024 states and 115718 transitions. [2018-12-01 15:00:17,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:17,032 INFO L276 IsEmpty]: Start isEmpty. Operand 86024 states and 115718 transitions. [2018-12-01 15:00:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-01 15:00:17,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:17,056 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, 1] [2018-12-01 15:00:17,056 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:17,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:17,057 INFO L82 PathProgramCache]: Analyzing trace with hash 459606565, now seen corresponding path program 1 times [2018-12-01 15:00:17,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:17,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:17,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:17,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:17,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:17,066 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-01 15:00:17,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:17,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:17,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:17,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:17,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:17,067 INFO L87 Difference]: Start difference. First operand 86024 states and 115718 transitions. Second operand 3 states. [2018-12-01 15:00:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:17,671 INFO L93 Difference]: Finished difference Result 129036 states and 173064 transitions. [2018-12-01 15:00:17,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:17,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-01 15:00:17,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:17,734 INFO L225 Difference]: With dead ends: 129036 [2018-12-01 15:00:17,734 INFO L226 Difference]: Without dead ends: 87050 [2018-12-01 15:00:17,763 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-01 15:00:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87050 states. [2018-12-01 15:00:19,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87050 to 87048. [2018-12-01 15:00:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87048 states. [2018-12-01 15:00:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87048 states to 87048 states and 115718 transitions. [2018-12-01 15:00:19,498 INFO L78 Accepts]: Start accepts. Automaton has 87048 states and 115718 transitions. Word has length 36 [2018-12-01 15:00:19,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:19,498 INFO L480 AbstractCegarLoop]: Abstraction has 87048 states and 115718 transitions. [2018-12-01 15:00:19,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 87048 states and 115718 transitions. [2018-12-01 15:00:19,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-01 15:00:19,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:19,524 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, 1] [2018-12-01 15:00:19,524 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:19,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:19,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1229337177, now seen corresponding path program 1 times [2018-12-01 15:00:19,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:19,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:19,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:19,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:19,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:19,544 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-01 15:00:19,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:19,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:19,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:19,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:19,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:19,545 INFO L87 Difference]: Start difference. First operand 87048 states and 115718 transitions. Second operand 3 states. [2018-12-01 15:00:20,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:20,554 INFO L93 Difference]: Finished difference Result 147468 states and 199688 transitions. [2018-12-01 15:00:20,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:20,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-01 15:00:20,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:20,667 INFO L225 Difference]: With dead ends: 147468 [2018-12-01 15:00:20,667 INFO L226 Difference]: Without dead ends: 147466 [2018-12-01 15:00:20,694 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-01 15:00:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2018-12-01 15:00:22,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 131080. [2018-12-01 15:00:22,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131080 states. [2018-12-01 15:00:22,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131080 states to 131080 states and 168966 transitions. [2018-12-01 15:00:22,241 INFO L78 Accepts]: Start accepts. Automaton has 131080 states and 168966 transitions. Word has length 36 [2018-12-01 15:00:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:22,242 INFO L480 AbstractCegarLoop]: Abstraction has 131080 states and 168966 transitions. [2018-12-01 15:00:22,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:22,242 INFO L276 IsEmpty]: Start isEmpty. Operand 131080 states and 168966 transitions. [2018-12-01 15:00:22,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-01 15:00:22,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:22,299 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, 1] [2018-12-01 15:00:22,299 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:22,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:22,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1071485413, now seen corresponding path program 1 times [2018-12-01 15:00:22,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:22,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:22,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:22,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:22,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:22,324 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-01 15:00:22,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:22,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:22,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:22,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:22,325 INFO L87 Difference]: Start difference. First operand 131080 states and 168966 transitions. Second operand 3 states. [2018-12-01 15:00:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:23,846 INFO L93 Difference]: Finished difference Result 299020 states and 386056 transitions. [2018-12-01 15:00:23,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:23,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-01 15:00:23,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:23,953 INFO L225 Difference]: With dead ends: 299020 [2018-12-01 15:00:23,953 INFO L226 Difference]: Without dead ends: 169994 [2018-12-01 15:00:24,009 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-01 15:00:24,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169994 states. [2018-12-01 15:00:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169994 to 169992. [2018-12-01 15:00:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169992 states. [2018-12-01 15:00:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169992 states to 169992 states and 217094 transitions. [2018-12-01 15:00:26,065 INFO L78 Accepts]: Start accepts. Automaton has 169992 states and 217094 transitions. Word has length 36 [2018-12-01 15:00:26,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:26,065 INFO L480 AbstractCegarLoop]: Abstraction has 169992 states and 217094 transitions. [2018-12-01 15:00:26,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:26,065 INFO L276 IsEmpty]: Start isEmpty. Operand 169992 states and 217094 transitions. [2018-12-01 15:00:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 15:00:26,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:26,126 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, 1, 1] [2018-12-01 15:00:26,126 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:26,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:26,126 INFO L82 PathProgramCache]: Analyzing trace with hash 545468688, now seen corresponding path program 1 times [2018-12-01 15:00:26,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:26,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:26,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:26,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:26,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:26,146 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-01 15:00:26,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:26,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:26,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:26,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:26,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:26,147 INFO L87 Difference]: Start difference. First operand 169992 states and 217094 transitions. Second operand 3 states. [2018-12-01 15:00:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:27,600 INFO L93 Difference]: Finished difference Result 254988 states and 324616 transitions. [2018-12-01 15:00:27,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:27,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-01 15:00:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:27,728 INFO L225 Difference]: With dead ends: 254988 [2018-12-01 15:00:27,728 INFO L226 Difference]: Without dead ends: 172042 [2018-12-01 15:00:27,778 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-01 15:00:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172042 states. [2018-12-01 15:00:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172042 to 172040. [2018-12-01 15:00:29,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172040 states. [2018-12-01 15:00:30,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172040 states to 172040 states and 217094 transitions. [2018-12-01 15:00:30,036 INFO L78 Accepts]: Start accepts. Automaton has 172040 states and 217094 transitions. Word has length 37 [2018-12-01 15:00:30,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:30,036 INFO L480 AbstractCegarLoop]: Abstraction has 172040 states and 217094 transitions. [2018-12-01 15:00:30,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 172040 states and 217094 transitions. [2018-12-01 15:00:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 15:00:30,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:30,090 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, 1, 1] [2018-12-01 15:00:30,090 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:30,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:30,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1143475054, now seen corresponding path program 1 times [2018-12-01 15:00:30,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:30,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:30,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:30,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:30,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:30,115 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-01 15:00:30,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:30,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:30,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:30,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:30,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:30,116 INFO L87 Difference]: Start difference. First operand 172040 states and 217094 transitions. Second operand 3 states. [2018-12-01 15:00:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:32,251 INFO L93 Difference]: Finished difference Result 286732 states and 366600 transitions. [2018-12-01 15:00:32,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:32,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-01 15:00:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:32,506 INFO L225 Difference]: With dead ends: 286732 [2018-12-01 15:00:32,506 INFO L226 Difference]: Without dead ends: 286730 [2018-12-01 15:00:32,566 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-01 15:00:32,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286730 states. [2018-12-01 15:00:35,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286730 to 262152. [2018-12-01 15:00:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262152 states. [2018-12-01 15:00:35,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262152 states to 262152 states and 321542 transitions. [2018-12-01 15:00:35,435 INFO L78 Accepts]: Start accepts. Automaton has 262152 states and 321542 transitions. Word has length 37 [2018-12-01 15:00:35,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:35,435 INFO L480 AbstractCegarLoop]: Abstraction has 262152 states and 321542 transitions. [2018-12-01 15:00:35,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:35,435 INFO L276 IsEmpty]: Start isEmpty. Operand 262152 states and 321542 transitions. [2018-12-01 15:00:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 15:00:35,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:00:35,558 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:35,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1157347536, now seen corresponding path program 1 times [2018-12-01 15:00:35,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:35,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:35,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:35,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:35,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:35,583 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-01 15:00:35,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:35,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:35,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:35,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:35,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:35,584 INFO L87 Difference]: Start difference. First operand 262152 states and 321542 transitions. Second operand 3 states. [2018-12-01 15:00:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:38,578 INFO L93 Difference]: Finished difference Result 593932 states and 727048 transitions. [2018-12-01 15:00:38,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:38,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-01 15:00:38,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:38,845 INFO L225 Difference]: With dead ends: 593932 [2018-12-01 15:00:38,845 INFO L226 Difference]: Without dead ends: 335882 [2018-12-01 15:00:38,991 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-01 15:00:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335882 states. [2018-12-01 15:00:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335882 to 335880. [2018-12-01 15:00:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335880 states. [2018-12-01 15:00:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335880 states to 335880 states and 405510 transitions. [2018-12-01 15:00:44,932 INFO L78 Accepts]: Start accepts. Automaton has 335880 states and 405510 transitions. Word has length 37 [2018-12-01 15:00:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:44,933 INFO L480 AbstractCegarLoop]: Abstraction has 335880 states and 405510 transitions. [2018-12-01 15:00:44,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 335880 states and 405510 transitions. [2018-12-01 15:00:45,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 15:00:45,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:45,064 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, 1, 1, 1] [2018-12-01 15:00:45,064 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:45,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:45,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1087772454, now seen corresponding path program 1 times [2018-12-01 15:00:45,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:45,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:45,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:45,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:45,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:45,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-01 15:00:45,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:45,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:45,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:45,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:45,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:45,077 INFO L87 Difference]: Start difference. First operand 335880 states and 405510 transitions. Second operand 3 states. [2018-12-01 15:00:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:48,012 INFO L93 Difference]: Finished difference Result 503820 states and 606216 transitions. [2018-12-01 15:00:48,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:48,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-01 15:00:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:48,299 INFO L225 Difference]: With dead ends: 503820 [2018-12-01 15:00:48,299 INFO L226 Difference]: Without dead ends: 339978 [2018-12-01 15:00:48,398 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-01 15:00:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339978 states. [2018-12-01 15:00:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339978 to 339976. [2018-12-01 15:00:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339976 states. [2018-12-01 15:00:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339976 states to 339976 states and 405510 transitions. [2018-12-01 15:00:52,792 INFO L78 Accepts]: Start accepts. Automaton has 339976 states and 405510 transitions. Word has length 38 [2018-12-01 15:00:52,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:00:52,793 INFO L480 AbstractCegarLoop]: Abstraction has 339976 states and 405510 transitions. [2018-12-01 15:00:52,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:00:52,793 INFO L276 IsEmpty]: Start isEmpty. Operand 339976 states and 405510 transitions. [2018-12-01 15:00:52,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 15:00:52,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:00:52,922 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, 1, 1, 1] [2018-12-01 15:00:52,922 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:00:52,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:00:52,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1518251100, now seen corresponding path program 1 times [2018-12-01 15:00:52,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:00:52,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:00:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:52,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:00:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:00:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:00:52,932 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-01 15:00:52,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:00:52,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:00:52,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:00:52,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:00:52,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:00:52,933 INFO L87 Difference]: Start difference. First operand 339976 states and 405510 transitions. Second operand 3 states. [2018-12-01 15:00:59,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:00:59,383 INFO L93 Difference]: Finished difference Result 557068 states and 667656 transitions. [2018-12-01 15:00:59,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:00:59,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-01 15:00:59,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:00:59,869 INFO L225 Difference]: With dead ends: 557068 [2018-12-01 15:00:59,870 INFO L226 Difference]: Without dead ends: 557066 [2018-12-01 15:00:59,922 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-01 15:01:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557066 states. [2018-12-01 15:01:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557066 to 524296. [2018-12-01 15:01:05,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524296 states. [2018-12-01 15:01:06,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524296 states to 524296 states and 610310 transitions. [2018-12-01 15:01:06,180 INFO L78 Accepts]: Start accepts. Automaton has 524296 states and 610310 transitions. Word has length 38 [2018-12-01 15:01:06,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:01:06,181 INFO L480 AbstractCegarLoop]: Abstraction has 524296 states and 610310 transitions. [2018-12-01 15:01:06,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:01:06,181 INFO L276 IsEmpty]: Start isEmpty. Operand 524296 states and 610310 transitions. [2018-12-01 15:01:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-01 15:01:06,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:01:06,438 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, 1, 1, 1] [2018-12-01 15:01:06,438 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:01:06,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:01:06,438 INFO L82 PathProgramCache]: Analyzing trace with hash -475893606, now seen corresponding path program 1 times [2018-12-01 15:01:06,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:01:06,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:01:06,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:01:06,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:01:06,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:01:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:01:06,467 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-01 15:01:06,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:01:06,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:01:06,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:01:06,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:01:06,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:01:06,468 INFO L87 Difference]: Start difference. First operand 524296 states and 610310 transitions. Second operand 3 states. [2018-12-01 15:01:12,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:01:12,853 INFO L93 Difference]: Finished difference Result 1179660 states and 1363976 transitions. [2018-12-01 15:01:12,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:01:12,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-01 15:01:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:01:16,401 INFO L225 Difference]: With dead ends: 1179660 [2018-12-01 15:01:16,402 INFO L226 Difference]: Without dead ends: 663562 [2018-12-01 15:01:16,585 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-01 15:01:16,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663562 states. [2018-12-01 15:01:24,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663562 to 663560. [2018-12-01 15:01:24,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663560 states. [2018-12-01 15:01:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663560 states to 663560 states and 753670 transitions. [2018-12-01 15:01:25,014 INFO L78 Accepts]: Start accepts. Automaton has 663560 states and 753670 transitions. Word has length 38 [2018-12-01 15:01:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:01:25,014 INFO L480 AbstractCegarLoop]: Abstraction has 663560 states and 753670 transitions. [2018-12-01 15:01:25,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:01:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 663560 states and 753670 transitions. [2018-12-01 15:01:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-01 15:01:25,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:01:25,592 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, 1, 1, 1, 1] [2018-12-01 15:01:25,592 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:01:25,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:01:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash -178639963, now seen corresponding path program 1 times [2018-12-01 15:01:25,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:01:25,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:01:25,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:01:25,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:01:25,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:01:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:01:25,601 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-01 15:01:25,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:01:25,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:01:25,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:01:25,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:01:25,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:01:25,602 INFO L87 Difference]: Start difference. First operand 663560 states and 753670 transitions. Second operand 3 states. [2018-12-01 15:01:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:01:31,994 INFO L93 Difference]: Finished difference Result 995340 states and 1126408 transitions. [2018-12-01 15:01:31,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:01:31,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-01 15:01:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:01:32,583 INFO L225 Difference]: With dead ends: 995340 [2018-12-01 15:01:32,583 INFO L226 Difference]: Without dead ends: 671754 [2018-12-01 15:01:32,721 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-01 15:01:33,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671754 states. [2018-12-01 15:01:45,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671754 to 671752. [2018-12-01 15:01:45,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671752 states. [2018-12-01 15:01:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671752 states to 671752 states and 753670 transitions. [2018-12-01 15:01:45,635 INFO L78 Accepts]: Start accepts. Automaton has 671752 states and 753670 transitions. Word has length 39 [2018-12-01 15:01:45,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:01:45,635 INFO L480 AbstractCegarLoop]: Abstraction has 671752 states and 753670 transitions. [2018-12-01 15:01:45,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:01:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 671752 states and 753670 transitions. [2018-12-01 15:01:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-01 15:01:45,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:01:45,885 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, 1, 1, 1, 1] [2018-12-01 15:01:45,885 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:01:45,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:01:45,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1867583705, now seen corresponding path program 1 times [2018-12-01 15:01:45,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:01:45,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:01:45,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:01:45,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:01:45,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:01:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:01:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:01:45,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:01:45,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:01:45,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:01:45,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:01:45,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:01:45,896 INFO L87 Difference]: Start difference. First operand 671752 states and 753670 transitions. Second operand 3 states. [2018-12-01 15:01:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:01:56,615 INFO L93 Difference]: Finished difference Result 1081354 states and 1204231 transitions. [2018-12-01 15:01:56,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:01:56,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-01 15:01:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:01:57,608 INFO L225 Difference]: With dead ends: 1081354 [2018-12-01 15:01:57,608 INFO L226 Difference]: Without dead ends: 1081352 [2018-12-01 15:01:57,716 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-01 15:01:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081352 states. [2018-12-01 15:02:13,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081352 to 1048584. [2018-12-01 15:02:13,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048584 states. [2018-12-01 15:02:15,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048584 states to 1048584 states and 1155078 transitions. [2018-12-01 15:02:15,269 INFO L78 Accepts]: Start accepts. Automaton has 1048584 states and 1155078 transitions. Word has length 39 [2018-12-01 15:02:15,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:02:15,269 INFO L480 AbstractCegarLoop]: Abstraction has 1048584 states and 1155078 transitions. [2018-12-01 15:02:15,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:02:15,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1048584 states and 1155078 transitions. [2018-12-01 15:02:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-01 15:02:15,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 15:02:15,791 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, 1, 1, 1, 1] [2018-12-01 15:02:15,792 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 15:02:15,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:02:15,792 INFO L82 PathProgramCache]: Analyzing trace with hash 433238885, now seen corresponding path program 1 times [2018-12-01 15:02:15,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:02:15,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:02:15,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:02:15,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:02:15,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:02:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:02:15,803 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-01 15:02:15,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:02:15,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:02:15,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 15:02:15,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:02:15,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:02:15,804 INFO L87 Difference]: Start difference. First operand 1048584 states and 1155078 transitions. Second operand 3 states. [2018-12-01 15:02:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:02:29,203 INFO L93 Difference]: Finished difference Result 2342920 states and 2547718 transitions. [2018-12-01 15:02:29,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:02:29,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-01 15:02:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 15:02:29,204 INFO L225 Difference]: With dead ends: 2342920 [2018-12-01 15:02:29,204 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 15:02:29,794 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-01 15:02:29,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 15:02:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 15:02:29,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 15:02:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 15:02:29,794 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-12-01 15:02:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 15:02:29,794 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 15:02:29,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 15:02:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 15:02:29,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 15:02:29,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-01 15:02:29,848 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-01 15:02:29,848 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-01 15:02:29,848 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-01 15:02:29,848 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-01 15:02:29,848 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-01 15:02:29,848 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 233) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 233) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,849 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L451 ceAbstractionStarter]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point L91-2(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L444 ceAbstractionStarter]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,850 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-12-01 15:02:29,851 INFO L448 ceAbstractionStarter]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,851 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 233) the Hoare annotation is: true [2018-12-01 15:02:29,851 INFO L448 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2018-12-01 15:02:29,851 INFO L451 ceAbstractionStarter]: At program point L229(lines 5 233) the Hoare annotation is: true [2018-12-01 15:02:29,851 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,851 INFO L448 ceAbstractionStarter]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,851 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,851 INFO L448 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2018-12-01 15:02:29,851 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,851 INFO L448 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-12-01 15:02:29,851 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,851 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,851 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,851 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-01 15:02:29,851 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2018-12-01 15:02:29,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:02:29 BoogieIcfgContainer [2018-12-01 15:02:29,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 15:02:29,856 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 15:02:29,856 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 15:02:29,856 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 15:02:29,857 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:00:07" (3/4) ... [2018-12-01 15:02:29,859 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 15:02:29,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 15:02:29,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 15:02:29,868 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-01 15:02:29,868 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-01 15:02:29,868 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-01 15:02:29,904 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_13521cec-af7d-4256-ba28-894c7a2c63c7/bin-2019/uautomizer/witness.graphml [2018-12-01 15:02:29,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 15:02:29,905 INFO L168 Benchmark]: Toolchain (without parser) took 142813.76 ms. Allocated memory was 1.0 GB in the beginning and 8.9 GB in the end (delta: 7.9 GB). Free memory was 953.3 MB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 5.6 GB. Max. memory is 11.5 GB. [2018-12-01 15:02:29,906 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:02:29,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.57 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 941.3 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-12-01 15:02:29,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.23 ms. Allocated memory is still 1.0 GB. Free memory was 941.3 MB in the beginning and 938.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 15:02:29,906 INFO L168 Benchmark]: Boogie Preprocessor took 46.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 938.6 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-01 15:02:29,906 INFO L168 Benchmark]: RCFGBuilder took 210.82 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-12-01 15:02:29,906 INFO L168 Benchmark]: TraceAbstraction took 142354.31 ms. Allocated memory was 1.1 GB in the beginning and 8.9 GB in the end (delta: 7.8 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 5.6 GB. Max. memory is 11.5 GB. [2018-12-01 15:02:29,907 INFO L168 Benchmark]: Witness Printer took 48.14 ms. Allocated memory is still 8.9 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 676.0 kB). Peak memory consumption was 676.0 kB. Max. memory is 11.5 GB. [2018-12-01 15:02:29,908 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 139.57 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 941.3 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.23 ms. Allocated memory is still 1.0 GB. Free memory was 941.3 MB in the beginning and 938.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 938.6 MB in the beginning and 1.1 GB in the end (delta: -169.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 210.82 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: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 142354.31 ms. Allocated memory was 1.1 GB in the beginning and 8.9 GB in the end (delta: 7.8 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 5.6 GB. Max. memory is 11.5 GB. * Witness Printer took 48.14 ms. Allocated memory is still 8.9 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 676.0 kB). Peak memory consumption was 676.0 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: 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: 54]: 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, 59 locations, 1 error locations. SAFE Result, 142.3s OverallTime, 43 OverallIterations, 1 TraceHistogramMax, 68.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5309 SDtfs, 2663 SDslu, 3669 SDs, 0 SdLazy, 229 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1048584occurred in iteration=42, 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: 70.5s AutomataMinimizationTime, 43 MinimizatonAttempts, 131120 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 32778 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.5s InterpolantComputationTime, 1382 NumberOfCodeBlocks, 1382 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1339 ConstructedInterpolants, 0 QuantifiedInterpolants, 89720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...