./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fe9b6a01-98ac-451e-8a14-d76fa4a5f09e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fe9b6a01-98ac-451e-8a14-d76fa4a5f09e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fe9b6a01-98ac-451e-8a14-d76fa4a5f09e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fe9b6a01-98ac-451e-8a14-d76fa4a5f09e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fe9b6a01-98ac-451e-8a14-d76fa4a5f09e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fe9b6a01-98ac-451e-8a14-d76fa4a5f09e/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 c5a3d22d49117f02662b197492bc1b16616a2878 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 22:09:51,844 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 22:09:51,845 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 22:09:51,853 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 22:09:51,854 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 22:09:51,854 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 22:09:51,855 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 22:09:51,856 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 22:09:51,857 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 22:09:51,858 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 22:09:51,859 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 22:09:51,859 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 22:09:51,860 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 22:09:51,860 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 22:09:51,861 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 22:09:51,861 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 22:09:51,862 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 22:09:51,863 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 22:09:51,864 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 22:09:51,866 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 22:09:51,866 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 22:09:51,867 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 22:09:51,869 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 22:09:51,869 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 22:09:51,869 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 22:09:51,870 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 22:09:51,870 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 22:09:51,871 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 22:09:51,871 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 22:09:51,872 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 22:09:51,872 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 22:09:51,873 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 22:09:51,873 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 22:09:51,873 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 22:09:51,874 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 22:09:51,874 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 22:09:51,874 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fe9b6a01-98ac-451e-8a14-d76fa4a5f09e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-09 22:09:51,884 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 22:09:51,884 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 22:09:51,885 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-09 22:09:51,885 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-09 22:09:51,885 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 22:09:51,886 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 22:09:51,886 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 22:09:51,886 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 22:09:51,886 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 22:09:51,886 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 22:09:51,886 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 22:09:51,887 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 22:09:51,887 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-09 22:09:51,887 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-09 22:09:51,887 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-09 22:09:51,887 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 22:09:51,887 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 22:09:51,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-09 22:09:51,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 22:09:51,888 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 22:09:51,888 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-09 22:09:51,888 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-09 22:09:51,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-09 22:09:51,888 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 22:09:51,888 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-09 22:09:51,889 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-09 22:09:51,889 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 22:09:51,889 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-09 22:09:51,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-09 22:09:51,889 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_fe9b6a01-98ac-451e-8a14-d76fa4a5f09e/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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2018-11-09 22:09:51,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 22:09:51,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 22:09:51,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 22:09:51,922 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 22:09:51,922 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 22:09:51,922 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fe9b6a01-98ac-451e-8a14-d76fa4a5f09e/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-09 22:09:51,965 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe9b6a01-98ac-451e-8a14-d76fa4a5f09e/bin-2019/uautomizer/data/ebffaedc4/790680333fb94108a093473e56c59155/FLAG139adc949 [2018-11-09 22:09:52,369 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 22:09:52,370 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fe9b6a01-98ac-451e-8a14-d76fa4a5f09e/sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-09 22:09:52,374 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe9b6a01-98ac-451e-8a14-d76fa4a5f09e/bin-2019/uautomizer/data/ebffaedc4/790680333fb94108a093473e56c59155/FLAG139adc949 [2018-11-09 22:09:52,382 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fe9b6a01-98ac-451e-8a14-d76fa4a5f09e/bin-2019/uautomizer/data/ebffaedc4/790680333fb94108a093473e56c59155 [2018-11-09 22:09:52,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 22:09:52,385 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-09 22:09:52,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 22:09:52,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 22:09:52,388 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 22:09:52,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:09:52" (1/1) ... [2018-11-09 22:09:52,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50020d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:52, skipping insertion in model container [2018-11-09 22:09:52,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:09:52" (1/1) ... [2018-11-09 22:09:52,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 22:09:52,411 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 22:09:52,511 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:09:52,513 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 22:09:52,533 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:09:52,541 INFO L193 MainTranslator]: Completed translation [2018-11-09 22:09:52,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:52 WrapperNode [2018-11-09 22:09:52,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 22:09:52,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 22:09:52,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 22:09:52,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 22:09:52,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:52" (1/1) ... [2018-11-09 22:09:52,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:52" (1/1) ... [2018-11-09 22:09:52,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:52" (1/1) ... [2018-11-09 22:09:52,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:52" (1/1) ... [2018-11-09 22:09:52,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:52" (1/1) ... [2018-11-09 22:09:52,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:52" (1/1) ... [2018-11-09 22:09:52,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:52" (1/1) ... [2018-11-09 22:09:52,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 22:09:52,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 22:09:52,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 22:09:52,562 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 22:09:52,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9b6a01-98ac-451e-8a14-d76fa4a5f09e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-09 22:09:52,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-09 22:09:52,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 22:09:52,638 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-09 22:09:52,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-09 22:09:52,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-09 22:09:52,638 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-09 22:09:52,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-09 22:09:52,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 22:09:52,832 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 22:09:52,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:09:52 BoogieIcfgContainer [2018-11-09 22:09:52,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 22:09:52,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-09 22:09:52,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-09 22:09:52,836 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-09 22:09:52,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:09:52" (1/3) ... [2018-11-09 22:09:52,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b833af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:09:52, skipping insertion in model container [2018-11-09 22:09:52,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:09:52" (2/3) ... [2018-11-09 22:09:52,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b833af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:09:52, skipping insertion in model container [2018-11-09 22:09:52,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:09:52" (3/3) ... [2018-11-09 22:09:52,838 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-09 22:09:52,844 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-09 22:09:52,849 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-09 22:09:52,857 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-09 22:09:52,873 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 22:09:52,874 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-09 22:09:52,874 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-09 22:09:52,874 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-09 22:09:52,874 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 22:09:52,874 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 22:09:52,874 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-09 22:09:52,874 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 22:09:52,875 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-09 22:09:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-09 22:09:52,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-09 22:09:52,888 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:52,888 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:52,890 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:52,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:52,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1553015003, now seen corresponding path program 1 times [2018-11-09 22:09:52,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:52,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:52,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:53,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:53,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:53,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:53,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:53,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,036 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2018-11-09 22:09:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:53,077 INFO L93 Difference]: Finished difference Result 113 states and 200 transitions. [2018-11-09 22:09:53,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:53,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-09 22:09:53,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:53,085 INFO L225 Difference]: With dead ends: 113 [2018-11-09 22:09:53,085 INFO L226 Difference]: Without dead ends: 98 [2018-11-09 22:09:53,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-09 22:09:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 67. [2018-11-09 22:09:53,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-09 22:09:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2018-11-09 22:09:53,112 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 25 [2018-11-09 22:09:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:53,112 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2018-11-09 22:09:53,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2018-11-09 22:09:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-09 22:09:53,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:53,113 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:53,113 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:53,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash -35332899, now seen corresponding path program 1 times [2018-11-09 22:09:53,114 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:53,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:53,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:53,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:53,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:53,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:53,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:53,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:53,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,169 INFO L87 Difference]: Start difference. First operand 67 states and 122 transitions. Second operand 3 states. [2018-11-09 22:09:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:53,196 INFO L93 Difference]: Finished difference Result 160 states and 295 transitions. [2018-11-09 22:09:53,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:53,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-09 22:09:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:53,197 INFO L225 Difference]: With dead ends: 160 [2018-11-09 22:09:53,197 INFO L226 Difference]: Without dead ends: 98 [2018-11-09 22:09:53,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-09 22:09:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-11-09 22:09:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-09 22:09:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 175 transitions. [2018-11-09 22:09:53,203 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 175 transitions. Word has length 25 [2018-11-09 22:09:53,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:53,203 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 175 transitions. [2018-11-09 22:09:53,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 175 transitions. [2018-11-09 22:09:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-09 22:09:53,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:53,204 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:53,204 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:53,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:53,204 INFO L82 PathProgramCache]: Analyzing trace with hash 899036922, now seen corresponding path program 1 times [2018-11-09 22:09:53,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:53,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:53,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:53,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:53,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:53,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:53,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:53,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:53,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,238 INFO L87 Difference]: Start difference. First operand 96 states and 175 transitions. Second operand 3 states. [2018-11-09 22:09:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:53,260 INFO L93 Difference]: Finished difference Result 148 states and 265 transitions. [2018-11-09 22:09:53,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:53,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-09 22:09:53,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:53,261 INFO L225 Difference]: With dead ends: 148 [2018-11-09 22:09:53,262 INFO L226 Difference]: Without dead ends: 102 [2018-11-09 22:09:53,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-09 22:09:53,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-09 22:09:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-09 22:09:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 178 transitions. [2018-11-09 22:09:53,269 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 178 transitions. Word has length 26 [2018-11-09 22:09:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:53,269 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 178 transitions. [2018-11-09 22:09:53,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 178 transitions. [2018-11-09 22:09:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-09 22:09:53,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:53,270 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:53,270 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:53,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:53,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1095107784, now seen corresponding path program 1 times [2018-11-09 22:09:53,271 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:53,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:53,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:53,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:53,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:53,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:53,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:53,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:53,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,310 INFO L87 Difference]: Start difference. First operand 100 states and 178 transitions. Second operand 3 states. [2018-11-09 22:09:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:53,330 INFO L93 Difference]: Finished difference Result 189 states and 341 transitions. [2018-11-09 22:09:53,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:53,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-09 22:09:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:53,331 INFO L225 Difference]: With dead ends: 189 [2018-11-09 22:09:53,331 INFO L226 Difference]: Without dead ends: 187 [2018-11-09 22:09:53,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-09 22:09:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 131. [2018-11-09 22:09:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-09 22:09:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 235 transitions. [2018-11-09 22:09:53,339 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 235 transitions. Word has length 26 [2018-11-09 22:09:53,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:53,339 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 235 transitions. [2018-11-09 22:09:53,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 235 transitions. [2018-11-09 22:09:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-09 22:09:53,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:53,340 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:53,340 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:53,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:53,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1611511610, now seen corresponding path program 1 times [2018-11-09 22:09:53,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:53,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:53,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:53,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:53,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:53,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:53,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:53,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:53,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,377 INFO L87 Difference]: Start difference. First operand 131 states and 235 transitions. Second operand 3 states. [2018-11-09 22:09:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:53,396 INFO L93 Difference]: Finished difference Result 311 states and 565 transitions. [2018-11-09 22:09:53,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:53,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-09 22:09:53,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:53,397 INFO L225 Difference]: With dead ends: 311 [2018-11-09 22:09:53,397 INFO L226 Difference]: Without dead ends: 189 [2018-11-09 22:09:53,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-09 22:09:53,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-11-09 22:09:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-09 22:09:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 335 transitions. [2018-11-09 22:09:53,407 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 335 transitions. Word has length 26 [2018-11-09 22:09:53,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:53,407 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 335 transitions. [2018-11-09 22:09:53,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 335 transitions. [2018-11-09 22:09:53,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-09 22:09:53,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:53,408 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:53,408 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:53,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:53,408 INFO L82 PathProgramCache]: Analyzing trace with hash 411609490, now seen corresponding path program 1 times [2018-11-09 22:09:53,409 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:53,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:53,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:53,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:53,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:53,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:53,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:53,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:53,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,442 INFO L87 Difference]: Start difference. First operand 187 states and 335 transitions. Second operand 3 states. [2018-11-09 22:09:53,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:53,475 INFO L93 Difference]: Finished difference Result 280 states and 500 transitions. [2018-11-09 22:09:53,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:53,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-09 22:09:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:53,477 INFO L225 Difference]: With dead ends: 280 [2018-11-09 22:09:53,477 INFO L226 Difference]: Without dead ends: 191 [2018-11-09 22:09:53,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-09 22:09:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-11-09 22:09:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-09 22:09:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 335 transitions. [2018-11-09 22:09:53,486 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 335 transitions. Word has length 27 [2018-11-09 22:09:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:53,486 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 335 transitions. [2018-11-09 22:09:53,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 335 transitions. [2018-11-09 22:09:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-09 22:09:53,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:53,487 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:53,487 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:53,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1582535216, now seen corresponding path program 1 times [2018-11-09 22:09:53,488 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:53,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:53,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:53,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:53,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:53,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:53,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:53,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:53,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:53,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,518 INFO L87 Difference]: Start difference. First operand 189 states and 335 transitions. Second operand 3 states. [2018-11-09 22:09:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:53,539 INFO L93 Difference]: Finished difference Result 357 states and 641 transitions. [2018-11-09 22:09:53,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:53,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-09 22:09:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:53,541 INFO L225 Difference]: With dead ends: 357 [2018-11-09 22:09:53,541 INFO L226 Difference]: Without dead ends: 355 [2018-11-09 22:09:53,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-11-09 22:09:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 253. [2018-11-09 22:09:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-09 22:09:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 447 transitions. [2018-11-09 22:09:53,550 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 447 transitions. Word has length 27 [2018-11-09 22:09:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:53,551 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 447 transitions. [2018-11-09 22:09:53,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 447 transitions. [2018-11-09 22:09:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-09 22:09:53,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:53,552 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:53,552 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:53,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:53,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1124084178, now seen corresponding path program 1 times [2018-11-09 22:09:53,553 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:53,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:53,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:53,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:53,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:53,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:53,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:53,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:53,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,580 INFO L87 Difference]: Start difference. First operand 253 states and 447 transitions. Second operand 3 states. [2018-11-09 22:09:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:53,600 INFO L93 Difference]: Finished difference Result 605 states and 1077 transitions. [2018-11-09 22:09:53,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:53,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-09 22:09:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:53,601 INFO L225 Difference]: With dead ends: 605 [2018-11-09 22:09:53,601 INFO L226 Difference]: Without dead ends: 363 [2018-11-09 22:09:53,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-11-09 22:09:53,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2018-11-09 22:09:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-11-09 22:09:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 635 transitions. [2018-11-09 22:09:53,613 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 635 transitions. Word has length 27 [2018-11-09 22:09:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:53,613 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 635 transitions. [2018-11-09 22:09:53,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 635 transitions. [2018-11-09 22:09:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-09 22:09:53,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:53,614 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:53,615 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:53,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:53,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1813738673, now seen corresponding path program 1 times [2018-11-09 22:09:53,615 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:53,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:53,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:53,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:53,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:53,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:53,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:53,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:53,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,642 INFO L87 Difference]: Start difference. First operand 361 states and 635 transitions. Second operand 3 states. [2018-11-09 22:09:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:53,658 INFO L93 Difference]: Finished difference Result 541 states and 949 transitions. [2018-11-09 22:09:53,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:53,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-09 22:09:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:53,660 INFO L225 Difference]: With dead ends: 541 [2018-11-09 22:09:53,660 INFO L226 Difference]: Without dead ends: 367 [2018-11-09 22:09:53,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-09 22:09:53,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2018-11-09 22:09:53,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-11-09 22:09:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 635 transitions. [2018-11-09 22:09:53,671 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 635 transitions. Word has length 28 [2018-11-09 22:09:53,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:53,671 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 635 transitions. [2018-11-09 22:09:53,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:53,671 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 635 transitions. [2018-11-09 22:09:53,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-09 22:09:53,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:53,672 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:53,672 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:53,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:53,673 INFO L82 PathProgramCache]: Analyzing trace with hash 487083917, now seen corresponding path program 1 times [2018-11-09 22:09:53,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:53,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:53,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:53,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:53,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:53,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:53,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:53,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:53,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,698 INFO L87 Difference]: Start difference. First operand 365 states and 635 transitions. Second operand 3 states. [2018-11-09 22:09:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:53,715 INFO L93 Difference]: Finished difference Result 685 states and 1209 transitions. [2018-11-09 22:09:53,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:53,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-09 22:09:53,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:53,718 INFO L225 Difference]: With dead ends: 685 [2018-11-09 22:09:53,718 INFO L226 Difference]: Without dead ends: 683 [2018-11-09 22:09:53,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-11-09 22:09:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 497. [2018-11-09 22:09:53,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-11-09 22:09:53,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 855 transitions. [2018-11-09 22:09:53,734 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 855 transitions. Word has length 28 [2018-11-09 22:09:53,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:53,734 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 855 transitions. [2018-11-09 22:09:53,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:53,734 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 855 transitions. [2018-11-09 22:09:53,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-09 22:09:53,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:53,735 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:53,736 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:53,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:53,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1101263985, now seen corresponding path program 1 times [2018-11-09 22:09:53,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:53,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:53,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:53,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:53,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:53,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:53,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:53,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:53,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:53,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,755 INFO L87 Difference]: Start difference. First operand 497 states and 855 transitions. Second operand 3 states. [2018-11-09 22:09:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:53,783 INFO L93 Difference]: Finished difference Result 1189 states and 2057 transitions. [2018-11-09 22:09:53,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:53,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-09 22:09:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:53,786 INFO L225 Difference]: With dead ends: 1189 [2018-11-09 22:09:53,786 INFO L226 Difference]: Without dead ends: 707 [2018-11-09 22:09:53,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-11-09 22:09:53,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 705. [2018-11-09 22:09:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-11-09 22:09:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1207 transitions. [2018-11-09 22:09:53,806 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1207 transitions. Word has length 28 [2018-11-09 22:09:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:53,807 INFO L481 AbstractCegarLoop]: Abstraction has 705 states and 1207 transitions. [2018-11-09 22:09:53,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1207 transitions. [2018-11-09 22:09:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-09 22:09:53,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:53,808 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:53,808 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:53,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:53,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2080054649, now seen corresponding path program 1 times [2018-11-09 22:09:53,809 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:53,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:53,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:53,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:53,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:53,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:53,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:53,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:53,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,830 INFO L87 Difference]: Start difference. First operand 705 states and 1207 transitions. Second operand 3 states. [2018-11-09 22:09:53,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:53,851 INFO L93 Difference]: Finished difference Result 1057 states and 1805 transitions. [2018-11-09 22:09:53,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:53,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-09 22:09:53,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:53,854 INFO L225 Difference]: With dead ends: 1057 [2018-11-09 22:09:53,854 INFO L226 Difference]: Without dead ends: 715 [2018-11-09 22:09:53,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-11-09 22:09:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 713. [2018-11-09 22:09:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-11-09 22:09:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1207 transitions. [2018-11-09 22:09:53,873 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1207 transitions. Word has length 29 [2018-11-09 22:09:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:53,873 INFO L481 AbstractCegarLoop]: Abstraction has 713 states and 1207 transitions. [2018-11-09 22:09:53,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1207 transitions. [2018-11-09 22:09:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-09 22:09:53,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:53,875 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:53,875 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:53,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:53,875 INFO L82 PathProgramCache]: Analyzing trace with hash 220767941, now seen corresponding path program 1 times [2018-11-09 22:09:53,875 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:53,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:53,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:53,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:53,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-11-09 22:09:53,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:53,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:53,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:53,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:53,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,901 INFO L87 Difference]: Start difference. First operand 713 states and 1207 transitions. Second operand 3 states. [2018-11-09 22:09:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:53,928 INFO L93 Difference]: Finished difference Result 2077 states and 3513 transitions. [2018-11-09 22:09:53,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:53,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-09 22:09:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:53,933 INFO L225 Difference]: With dead ends: 2077 [2018-11-09 22:09:53,933 INFO L226 Difference]: Without dead ends: 1387 [2018-11-09 22:09:53,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2018-11-09 22:09:53,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1385. [2018-11-09 22:09:53,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-11-09 22:09:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2311 transitions. [2018-11-09 22:09:53,970 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2311 transitions. Word has length 29 [2018-11-09 22:09:53,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:53,970 INFO L481 AbstractCegarLoop]: Abstraction has 1385 states and 2311 transitions. [2018-11-09 22:09:53,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2311 transitions. [2018-11-09 22:09:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-09 22:09:53,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:53,971 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:53,972 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:53,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:53,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1809115843, now seen corresponding path program 1 times [2018-11-09 22:09:53,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:53,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:53,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:53,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:53,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:53,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:53,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:53,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:53,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:53,991 INFO L87 Difference]: Start difference. First operand 1385 states and 2311 transitions. Second operand 3 states. [2018-11-09 22:09:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:54,018 INFO L93 Difference]: Finished difference Result 1725 states and 2937 transitions. [2018-11-09 22:09:54,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:54,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-09 22:09:54,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:54,023 INFO L225 Difference]: With dead ends: 1725 [2018-11-09 22:09:54,024 INFO L226 Difference]: Without dead ends: 1723 [2018-11-09 22:09:54,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:54,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2018-11-09 22:09:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1385. [2018-11-09 22:09:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-11-09 22:09:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2295 transitions. [2018-11-09 22:09:54,060 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 2295 transitions. Word has length 29 [2018-11-09 22:09:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:54,060 INFO L481 AbstractCegarLoop]: Abstraction has 1385 states and 2295 transitions. [2018-11-09 22:09:54,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 2295 transitions. [2018-11-09 22:09:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-09 22:09:54,062 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:54,062 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:54,062 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:54,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:54,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1745914972, now seen corresponding path program 1 times [2018-11-09 22:09:54,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:54,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:54,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:54,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:54,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:54,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:54,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:54,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:54,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:54,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:54,081 INFO L87 Difference]: Start difference. First operand 1385 states and 2295 transitions. Second operand 3 states. [2018-11-09 22:09:54,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:54,121 INFO L93 Difference]: Finished difference Result 2557 states and 4313 transitions. [2018-11-09 22:09:54,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:54,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-09 22:09:54,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:54,129 INFO L225 Difference]: With dead ends: 2557 [2018-11-09 22:09:54,129 INFO L226 Difference]: Without dead ends: 2555 [2018-11-09 22:09:54,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2018-11-09 22:09:54,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 1945. [2018-11-09 22:09:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2018-11-09 22:09:54,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 3159 transitions. [2018-11-09 22:09:54,176 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 3159 transitions. Word has length 30 [2018-11-09 22:09:54,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:54,177 INFO L481 AbstractCegarLoop]: Abstraction has 1945 states and 3159 transitions. [2018-11-09 22:09:54,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 3159 transitions. [2018-11-09 22:09:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-09 22:09:54,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:54,179 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:54,179 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:54,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:54,179 INFO L82 PathProgramCache]: Analyzing trace with hash 960704422, now seen corresponding path program 1 times [2018-11-09 22:09:54,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:54,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:54,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:54,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:54,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:54,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:54,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:54,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:54,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:54,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:54,194 INFO L87 Difference]: Start difference. First operand 1945 states and 3159 transitions. Second operand 3 states. [2018-11-09 22:09:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:54,246 INFO L93 Difference]: Finished difference Result 4637 states and 7577 transitions. [2018-11-09 22:09:54,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:54,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-09 22:09:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:54,253 INFO L225 Difference]: With dead ends: 4637 [2018-11-09 22:09:54,253 INFO L226 Difference]: Without dead ends: 2715 [2018-11-09 22:09:54,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2018-11-09 22:09:54,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2713. [2018-11-09 22:09:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2713 states. [2018-11-09 22:09:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 4391 transitions. [2018-11-09 22:09:54,329 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 4391 transitions. Word has length 30 [2018-11-09 22:09:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:54,329 INFO L481 AbstractCegarLoop]: Abstraction has 2713 states and 4391 transitions. [2018-11-09 22:09:54,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 4391 transitions. [2018-11-09 22:09:54,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-09 22:09:54,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:54,332 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:54,333 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:54,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:54,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1711424506, now seen corresponding path program 1 times [2018-11-09 22:09:54,333 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:54,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:54,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:54,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:54,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:54,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:54,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:54,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:54,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:54,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:54,349 INFO L87 Difference]: Start difference. First operand 2713 states and 4391 transitions. Second operand 3 states. [2018-11-09 22:09:54,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:54,421 INFO L93 Difference]: Finished difference Result 4093 states and 6617 transitions. [2018-11-09 22:09:54,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:54,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-09 22:09:54,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:54,428 INFO L225 Difference]: With dead ends: 4093 [2018-11-09 22:09:54,428 INFO L226 Difference]: Without dead ends: 2763 [2018-11-09 22:09:54,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:54,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2018-11-09 22:09:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2761. [2018-11-09 22:09:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2761 states. [2018-11-09 22:09:54,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 4423 transitions. [2018-11-09 22:09:54,490 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 4423 transitions. Word has length 31 [2018-11-09 22:09:54,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:54,490 INFO L481 AbstractCegarLoop]: Abstraction has 2761 states and 4423 transitions. [2018-11-09 22:09:54,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:54,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 4423 transitions. [2018-11-09 22:09:54,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-09 22:09:54,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:54,493 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:54,493 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:54,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:54,493 INFO L82 PathProgramCache]: Analyzing trace with hash -282720200, now seen corresponding path program 1 times [2018-11-09 22:09:54,494 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:54,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:54,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:54,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:54,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:54,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:54,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:54,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:54,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:54,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:54,513 INFO L87 Difference]: Start difference. First operand 2761 states and 4423 transitions. Second operand 3 states. [2018-11-09 22:09:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:54,578 INFO L93 Difference]: Finished difference Result 5005 states and 8169 transitions. [2018-11-09 22:09:54,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:54,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-09 22:09:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:54,591 INFO L225 Difference]: With dead ends: 5005 [2018-11-09 22:09:54,591 INFO L226 Difference]: Without dead ends: 5003 [2018-11-09 22:09:54,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2018-11-09 22:09:54,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 3913. [2018-11-09 22:09:54,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2018-11-09 22:09:54,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 6119 transitions. [2018-11-09 22:09:54,684 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 6119 transitions. Word has length 31 [2018-11-09 22:09:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:54,684 INFO L481 AbstractCegarLoop]: Abstraction has 3913 states and 6119 transitions. [2018-11-09 22:09:54,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:54,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 6119 transitions. [2018-11-09 22:09:54,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-09 22:09:54,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:54,688 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:54,689 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:54,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:54,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1871068102, now seen corresponding path program 1 times [2018-11-09 22:09:54,689 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:54,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:54,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:54,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:54,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:54,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:54,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:54,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:54,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:54,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:54,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:54,704 INFO L87 Difference]: Start difference. First operand 3913 states and 6119 transitions. Second operand 3 states. [2018-11-09 22:09:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:54,782 INFO L93 Difference]: Finished difference Result 9229 states and 14505 transitions. [2018-11-09 22:09:54,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:54,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-09 22:09:54,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:54,797 INFO L225 Difference]: With dead ends: 9229 [2018-11-09 22:09:54,797 INFO L226 Difference]: Without dead ends: 5387 [2018-11-09 22:09:54,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2018-11-09 22:09:54,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 5385. [2018-11-09 22:09:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5385 states. [2018-11-09 22:09:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5385 states to 5385 states and 8391 transitions. [2018-11-09 22:09:54,925 INFO L78 Accepts]: Start accepts. Automaton has 5385 states and 8391 transitions. Word has length 31 [2018-11-09 22:09:54,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:54,926 INFO L481 AbstractCegarLoop]: Abstraction has 5385 states and 8391 transitions. [2018-11-09 22:09:54,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 5385 states and 8391 transitions. [2018-11-09 22:09:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-09 22:09:54,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:54,930 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:54,930 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:54,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:54,930 INFO L82 PathProgramCache]: Analyzing trace with hash -174177477, now seen corresponding path program 1 times [2018-11-09 22:09:54,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:54,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:54,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:54,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:54,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:54,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:54,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:54,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:54,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:54,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:54,948 INFO L87 Difference]: Start difference. First operand 5385 states and 8391 transitions. Second operand 3 states. [2018-11-09 22:09:55,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:55,013 INFO L93 Difference]: Finished difference Result 8077 states and 12553 transitions. [2018-11-09 22:09:55,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:55,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-09 22:09:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:55,022 INFO L225 Difference]: With dead ends: 8077 [2018-11-09 22:09:55,022 INFO L226 Difference]: Without dead ends: 5451 [2018-11-09 22:09:55,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:55,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2018-11-09 22:09:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 5449. [2018-11-09 22:09:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5449 states. [2018-11-09 22:09:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8391 transitions. [2018-11-09 22:09:55,138 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8391 transitions. Word has length 32 [2018-11-09 22:09:55,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:55,138 INFO L481 AbstractCegarLoop]: Abstraction has 5449 states and 8391 transitions. [2018-11-09 22:09:55,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8391 transitions. [2018-11-09 22:09:55,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-09 22:09:55,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:55,142 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:55,142 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:55,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:55,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2126645113, now seen corresponding path program 1 times [2018-11-09 22:09:55,143 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:55,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:55,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:55,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:55,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:55,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:55,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:55,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:55,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:55,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:55,156 INFO L87 Difference]: Start difference. First operand 5449 states and 8391 transitions. Second operand 3 states. [2018-11-09 22:09:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:55,256 INFO L93 Difference]: Finished difference Result 9741 states and 15305 transitions. [2018-11-09 22:09:55,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:55,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-09 22:09:55,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:55,272 INFO L225 Difference]: With dead ends: 9741 [2018-11-09 22:09:55,272 INFO L226 Difference]: Without dead ends: 9739 [2018-11-09 22:09:55,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9739 states. [2018-11-09 22:09:55,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9739 to 7817. [2018-11-09 22:09:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7817 states. [2018-11-09 22:09:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7817 states to 7817 states and 11719 transitions. [2018-11-09 22:09:55,442 INFO L78 Accepts]: Start accepts. Automaton has 7817 states and 11719 transitions. Word has length 32 [2018-11-09 22:09:55,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:55,443 INFO L481 AbstractCegarLoop]: Abstraction has 7817 states and 11719 transitions. [2018-11-09 22:09:55,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 7817 states and 11719 transitions. [2018-11-09 22:09:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-09 22:09:55,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:55,452 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:55,452 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:55,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:55,452 INFO L82 PathProgramCache]: Analyzing trace with hash 538297211, now seen corresponding path program 1 times [2018-11-09 22:09:55,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:55,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:55,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:55,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:55,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:55,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:55,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:55,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:55,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:55,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:55,473 INFO L87 Difference]: Start difference. First operand 7817 states and 11719 transitions. Second operand 3 states. [2018-11-09 22:09:55,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:55,646 INFO L93 Difference]: Finished difference Result 18317 states and 27593 transitions. [2018-11-09 22:09:55,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:55,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-09 22:09:55,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:55,661 INFO L225 Difference]: With dead ends: 18317 [2018-11-09 22:09:55,661 INFO L226 Difference]: Without dead ends: 10635 [2018-11-09 22:09:55,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10635 states. [2018-11-09 22:09:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10635 to 10633. [2018-11-09 22:09:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10633 states. [2018-11-09 22:09:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10633 states to 10633 states and 15879 transitions. [2018-11-09 22:09:55,864 INFO L78 Accepts]: Start accepts. Automaton has 10633 states and 15879 transitions. Word has length 32 [2018-11-09 22:09:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:55,864 INFO L481 AbstractCegarLoop]: Abstraction has 10633 states and 15879 transitions. [2018-11-09 22:09:55,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 10633 states and 15879 transitions. [2018-11-09 22:09:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-09 22:09:55,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:55,872 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:55,872 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:55,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:55,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1501703535, now seen corresponding path program 1 times [2018-11-09 22:09:55,873 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:55,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:55,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:55,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:55,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:55,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:55,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:55,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:55,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:55,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:55,896 INFO L87 Difference]: Start difference. First operand 10633 states and 15879 transitions. Second operand 3 states. [2018-11-09 22:09:56,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:56,011 INFO L93 Difference]: Finished difference Result 15949 states and 23753 transitions. [2018-11-09 22:09:56,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:56,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-09 22:09:56,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:56,028 INFO L225 Difference]: With dead ends: 15949 [2018-11-09 22:09:56,028 INFO L226 Difference]: Without dead ends: 10763 [2018-11-09 22:09:56,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10763 states. [2018-11-09 22:09:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10763 to 10761. [2018-11-09 22:09:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10761 states. [2018-11-09 22:09:56,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10761 states to 10761 states and 15879 transitions. [2018-11-09 22:09:56,223 INFO L78 Accepts]: Start accepts. Automaton has 10761 states and 15879 transitions. Word has length 33 [2018-11-09 22:09:56,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:56,223 INFO L481 AbstractCegarLoop]: Abstraction has 10761 states and 15879 transitions. [2018-11-09 22:09:56,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 10761 states and 15879 transitions. [2018-11-09 22:09:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-09 22:09:56,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:56,231 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:56,231 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:56,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:56,231 INFO L82 PathProgramCache]: Analyzing trace with hash -492441171, now seen corresponding path program 1 times [2018-11-09 22:09:56,232 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:56,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:56,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:56,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:56,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:56,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:56,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:56,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:56,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:56,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:56,248 INFO L87 Difference]: Start difference. First operand 10761 states and 15879 transitions. Second operand 3 states. [2018-11-09 22:09:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:56,425 INFO L93 Difference]: Finished difference Result 18957 states and 28553 transitions. [2018-11-09 22:09:56,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:56,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-09 22:09:56,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:56,451 INFO L225 Difference]: With dead ends: 18957 [2018-11-09 22:09:56,451 INFO L226 Difference]: Without dead ends: 18955 [2018-11-09 22:09:56,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18955 states. [2018-11-09 22:09:56,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18955 to 15625. [2018-11-09 22:09:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15625 states. [2018-11-09 22:09:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15625 states to 15625 states and 22407 transitions. [2018-11-09 22:09:56,734 INFO L78 Accepts]: Start accepts. Automaton has 15625 states and 22407 transitions. Word has length 33 [2018-11-09 22:09:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:56,734 INFO L481 AbstractCegarLoop]: Abstraction has 15625 states and 22407 transitions. [2018-11-09 22:09:56,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 15625 states and 22407 transitions. [2018-11-09 22:09:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-09 22:09:56,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:56,745 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:56,746 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:56,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:56,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2080789073, now seen corresponding path program 1 times [2018-11-09 22:09:56,746 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:56,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:56,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:56,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:56,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:56,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-11-09 22:09:56,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:56,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:56,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:56,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:56,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:56,776 INFO L87 Difference]: Start difference. First operand 15625 states and 22407 transitions. Second operand 3 states. [2018-11-09 22:09:56,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:56,931 INFO L93 Difference]: Finished difference Result 36365 states and 52361 transitions. [2018-11-09 22:09:56,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:56,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-09 22:09:56,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:56,946 INFO L225 Difference]: With dead ends: 36365 [2018-11-09 22:09:56,946 INFO L226 Difference]: Without dead ends: 21003 [2018-11-09 22:09:56,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:56,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21003 states. [2018-11-09 22:09:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21003 to 21001. [2018-11-09 22:09:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21001 states. [2018-11-09 22:09:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21001 states to 21001 states and 29959 transitions. [2018-11-09 22:09:57,169 INFO L78 Accepts]: Start accepts. Automaton has 21001 states and 29959 transitions. Word has length 33 [2018-11-09 22:09:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:57,169 INFO L481 AbstractCegarLoop]: Abstraction has 21001 states and 29959 transitions. [2018-11-09 22:09:57,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 21001 states and 29959 transitions. [2018-11-09 22:09:57,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-09 22:09:57,176 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:57,176 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:57,176 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:57,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:57,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1914407696, now seen corresponding path program 1 times [2018-11-09 22:09:57,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:57,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:57,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:57,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:57,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:57,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:57,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:57,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:57,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:57,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:57,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:57,205 INFO L87 Difference]: Start difference. First operand 21001 states and 29959 transitions. Second operand 3 states. [2018-11-09 22:09:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:57,373 INFO L93 Difference]: Finished difference Result 31501 states and 44809 transitions. [2018-11-09 22:09:57,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:57,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-09 22:09:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:57,390 INFO L225 Difference]: With dead ends: 31501 [2018-11-09 22:09:57,390 INFO L226 Difference]: Without dead ends: 21259 [2018-11-09 22:09:57,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21259 states. [2018-11-09 22:09:57,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21259 to 21257. [2018-11-09 22:09:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21257 states. [2018-11-09 22:09:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21257 states to 21257 states and 29959 transitions. [2018-11-09 22:09:57,652 INFO L78 Accepts]: Start accepts. Automaton has 21257 states and 29959 transitions. Word has length 34 [2018-11-09 22:09:57,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:57,652 INFO L481 AbstractCegarLoop]: Abstraction has 21257 states and 29959 transitions. [2018-11-09 22:09:57,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 21257 states and 29959 transitions. [2018-11-09 22:09:57,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-09 22:09:57,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:57,660 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:57,660 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:57,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:57,660 INFO L82 PathProgramCache]: Analyzing trace with hash -79737010, now seen corresponding path program 1 times [2018-11-09 22:09:57,660 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:57,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:57,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:57,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:57,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:57,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-11-09 22:09:57,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:57,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:57,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:57,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:57,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:57,679 INFO L87 Difference]: Start difference. First operand 21257 states and 29959 transitions. Second operand 3 states. [2018-11-09 22:09:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:57,899 INFO L93 Difference]: Finished difference Result 36877 states and 53001 transitions. [2018-11-09 22:09:57,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:57,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-09 22:09:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:57,922 INFO L225 Difference]: With dead ends: 36877 [2018-11-09 22:09:57,922 INFO L226 Difference]: Without dead ends: 36875 [2018-11-09 22:09:57,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36875 states. [2018-11-09 22:09:58,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36875 to 31241. [2018-11-09 22:09:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31241 states. [2018-11-09 22:09:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31241 states to 31241 states and 42759 transitions. [2018-11-09 22:09:58,306 INFO L78 Accepts]: Start accepts. Automaton has 31241 states and 42759 transitions. Word has length 34 [2018-11-09 22:09:58,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:58,307 INFO L481 AbstractCegarLoop]: Abstraction has 31241 states and 42759 transitions. [2018-11-09 22:09:58,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 31241 states and 42759 transitions. [2018-11-09 22:09:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-09 22:09:58,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:58,319 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:58,319 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:58,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:58,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1668084912, now seen corresponding path program 1 times [2018-11-09 22:09:58,320 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:58,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:58,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:58,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:58,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:58,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:58,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:58,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:58,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:58,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:58,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:58,348 INFO L87 Difference]: Start difference. First operand 31241 states and 42759 transitions. Second operand 3 states. [2018-11-09 22:09:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:58,641 INFO L93 Difference]: Finished difference Result 72205 states and 99081 transitions. [2018-11-09 22:09:58,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:58,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-09 22:09:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:58,668 INFO L225 Difference]: With dead ends: 72205 [2018-11-09 22:09:58,668 INFO L226 Difference]: Without dead ends: 41483 [2018-11-09 22:09:58,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:58,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41483 states. [2018-11-09 22:09:59,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41483 to 41481. [2018-11-09 22:09:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41481 states. [2018-11-09 22:09:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41481 states to 41481 states and 56327 transitions. [2018-11-09 22:09:59,326 INFO L78 Accepts]: Start accepts. Automaton has 41481 states and 56327 transitions. Word has length 34 [2018-11-09 22:09:59,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:09:59,326 INFO L481 AbstractCegarLoop]: Abstraction has 41481 states and 56327 transitions. [2018-11-09 22:09:59,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:09:59,326 INFO L276 IsEmpty]: Start isEmpty. Operand 41481 states and 56327 transitions. [2018-11-09 22:09:59,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-09 22:09:59,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:09:59,339 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:09:59,339 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:09:59,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:09:59,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1823335140, now seen corresponding path program 1 times [2018-11-09 22:09:59,339 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:09:59,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:09:59,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:59,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:09:59,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:09:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:09:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:09:59,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:09:59,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:09:59,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:09:59,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:09:59,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:59,376 INFO L87 Difference]: Start difference. First operand 41481 states and 56327 transitions. Second operand 3 states. [2018-11-09 22:09:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:09:59,666 INFO L93 Difference]: Finished difference Result 62221 states and 84233 transitions. [2018-11-09 22:09:59,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:09:59,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-09 22:09:59,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:09:59,693 INFO L225 Difference]: With dead ends: 62221 [2018-11-09 22:09:59,693 INFO L226 Difference]: Without dead ends: 41995 [2018-11-09 22:09:59,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:09:59,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41995 states. [2018-11-09 22:10:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41995 to 41993. [2018-11-09 22:10:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41993 states. [2018-11-09 22:10:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41993 states to 41993 states and 56327 transitions. [2018-11-09 22:10:00,220 INFO L78 Accepts]: Start accepts. Automaton has 41993 states and 56327 transitions. Word has length 35 [2018-11-09 22:10:00,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:10:00,220 INFO L481 AbstractCegarLoop]: Abstraction has 41993 states and 56327 transitions. [2018-11-09 22:10:00,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:10:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 41993 states and 56327 transitions. [2018-11-09 22:10:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-09 22:10:00,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:10:00,237 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:10:00,237 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:10:00,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:10:00,237 INFO L82 PathProgramCache]: Analyzing trace with hash -170809566, now seen corresponding path program 1 times [2018-11-09 22:10:00,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:10:00,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:10:00,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:00,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:10:00,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:10:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:10:00,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:10:00,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:10:00,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:10:00,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:10:00,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:00,262 INFO L87 Difference]: Start difference. First operand 41993 states and 56327 transitions. Second operand 3 states. [2018-11-09 22:10:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:10:00,911 INFO L93 Difference]: Finished difference Result 71693 states and 97801 transitions. [2018-11-09 22:10:00,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:10:00,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-09 22:10:00,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:10:00,950 INFO L225 Difference]: With dead ends: 71693 [2018-11-09 22:10:00,950 INFO L226 Difference]: Without dead ends: 71691 [2018-11-09 22:10:00,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71691 states. [2018-11-09 22:10:01,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71691 to 62473. [2018-11-09 22:10:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62473 states. [2018-11-09 22:10:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62473 states to 62473 states and 81415 transitions. [2018-11-09 22:10:01,599 INFO L78 Accepts]: Start accepts. Automaton has 62473 states and 81415 transitions. Word has length 35 [2018-11-09 22:10:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:10:01,599 INFO L481 AbstractCegarLoop]: Abstraction has 62473 states and 81415 transitions. [2018-11-09 22:10:01,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:10:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 62473 states and 81415 transitions. [2018-11-09 22:10:01,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-09 22:10:01,811 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:10:01,811 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:10:01,811 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:10:01,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:10:01,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1759157468, now seen corresponding path program 1 times [2018-11-09 22:10:01,812 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:10:01,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:10:01,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:01,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:10:01,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:10:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:10:01,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:10:01,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:10:01,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:10:01,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:10:01,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:01,824 INFO L87 Difference]: Start difference. First operand 62473 states and 81415 transitions. Second operand 3 states. [2018-11-09 22:10:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:10:02,440 INFO L93 Difference]: Finished difference Result 143373 states and 186889 transitions. [2018-11-09 22:10:02,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:10:02,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-09 22:10:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:10:02,497 INFO L225 Difference]: With dead ends: 143373 [2018-11-09 22:10:02,497 INFO L226 Difference]: Without dead ends: 81931 [2018-11-09 22:10:02,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:02,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81931 states. [2018-11-09 22:10:03,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81931 to 81929. [2018-11-09 22:10:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81929 states. [2018-11-09 22:10:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81929 states to 81929 states and 105479 transitions. [2018-11-09 22:10:03,865 INFO L78 Accepts]: Start accepts. Automaton has 81929 states and 105479 transitions. Word has length 35 [2018-11-09 22:10:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:10:03,865 INFO L481 AbstractCegarLoop]: Abstraction has 81929 states and 105479 transitions. [2018-11-09 22:10:03,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:10:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 81929 states and 105479 transitions. [2018-11-09 22:10:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-09 22:10:03,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:10:03,891 INFO L375 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-11-09 22:10:03,891 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:10:03,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:10:03,891 INFO L82 PathProgramCache]: Analyzing trace with hash -999913755, now seen corresponding path program 1 times [2018-11-09 22:10:03,891 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:10:03,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:10:03,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:03,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:10:03,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:10:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:10:03,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:10:03,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:10:03,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:10:03,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:10:03,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:03,918 INFO L87 Difference]: Start difference. First operand 81929 states and 105479 transitions. Second operand 3 states. [2018-11-09 22:10:04,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:10:04,524 INFO L93 Difference]: Finished difference Result 122893 states and 157705 transitions. [2018-11-09 22:10:04,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:10:04,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-09 22:10:04,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:10:04,585 INFO L225 Difference]: With dead ends: 122893 [2018-11-09 22:10:04,585 INFO L226 Difference]: Without dead ends: 82955 [2018-11-09 22:10:04,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82955 states. [2018-11-09 22:10:05,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82955 to 82953. [2018-11-09 22:10:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82953 states. [2018-11-09 22:10:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82953 states to 82953 states and 105479 transitions. [2018-11-09 22:10:05,803 INFO L78 Accepts]: Start accepts. Automaton has 82953 states and 105479 transitions. Word has length 36 [2018-11-09 22:10:05,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:10:05,803 INFO L481 AbstractCegarLoop]: Abstraction has 82953 states and 105479 transitions. [2018-11-09 22:10:05,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:10:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 82953 states and 105479 transitions. [2018-11-09 22:10:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-09 22:10:05,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:10:05,828 INFO L375 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-11-09 22:10:05,828 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:10:05,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:10:05,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1300908835, now seen corresponding path program 1 times [2018-11-09 22:10:05,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:10:05,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:10:05,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:05,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:10:05,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:10:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:10:05,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:10:05,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:10:05,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:10:05,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:10:05,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:05,857 INFO L87 Difference]: Start difference. First operand 82953 states and 105479 transitions. Second operand 3 states. [2018-11-09 22:10:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:10:06,878 INFO L93 Difference]: Finished difference Result 139277 states and 179209 transitions. [2018-11-09 22:10:06,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:10:06,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-09 22:10:06,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:10:06,986 INFO L225 Difference]: With dead ends: 139277 [2018-11-09 22:10:06,986 INFO L226 Difference]: Without dead ends: 139275 [2018-11-09 22:10:07,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139275 states. [2018-11-09 22:10:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139275 to 124937. [2018-11-09 22:10:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124937 states. [2018-11-09 22:10:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124937 states to 124937 states and 154631 transitions. [2018-11-09 22:10:08,613 INFO L78 Accepts]: Start accepts. Automaton has 124937 states and 154631 transitions. Word has length 36 [2018-11-09 22:10:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:10:08,613 INFO L481 AbstractCegarLoop]: Abstraction has 124937 states and 154631 transitions. [2018-11-09 22:10:08,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:10:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 124937 states and 154631 transitions. [2018-11-09 22:10:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-09 22:10:08,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:10:08,660 INFO L375 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-11-09 22:10:08,661 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:10:08,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:10:08,661 INFO L82 PathProgramCache]: Analyzing trace with hash -287439067, now seen corresponding path program 1 times [2018-11-09 22:10:08,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:10:08,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:10:08,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:08,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:10:08,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:10:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:10:08,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:10:08,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:10:08,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:10:08,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:10:08,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:08,692 INFO L87 Difference]: Start difference. First operand 124937 states and 154631 transitions. Second operand 3 states. [2018-11-09 22:10:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:10:10,080 INFO L93 Difference]: Finished difference Result 284685 states and 351241 transitions. [2018-11-09 22:10:10,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:10:10,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-09 22:10:10,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:10:10,204 INFO L225 Difference]: With dead ends: 284685 [2018-11-09 22:10:10,204 INFO L226 Difference]: Without dead ends: 161803 [2018-11-09 22:10:10,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161803 states. [2018-11-09 22:10:12,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161803 to 161801. [2018-11-09 22:10:12,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161801 states. [2018-11-09 22:10:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161801 states to 161801 states and 196615 transitions. [2018-11-09 22:10:12,526 INFO L78 Accepts]: Start accepts. Automaton has 161801 states and 196615 transitions. Word has length 36 [2018-11-09 22:10:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:10:12,526 INFO L481 AbstractCegarLoop]: Abstraction has 161801 states and 196615 transitions. [2018-11-09 22:10:12,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:10:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 161801 states and 196615 transitions. [2018-11-09 22:10:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-09 22:10:12,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:10:12,583 INFO L375 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-11-09 22:10:12,583 INFO L424 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:10:12,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:10:12,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1673684057, now seen corresponding path program 1 times [2018-11-09 22:10:12,583 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:10:12,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:10:12,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:12,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:10:12,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:10:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:10:12,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:10:12,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:10:12,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:10:12,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:10:12,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:12,609 INFO L87 Difference]: Start difference. First operand 161801 states and 196615 transitions. Second operand 3 states. [2018-11-09 22:10:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:10:13,974 INFO L93 Difference]: Finished difference Result 242701 states and 293897 transitions. [2018-11-09 22:10:13,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:10:13,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-09 22:10:13,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:10:14,123 INFO L225 Difference]: With dead ends: 242701 [2018-11-09 22:10:14,124 INFO L226 Difference]: Without dead ends: 163851 [2018-11-09 22:10:14,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:14,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163851 states. [2018-11-09 22:10:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163851 to 163849. [2018-11-09 22:10:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163849 states. [2018-11-09 22:10:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163849 states to 163849 states and 196615 transitions. [2018-11-09 22:10:18,077 INFO L78 Accepts]: Start accepts. Automaton has 163849 states and 196615 transitions. Word has length 37 [2018-11-09 22:10:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:10:18,078 INFO L481 AbstractCegarLoop]: Abstraction has 163849 states and 196615 transitions. [2018-11-09 22:10:18,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:10:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 163849 states and 196615 transitions. [2018-11-09 22:10:18,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-09 22:10:18,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:10:18,144 INFO L375 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-11-09 22:10:18,144 INFO L424 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:10:18,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:10:18,144 INFO L82 PathProgramCache]: Analyzing trace with hash -320460649, now seen corresponding path program 1 times [2018-11-09 22:10:18,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:10:18,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:10:18,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:18,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:10:18,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:10:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:10:18,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:10:18,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:10:18,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:10:18,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:10:18,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:18,199 INFO L87 Difference]: Start difference. First operand 163849 states and 196615 transitions. Second operand 3 states. [2018-11-09 22:10:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:10:21,007 INFO L93 Difference]: Finished difference Result 479245 states and 565257 transitions. [2018-11-09 22:10:21,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:10:21,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-09 22:10:21,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:10:21,269 INFO L225 Difference]: With dead ends: 479245 [2018-11-09 22:10:21,269 INFO L226 Difference]: Without dead ends: 319499 [2018-11-09 22:10:21,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:21,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319499 states. [2018-11-09 22:10:25,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319499 to 319497. [2018-11-09 22:10:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319497 states. [2018-11-09 22:10:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319497 states to 319497 states and 368647 transitions. [2018-11-09 22:10:25,779 INFO L78 Accepts]: Start accepts. Automaton has 319497 states and 368647 transitions. Word has length 37 [2018-11-09 22:10:25,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:10:25,780 INFO L481 AbstractCegarLoop]: Abstraction has 319497 states and 368647 transitions. [2018-11-09 22:10:25,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:10:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 319497 states and 368647 transitions. [2018-11-09 22:10:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-09 22:10:25,894 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:10:25,894 INFO L375 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-11-09 22:10:25,894 INFO L424 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:10:25,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:10:25,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1267887253, now seen corresponding path program 1 times [2018-11-09 22:10:25,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:10:25,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:10:25,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:25,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:10:25,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:10:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:10:25,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:10:25,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:10:25,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:10:25,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:10:25,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:25,920 INFO L87 Difference]: Start difference. First operand 319497 states and 368647 transitions. Second operand 3 states. [2018-11-09 22:10:29,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:10:29,620 INFO L93 Difference]: Finished difference Result 339981 states and 397321 transitions. [2018-11-09 22:10:29,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:10:29,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-09 22:10:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:10:29,904 INFO L225 Difference]: With dead ends: 339981 [2018-11-09 22:10:29,905 INFO L226 Difference]: Without dead ends: 339979 [2018-11-09 22:10:29,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339979 states. [2018-11-09 22:10:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339979 to 319497. [2018-11-09 22:10:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319497 states. [2018-11-09 22:10:36,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319497 states to 319497 states and 364551 transitions. [2018-11-09 22:10:36,817 INFO L78 Accepts]: Start accepts. Automaton has 319497 states and 364551 transitions. Word has length 37 [2018-11-09 22:10:36,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:10:36,817 INFO L481 AbstractCegarLoop]: Abstraction has 319497 states and 364551 transitions. [2018-11-09 22:10:36,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:10:36,818 INFO L276 IsEmpty]: Start isEmpty. Operand 319497 states and 364551 transitions. [2018-11-09 22:10:36,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-09 22:10:36,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:10:36,943 INFO L375 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-11-09 22:10:36,943 INFO L424 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:10:36,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:10:36,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1344129350, now seen corresponding path program 1 times [2018-11-09 22:10:36,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:10:36,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:10:36,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:36,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:10:36,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:10:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:10:36,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:10:36,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:10:36,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:10:36,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:10:36,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:36,965 INFO L87 Difference]: Start difference. First operand 319497 states and 364551 transitions. Second operand 3 states. [2018-11-09 22:10:41,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:10:41,790 INFO L93 Difference]: Finished difference Result 520203 states and 589832 transitions. [2018-11-09 22:10:41,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:10:41,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-09 22:10:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:10:42,577 INFO L225 Difference]: With dead ends: 520203 [2018-11-09 22:10:42,577 INFO L226 Difference]: Without dead ends: 520201 [2018-11-09 22:10:42,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:42,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520201 states. [2018-11-09 22:10:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520201 to 495625. [2018-11-09 22:10:47,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495625 states. [2018-11-09 22:10:48,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495625 states to 495625 states and 557063 transitions. [2018-11-09 22:10:48,032 INFO L78 Accepts]: Start accepts. Automaton has 495625 states and 557063 transitions. Word has length 38 [2018-11-09 22:10:48,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:10:48,032 INFO L481 AbstractCegarLoop]: Abstraction has 495625 states and 557063 transitions. [2018-11-09 22:10:48,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:10:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 495625 states and 557063 transitions. [2018-11-09 22:10:48,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-09 22:10:48,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-09 22:10:48,268 INFO L375 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-11-09 22:10:48,268 INFO L424 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-09 22:10:48,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:10:48,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1362490044, now seen corresponding path program 1 times [2018-11-09 22:10:48,268 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:10:48,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:10:48,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:48,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:10:48,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:10:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:10:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:10:48,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:10:48,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:10:48,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-09 22:10:48,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:10:48,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:48,312 INFO L87 Difference]: Start difference. First operand 495625 states and 557063 transitions. Second operand 3 states. [2018-11-09 22:10:57,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:10:57,621 INFO L93 Difference]: Finished difference Result 1118217 states and 1245191 transitions. [2018-11-09 22:10:57,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:10:57,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-09 22:10:57,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-09 22:10:57,622 INFO L225 Difference]: With dead ends: 1118217 [2018-11-09 22:10:57,622 INFO L226 Difference]: Without dead ends: 0 [2018-11-09 22:10:57,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:10:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-09 22:10:57,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-09 22:10:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-09 22:10:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-09 22:10:57,985 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-11-09 22:10:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-09 22:10:57,985 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:10:57,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-09 22:10:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-09 22:10:57,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-09 22:10:57,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-09 22:10:58,039 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-09 22:10:58,039 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-09 22:10:58,040 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,040 INFO L425 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L428 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L421 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-09 22:10:58,041 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2018-11-09 22:10:58,041 INFO L425 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,042 INFO L425 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,042 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-09 22:10:58,042 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,042 INFO L425 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,042 INFO L425 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,042 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-09 22:10:58,042 INFO L428 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2018-11-09 22:10:58,042 INFO L425 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,042 INFO L425 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,042 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-09 22:10:58,042 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,042 INFO L425 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-11-09 22:10:58,042 INFO L425 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2018-11-09 22:10:58,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:10:58 BoogieIcfgContainer [2018-11-09 22:10:58,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-09 22:10:58,047 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 22:10:58,047 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 22:10:58,047 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 22:10:58,047 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:09:52" (3/4) ... [2018-11-09 22:10:58,050 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-09 22:10:58,056 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-09 22:10:58,057 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-09 22:10:58,061 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-09 22:10:58,062 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-09 22:10:58,062 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-09 22:10:58,117 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fe9b6a01-98ac-451e-8a14-d76fa4a5f09e/bin-2019/uautomizer/witness.graphml [2018-11-09 22:10:58,117 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 22:10:58,118 INFO L168 Benchmark]: Toolchain (without parser) took 65733.38 ms. Allocated memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: 5.3 GB). Free memory was 962.5 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-11-09 22:10:58,120 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:10:58,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.93 ms. Allocated memory is still 1.0 GB. Free memory was 962.5 MB in the beginning and 946.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-09 22:10:58,120 INFO L168 Benchmark]: Boogie Preprocessor took 19.88 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:10:58,120 INFO L168 Benchmark]: RCFGBuilder took 271.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -143.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-09 22:10:58,120 INFO L168 Benchmark]: TraceAbstraction took 65213.47 ms. Allocated memory was 1.1 GB in the beginning and 6.3 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-11-09 22:10:58,121 INFO L168 Benchmark]: Witness Printer took 70.31 ms. Allocated memory is still 6.3 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 552.1 kB). Peak memory consumption was 552.1 kB. Max. memory is 11.5 GB. [2018-11-09 22:10:58,122 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 155.93 ms. Allocated memory is still 1.0 GB. Free memory was 962.5 MB in the beginning and 946.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.88 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 271.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -143.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 65213.47 ms. Allocated memory was 1.1 GB in the beginning and 6.3 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 3.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 70.31 ms. Allocated memory is still 6.3 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 552.1 kB). Peak memory consumption was 552.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 1 error locations. SAFE Result, 65.1s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 31.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4609 SDtfs, 2290 SDslu, 3157 SDs, 0 SdLazy, 207 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=495625occurred in iteration=38, 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: 31.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 81961 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 16394 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1230 NumberOfCodeBlocks, 1230 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1191 ConstructedInterpolants, 0 QuantifiedInterpolants, 75887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...